./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --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(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:45:25,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:45:25,023 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:45:25,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:45:25,042 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:45:25,043 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:45:25,044 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:45:25,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:45:25,046 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:45:25,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:45:25,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:45:25,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:45:25,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:45:25,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:45:25,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:45:25,052 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:45:25,053 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:45:25,054 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:45:25,056 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:45:25,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:45:25,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:45:25,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:45:25,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:45:25,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:45:25,071 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:45:25,072 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:45:25,077 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:45:25,079 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:45:25,081 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:45:25,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:45:25,086 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:45:25,087 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:45:25,087 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:45:25,087 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:45:25,088 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:45:25,088 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:45:25,088 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-27 04:45:25,107 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:45:25,108 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:45:25,109 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:45:25,109 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:45:25,109 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 04:45:25,109 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:45:25,109 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:45:25,110 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:45:25,110 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:45:25,110 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:45:25,110 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:45:25,110 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:45:25,110 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:45:25,110 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:45:25,110 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:45:25,111 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:45:25,111 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:45:25,111 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:45:25,111 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:45:25,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:45:25,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:45:25,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:45:25,112 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:45:25,112 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 04:45:25,112 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:45:25,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_f24eaa3e-1114-41fe-b036-58b82024ca59/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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-10-27 04:45:25,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:45:25,152 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:45:25,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:45:25,156 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:45:25,156 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:45:25,157 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-10-27 04:45:25,200 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/bin-2019/uautomizer/data/eb498551a/fdc92140d33b485283683b54840ffc6f/FLAGc656c5d38 [2018-10-27 04:45:25,653 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:45:25,653 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-10-27 04:45:25,660 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/bin-2019/uautomizer/data/eb498551a/fdc92140d33b485283683b54840ffc6f/FLAGc656c5d38 [2018-10-27 04:45:25,672 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/bin-2019/uautomizer/data/eb498551a/fdc92140d33b485283683b54840ffc6f [2018-10-27 04:45:25,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:45:25,675 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 04:45:25,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:45:25,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:45:25,679 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:45:25,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:45:25" (1/1) ... [2018-10-27 04:45:25,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@694cfa13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:25, skipping insertion in model container [2018-10-27 04:45:25,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:45:25" (1/1) ... [2018-10-27 04:45:25,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:45:25,733 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:45:25,995 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:45:26,001 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:45:26,049 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:45:26,082 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:45:26,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:26 WrapperNode [2018-10-27 04:45:26,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:45:26,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:45:26,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:45:26,083 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:45:26,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:26" (1/1) ... [2018-10-27 04:45:26,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:26" (1/1) ... [2018-10-27 04:45:26,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:26" (1/1) ... [2018-10-27 04:45:26,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:26" (1/1) ... [2018-10-27 04:45:26,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:26" (1/1) ... [2018-10-27 04:45:26,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:26" (1/1) ... [2018-10-27 04:45:26,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:26" (1/1) ... [2018-10-27 04:45:26,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:45:26,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:45:26,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:45:26,200 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:45:26,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/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-10-27 04:45:26,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:45:26,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:45:26,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:45:26,254 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-10-27 04:45:26,254 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-10-27 04:45:26,254 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-10-27 04:45:26,254 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-10-27 04:45:26,254 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-10-27 04:45:26,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-10-27 04:45:26,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-10-27 04:45:26,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-10-27 04:45:26,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-10-27 04:45:26,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-10-27 04:45:26,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-10-27 04:45:26,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-10-27 04:45:26,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-10-27 04:45:26,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-10-27 04:45:26,255 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-10-27 04:45:26,255 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-10-27 04:45:26,255 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-10-27 04:45:26,255 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-10-27 04:45:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-10-27 04:45:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-10-27 04:45:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-10-27 04:45:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-10-27 04:45:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-10-27 04:45:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-10-27 04:45:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-10-27 04:45:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-10-27 04:45:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-10-27 04:45:26,257 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-10-27 04:45:26,257 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-10-27 04:45:26,257 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-10-27 04:45:26,257 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-10-27 04:45:26,257 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-10-27 04:45:26,257 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-10-27 04:45:26,257 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-10-27 04:45:26,257 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-10-27 04:45:26,258 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-10-27 04:45:26,258 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-10-27 04:45:26,258 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-10-27 04:45:26,258 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-10-27 04:45:26,258 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-10-27 04:45:26,258 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-10-27 04:45:26,258 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-10-27 04:45:26,258 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-10-27 04:45:26,258 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-10-27 04:45:26,258 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-10-27 04:45:26,258 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-10-27 04:45:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-10-27 04:45:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-10-27 04:45:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-10-27 04:45:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-10-27 04:45:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-27 04:45:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-27 04:45:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-10-27 04:45:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-10-27 04:45:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-10-27 04:45:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-10-27 04:45:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-10-27 04:45:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-10-27 04:45:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-10-27 04:45:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-10-27 04:45:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-10-27 04:45:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-10-27 04:45:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-10-27 04:45:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-27 04:45:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-10-27 04:45:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-10-27 04:45:26,261 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-10-27 04:45:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-10-27 04:45:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-10-27 04:45:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-10-27 04:45:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-10-27 04:45:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-10-27 04:45:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-10-27 04:45:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-10-27 04:45:26,266 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-10-27 04:45:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-10-27 04:45:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-10-27 04:45:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-10-27 04:45:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-10-27 04:45:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-10-27 04:45:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-10-27 04:45:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-10-27 04:45:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-10-27 04:45:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-10-27 04:45:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-10-27 04:45:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-10-27 04:45:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-10-27 04:45:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-10-27 04:45:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-10-27 04:45:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-10-27 04:45:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-10-27 04:45:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-10-27 04:45:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-10-27 04:45:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-10-27 04:45:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-10-27 04:45:26,269 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-10-27 04:45:26,269 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-10-27 04:45:26,269 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-10-27 04:45:26,269 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-10-27 04:45:26,269 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-10-27 04:45:26,269 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-10-27 04:45:26,269 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-10-27 04:45:26,269 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-10-27 04:45:26,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-27 04:45:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 04:45:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:45:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-27 04:45:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-27 04:45:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-27 04:45:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-27 04:45:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:45:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:45:27,514 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:45:27,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:27 BoogieIcfgContainer [2018-10-27 04:45:27,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:45:27,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:45:27,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:45:27,519 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:45:27,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:45:25" (1/3) ... [2018-10-27 04:45:27,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d96bd3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:45:27, skipping insertion in model container [2018-10-27 04:45:27,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:26" (2/3) ... [2018-10-27 04:45:27,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d96bd3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:45:27, skipping insertion in model container [2018-10-27 04:45:27,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:27" (3/3) ... [2018-10-27 04:45:27,523 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-10-27 04:45:27,531 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:45:27,537 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-10-27 04:45:27,550 INFO L257 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2018-10-27 04:45:27,570 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 04:45:27,571 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:45:27,571 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:45:27,571 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:45:27,571 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:45:27,572 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:45:27,572 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:45:27,572 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:45:27,572 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:45:27,590 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2018-10-27 04:45:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-27 04:45:27,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:27,599 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:27,600 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:27,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:27,606 INFO L82 PathProgramCache]: Analyzing trace with hash 424313087, now seen corresponding path program 1 times [2018-10-27 04:45:27,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:27,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:27,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:27,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:27,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:27,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:27,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:27,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:27,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:27,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:27,771 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 4 states. [2018-10-27 04:45:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:28,271 INFO L93 Difference]: Finished difference Result 223 states and 235 transitions. [2018-10-27 04:45:28,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:28,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-27 04:45:28,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:28,282 INFO L225 Difference]: With dead ends: 223 [2018-10-27 04:45:28,282 INFO L226 Difference]: Without dead ends: 219 [2018-10-27 04:45:28,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:28,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-27 04:45:28,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 185. [2018-10-27 04:45:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-27 04:45:28,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2018-10-27 04:45:28,329 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 8 [2018-10-27 04:45:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:28,330 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2018-10-27 04:45:28,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2018-10-27 04:45:28,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-27 04:45:28,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:28,330 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:28,331 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:28,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:28,331 INFO L82 PathProgramCache]: Analyzing trace with hash 424313088, now seen corresponding path program 1 times [2018-10-27 04:45:28,331 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:28,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:28,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:28,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:28,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:28,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:28,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:28,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:28,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:28,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:28,411 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand 4 states. [2018-10-27 04:45:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:28,650 INFO L93 Difference]: Finished difference Result 212 states and 224 transitions. [2018-10-27 04:45:28,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:28,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-27 04:45:28,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:28,653 INFO L225 Difference]: With dead ends: 212 [2018-10-27 04:45:28,653 INFO L226 Difference]: Without dead ends: 212 [2018-10-27 04:45:28,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-27 04:45:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-27 04:45:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 199. [2018-10-27 04:45:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-27 04:45:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 219 transitions. [2018-10-27 04:45:28,670 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 219 transitions. Word has length 8 [2018-10-27 04:45:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:28,670 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 219 transitions. [2018-10-27 04:45:28,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 219 transitions. [2018-10-27 04:45:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 04:45:28,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:28,671 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:28,671 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:28,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:28,671 INFO L82 PathProgramCache]: Analyzing trace with hash -840809059, now seen corresponding path program 1 times [2018-10-27 04:45:28,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:28,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:28,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:28,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:28,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:28,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:28,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:45:28,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:28,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:28,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:28,733 INFO L87 Difference]: Start difference. First operand 199 states and 219 transitions. Second operand 5 states. [2018-10-27 04:45:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:29,198 INFO L93 Difference]: Finished difference Result 339 states and 368 transitions. [2018-10-27 04:45:29,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:45:29,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-10-27 04:45:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:29,201 INFO L225 Difference]: With dead ends: 339 [2018-10-27 04:45:29,201 INFO L226 Difference]: Without dead ends: 339 [2018-10-27 04:45:29,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-27 04:45:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 198. [2018-10-27 04:45:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-27 04:45:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 218 transitions. [2018-10-27 04:45:29,212 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 218 transitions. Word has length 17 [2018-10-27 04:45:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:29,212 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 218 transitions. [2018-10-27 04:45:29,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 218 transitions. [2018-10-27 04:45:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 04:45:29,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:29,214 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:29,215 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:29,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:29,215 INFO L82 PathProgramCache]: Analyzing trace with hash -840809058, now seen corresponding path program 1 times [2018-10-27 04:45:29,215 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:29,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:29,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:29,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:29,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:29,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:29,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:45:29,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:29,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:29,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:29,296 INFO L87 Difference]: Start difference. First operand 198 states and 218 transitions. Second operand 5 states. [2018-10-27 04:45:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:29,610 INFO L93 Difference]: Finished difference Result 370 states and 409 transitions. [2018-10-27 04:45:29,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:45:29,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-10-27 04:45:29,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:29,614 INFO L225 Difference]: With dead ends: 370 [2018-10-27 04:45:29,614 INFO L226 Difference]: Without dead ends: 370 [2018-10-27 04:45:29,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-27 04:45:29,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 197. [2018-10-27 04:45:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-27 04:45:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2018-10-27 04:45:29,621 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 17 [2018-10-27 04:45:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:29,621 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2018-10-27 04:45:29,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2018-10-27 04:45:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:45:29,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:29,622 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-10-27 04:45:29,623 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:29,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:29,623 INFO L82 PathProgramCache]: Analyzing trace with hash -293392460, now seen corresponding path program 1 times [2018-10-27 04:45:29,623 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:29,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:29,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:29,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:29,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:29,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:29,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:45:29,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:45:29,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:45:29,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:29,748 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand 8 states. [2018-10-27 04:45:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:31,130 INFO L93 Difference]: Finished difference Result 342 states and 369 transitions. [2018-10-27 04:45:31,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:45:31,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-10-27 04:45:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:31,132 INFO L225 Difference]: With dead ends: 342 [2018-10-27 04:45:31,132 INFO L226 Difference]: Without dead ends: 342 [2018-10-27 04:45:31,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:45:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-27 04:45:31,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 196. [2018-10-27 04:45:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-27 04:45:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 216 transitions. [2018-10-27 04:45:31,140 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 216 transitions. Word has length 20 [2018-10-27 04:45:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:31,140 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 216 transitions. [2018-10-27 04:45:31,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:45:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 216 transitions. [2018-10-27 04:45:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:45:31,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:31,142 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-10-27 04:45:31,143 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:31,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:31,143 INFO L82 PathProgramCache]: Analyzing trace with hash -293392459, now seen corresponding path program 1 times [2018-10-27 04:45:31,143 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:31,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:31,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:31,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:31,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:31,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:31,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:45:31,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:45:31,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:45:31,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:31,254 INFO L87 Difference]: Start difference. First operand 196 states and 216 transitions. Second operand 8 states. [2018-10-27 04:45:31,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:31,815 INFO L93 Difference]: Finished difference Result 344 states and 371 transitions. [2018-10-27 04:45:31,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:45:31,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-10-27 04:45:31,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:31,816 INFO L225 Difference]: With dead ends: 344 [2018-10-27 04:45:31,817 INFO L226 Difference]: Without dead ends: 344 [2018-10-27 04:45:31,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:45:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-27 04:45:31,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 195. [2018-10-27 04:45:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-27 04:45:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 215 transitions. [2018-10-27 04:45:31,823 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 215 transitions. Word has length 20 [2018-10-27 04:45:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:31,823 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 215 transitions. [2018-10-27 04:45:31,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:45:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 215 transitions. [2018-10-27 04:45:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 04:45:31,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:31,824 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] [2018-10-27 04:45:31,824 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:31,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:31,828 INFO L82 PathProgramCache]: Analyzing trace with hash 671159677, now seen corresponding path program 1 times [2018-10-27 04:45:31,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:31,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:31,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:31,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:31,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:31,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:31,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:31,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:31,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:31,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:31,993 INFO L87 Difference]: Start difference. First operand 195 states and 215 transitions. Second operand 5 states. [2018-10-27 04:45:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:32,130 INFO L93 Difference]: Finished difference Result 292 states and 318 transitions. [2018-10-27 04:45:32,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:45:32,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-10-27 04:45:32,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:32,131 INFO L225 Difference]: With dead ends: 292 [2018-10-27 04:45:32,132 INFO L226 Difference]: Without dead ends: 292 [2018-10-27 04:45:32,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:45:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-27 04:45:32,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 199. [2018-10-27 04:45:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-27 04:45:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 219 transitions. [2018-10-27 04:45:32,138 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 219 transitions. Word has length 26 [2018-10-27 04:45:32,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:32,138 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 219 transitions. [2018-10-27 04:45:32,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 219 transitions. [2018-10-27 04:45:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 04:45:32,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:32,139 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-10-27 04:45:32,139 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:32,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:32,140 INFO L82 PathProgramCache]: Analyzing trace with hash -903005022, now seen corresponding path program 1 times [2018-10-27 04:45:32,140 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:32,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:32,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:32,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:32,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:32,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:32,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:32,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:32,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:32,185 INFO L87 Difference]: Start difference. First operand 199 states and 219 transitions. Second operand 4 states. [2018-10-27 04:45:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:32,286 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2018-10-27 04:45:32,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:32,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-10-27 04:45:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:32,287 INFO L225 Difference]: With dead ends: 203 [2018-10-27 04:45:32,287 INFO L226 Difference]: Without dead ends: 203 [2018-10-27 04:45:32,287 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-10-27 04:45:32,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-27 04:45:32,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 191. [2018-10-27 04:45:32,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-27 04:45:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2018-10-27 04:45:32,291 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 28 [2018-10-27 04:45:32,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:32,291 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2018-10-27 04:45:32,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:32,291 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2018-10-27 04:45:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 04:45:32,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:32,292 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-10-27 04:45:32,292 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:32,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash -903005021, now seen corresponding path program 1 times [2018-10-27 04:45:32,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:32,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:32,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:32,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:32,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:32,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:45:32,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:45:32,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:45:32,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:45:32,408 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand 7 states. [2018-10-27 04:45:32,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:32,662 INFO L93 Difference]: Finished difference Result 250 states and 267 transitions. [2018-10-27 04:45:32,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:45:32,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-10-27 04:45:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:32,663 INFO L225 Difference]: With dead ends: 250 [2018-10-27 04:45:32,663 INFO L226 Difference]: Without dead ends: 250 [2018-10-27 04:45:32,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:45:32,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-27 04:45:32,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 221. [2018-10-27 04:45:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-27 04:45:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 252 transitions. [2018-10-27 04:45:32,668 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 252 transitions. Word has length 28 [2018-10-27 04:45:32,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:32,668 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 252 transitions. [2018-10-27 04:45:32,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:45:32,668 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 252 transitions. [2018-10-27 04:45:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 04:45:32,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:32,672 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] [2018-10-27 04:45:32,672 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:32,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:32,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2042365947, now seen corresponding path program 1 times [2018-10-27 04:45:32,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:32,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:32,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:32,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:32,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:32,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:32,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:45:32,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:45:32,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:32,791 INFO L87 Difference]: Start difference. First operand 221 states and 252 transitions. Second operand 6 states. [2018-10-27 04:45:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:33,059 INFO L93 Difference]: Finished difference Result 321 states and 369 transitions. [2018-10-27 04:45:33,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:45:33,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-10-27 04:45:33,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:33,061 INFO L225 Difference]: With dead ends: 321 [2018-10-27 04:45:33,061 INFO L226 Difference]: Without dead ends: 321 [2018-10-27 04:45:33,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:45:33,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-27 04:45:33,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 220. [2018-10-27 04:45:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-27 04:45:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 251 transitions. [2018-10-27 04:45:33,067 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 251 transitions. Word has length 31 [2018-10-27 04:45:33,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:33,067 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 251 transitions. [2018-10-27 04:45:33,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:45:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 251 transitions. [2018-10-27 04:45:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 04:45:33,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:33,068 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] [2018-10-27 04:45:33,068 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:33,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:33,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2042365946, now seen corresponding path program 1 times [2018-10-27 04:45:33,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:33,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:33,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:33,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:33,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:33,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:33,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:33,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:45:33,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:45:33,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:33,183 INFO L87 Difference]: Start difference. First operand 220 states and 251 transitions. Second operand 6 states. [2018-10-27 04:45:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:33,415 INFO L93 Difference]: Finished difference Result 345 states and 401 transitions. [2018-10-27 04:45:33,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:45:33,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-10-27 04:45:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:33,417 INFO L225 Difference]: With dead ends: 345 [2018-10-27 04:45:33,417 INFO L226 Difference]: Without dead ends: 345 [2018-10-27 04:45:33,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-27 04:45:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 205. [2018-10-27 04:45:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-27 04:45:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2018-10-27 04:45:33,423 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 31 [2018-10-27 04:45:33,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:33,424 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2018-10-27 04:45:33,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:45:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2018-10-27 04:45:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 04:45:33,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:33,425 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] [2018-10-27 04:45:33,427 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:33,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:33,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1748046544, now seen corresponding path program 1 times [2018-10-27 04:45:33,428 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:33,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:33,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:33,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:33,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:33,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:33,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:33,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:33,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:33,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:33,670 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand 5 states. [2018-10-27 04:45:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:34,317 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2018-10-27 04:45:34,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:34,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-10-27 04:45:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:34,318 INFO L225 Difference]: With dead ends: 230 [2018-10-27 04:45:34,319 INFO L226 Difference]: Without dead ends: 230 [2018-10-27 04:45:34,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:45:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-27 04:45:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 205. [2018-10-27 04:45:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-27 04:45:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 233 transitions. [2018-10-27 04:45:34,326 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 233 transitions. Word has length 36 [2018-10-27 04:45:34,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:34,326 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 233 transitions. [2018-10-27 04:45:34,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 233 transitions. [2018-10-27 04:45:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-27 04:45:34,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:34,329 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] [2018-10-27 04:45:34,329 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:34,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:34,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1817891105, now seen corresponding path program 1 times [2018-10-27 04:45:34,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:34,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:34,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:34,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:34,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:34,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:34,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:45:34,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:45:34,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:45:34,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:34,683 INFO L87 Difference]: Start difference. First operand 205 states and 233 transitions. Second operand 8 states. [2018-10-27 04:45:35,018 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-27 04:45:35,240 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-27 04:45:36,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:36,374 INFO L93 Difference]: Finished difference Result 315 states and 351 transitions. [2018-10-27 04:45:36,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:45:36,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-10-27 04:45:36,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:36,376 INFO L225 Difference]: With dead ends: 315 [2018-10-27 04:45:36,376 INFO L226 Difference]: Without dead ends: 315 [2018-10-27 04:45:36,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:45:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-27 04:45:36,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 221. [2018-10-27 04:45:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-27 04:45:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 250 transitions. [2018-10-27 04:45:36,380 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 250 transitions. Word has length 42 [2018-10-27 04:45:36,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:36,383 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 250 transitions. [2018-10-27 04:45:36,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:45:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 250 transitions. [2018-10-27 04:45:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 04:45:36,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:36,384 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] [2018-10-27 04:45:36,384 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:36,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:36,385 INFO L82 PathProgramCache]: Analyzing trace with hash -729312829, now seen corresponding path program 1 times [2018-10-27 04:45:36,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:36,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:36,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:36,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:36,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:36,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:36,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:45:36,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:36,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:36,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:36,808 INFO L87 Difference]: Start difference. First operand 221 states and 250 transitions. Second operand 5 states. [2018-10-27 04:45:37,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:37,313 INFO L93 Difference]: Finished difference Result 379 states and 434 transitions. [2018-10-27 04:45:37,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:45:37,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-10-27 04:45:37,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:37,314 INFO L225 Difference]: With dead ends: 379 [2018-10-27 04:45:37,314 INFO L226 Difference]: Without dead ends: 379 [2018-10-27 04:45:37,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-27 04:45:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 220. [2018-10-27 04:45:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-27 04:45:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 249 transitions. [2018-10-27 04:45:37,318 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 249 transitions. Word has length 43 [2018-10-27 04:45:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:37,318 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 249 transitions. [2018-10-27 04:45:37,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 249 transitions. [2018-10-27 04:45:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 04:45:37,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:37,319 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] [2018-10-27 04:45:37,320 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:37,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:37,320 INFO L82 PathProgramCache]: Analyzing trace with hash -729312830, now seen corresponding path program 1 times [2018-10-27 04:45:37,320 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:37,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:37,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:37,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:37,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:37,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:37,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:37,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:45:37,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:37,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:37,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:37,457 INFO L87 Difference]: Start difference. First operand 220 states and 249 transitions. Second operand 5 states. [2018-10-27 04:45:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:37,623 INFO L93 Difference]: Finished difference Result 343 states and 391 transitions. [2018-10-27 04:45:37,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:45:37,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-10-27 04:45:37,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:37,625 INFO L225 Difference]: With dead ends: 343 [2018-10-27 04:45:37,625 INFO L226 Difference]: Without dead ends: 343 [2018-10-27 04:45:37,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:37,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-27 04:45:37,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 219. [2018-10-27 04:45:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-27 04:45:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 248 transitions. [2018-10-27 04:45:37,630 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 248 transitions. Word has length 43 [2018-10-27 04:45:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:37,630 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 248 transitions. [2018-10-27 04:45:37,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 248 transitions. [2018-10-27 04:45:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-27 04:45:37,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:37,631 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:37,631 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:37,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:37,631 INFO L82 PathProgramCache]: Analyzing trace with hash -345024793, now seen corresponding path program 1 times [2018-10-27 04:45:37,631 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:37,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:37,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:37,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:37,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:37,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:37,710 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/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-10-27 04:45:37,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:37,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:37,840 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-10-27 04:45:37,845 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-10-27 04:45:37,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:37,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:37,854 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-10-27 04:45:37,856 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-10-27 04:45:37,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:37,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:37,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:37,862 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-10-27 04:45:37,917 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-10-27 04:45:37,925 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:37,926 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-10-27 04:45:37,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:37,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:37,969 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-10-27 04:45:37,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:37,983 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-10-27 04:45:37,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:37,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:38,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:38,002 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-10-27 04:45:38,093 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-10-27 04:45:38,103 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:38,103 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-10-27 04:45:38,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:38,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:38,114 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-10-27 04:45:38,118 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:38,119 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-10-27 04:45:38,119 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:38,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:38,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:38,127 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-10-27 04:45:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:38,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:38,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-10-27 04:45:38,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:45:38,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:45:38,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:38,208 INFO L87 Difference]: Start difference. First operand 219 states and 248 transitions. Second operand 11 states. [2018-10-27 04:45:38,629 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-27 04:45:39,645 WARN L179 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-27 04:45:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:40,173 INFO L93 Difference]: Finished difference Result 362 states and 393 transitions. [2018-10-27 04:45:40,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:45:40,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-10-27 04:45:40,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:40,176 INFO L225 Difference]: With dead ends: 362 [2018-10-27 04:45:40,176 INFO L226 Difference]: Without dead ends: 362 [2018-10-27 04:45:40,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-10-27 04:45:40,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-27 04:45:40,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 256. [2018-10-27 04:45:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-27 04:45:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 297 transitions. [2018-10-27 04:45:40,183 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 297 transitions. Word has length 44 [2018-10-27 04:45:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:40,183 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 297 transitions. [2018-10-27 04:45:40,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:45:40,183 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 297 transitions. [2018-10-27 04:45:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 04:45:40,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:40,184 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-10-27 04:45:40,184 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:40,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:40,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1281162052, now seen corresponding path program 1 times [2018-10-27 04:45:40,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:40,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:40,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:40,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:40,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:40,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:40,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:45:40,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:45:40,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:45:40,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:40,764 INFO L87 Difference]: Start difference. First operand 256 states and 297 transitions. Second operand 8 states. [2018-10-27 04:45:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:41,030 INFO L93 Difference]: Finished difference Result 273 states and 316 transitions. [2018-10-27 04:45:41,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:45:41,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-10-27 04:45:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:41,032 INFO L225 Difference]: With dead ends: 273 [2018-10-27 04:45:41,032 INFO L226 Difference]: Without dead ends: 273 [2018-10-27 04:45:41,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:45:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-27 04:45:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 255. [2018-10-27 04:45:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-27 04:45:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 296 transitions. [2018-10-27 04:45:41,036 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 296 transitions. Word has length 46 [2018-10-27 04:45:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:41,040 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 296 transitions. [2018-10-27 04:45:41,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:45:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 296 transitions. [2018-10-27 04:45:41,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 04:45:41,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:41,040 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-10-27 04:45:41,041 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:41,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:41,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1281162053, now seen corresponding path program 1 times [2018-10-27 04:45:41,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:41,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:41,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:41,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:41,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:41,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:41,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:45:41,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:45:41,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:45:41,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:41,214 INFO L87 Difference]: Start difference. First operand 255 states and 296 transitions. Second operand 8 states. [2018-10-27 04:45:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:41,542 INFO L93 Difference]: Finished difference Result 272 states and 315 transitions. [2018-10-27 04:45:41,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:45:41,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-10-27 04:45:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:41,543 INFO L225 Difference]: With dead ends: 272 [2018-10-27 04:45:41,544 INFO L226 Difference]: Without dead ends: 272 [2018-10-27 04:45:41,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:45:41,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-27 04:45:41,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 254. [2018-10-27 04:45:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-27 04:45:41,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 295 transitions. [2018-10-27 04:45:41,547 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 295 transitions. Word has length 46 [2018-10-27 04:45:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:41,547 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 295 transitions. [2018-10-27 04:45:41,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:45:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 295 transitions. [2018-10-27 04:45:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-27 04:45:41,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:41,548 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] [2018-10-27 04:45:41,548 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:41,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:41,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1091008626, now seen corresponding path program 1 times [2018-10-27 04:45:41,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:41,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:41,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:41,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:41,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:42,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:42,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-27 04:45:42,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 04:45:42,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 04:45:42,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:45:42,187 INFO L87 Difference]: Start difference. First operand 254 states and 295 transitions. Second operand 17 states. [2018-10-27 04:45:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:43,402 INFO L93 Difference]: Finished difference Result 563 states and 613 transitions. [2018-10-27 04:45:43,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 04:45:43,403 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-10-27 04:45:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:43,405 INFO L225 Difference]: With dead ends: 563 [2018-10-27 04:45:43,405 INFO L226 Difference]: Without dead ends: 563 [2018-10-27 04:45:43,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=392, Invalid=1090, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 04:45:43,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-10-27 04:45:43,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 260. [2018-10-27 04:45:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-27 04:45:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 300 transitions. [2018-10-27 04:45:43,415 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 300 transitions. Word has length 47 [2018-10-27 04:45:43,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:43,416 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 300 transitions. [2018-10-27 04:45:43,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 04:45:43,416 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 300 transitions. [2018-10-27 04:45:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-27 04:45:43,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:43,416 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] [2018-10-27 04:45:43,422 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:43,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:43,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1091008627, now seen corresponding path program 1 times [2018-10-27 04:45:43,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:43,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:43,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:43,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:43,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:43,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:43,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-27 04:45:43,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 04:45:43,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 04:45:43,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:45:43,836 INFO L87 Difference]: Start difference. First operand 260 states and 300 transitions. Second operand 17 states. [2018-10-27 04:45:44,433 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2018-10-27 04:45:44,625 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2018-10-27 04:45:46,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:46,209 INFO L93 Difference]: Finished difference Result 539 states and 591 transitions. [2018-10-27 04:45:46,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-27 04:45:46,209 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-10-27 04:45:46,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:46,211 INFO L225 Difference]: With dead ends: 539 [2018-10-27 04:45:46,211 INFO L226 Difference]: Without dead ends: 539 [2018-10-27 04:45:46,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=424, Invalid=1646, Unknown=0, NotChecked=0, Total=2070 [2018-10-27 04:45:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-10-27 04:45:46,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 267. [2018-10-27 04:45:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-27 04:45:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 306 transitions. [2018-10-27 04:45:46,216 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 306 transitions. Word has length 47 [2018-10-27 04:45:46,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:46,218 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 306 transitions. [2018-10-27 04:45:46,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 04:45:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 306 transitions. [2018-10-27 04:45:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-27 04:45:46,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:46,219 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] [2018-10-27 04:45:46,219 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:46,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:46,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1441929363, now seen corresponding path program 1 times [2018-10-27 04:45:46,220 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:46,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:46,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:46,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:46,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:45:46,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:46,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:45:46,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:45:46,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:45:46,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:45:46,429 INFO L87 Difference]: Start difference. First operand 267 states and 306 transitions. Second operand 7 states. [2018-10-27 04:45:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:46,589 INFO L93 Difference]: Finished difference Result 287 states and 326 transitions. [2018-10-27 04:45:46,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:45:46,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-10-27 04:45:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:46,591 INFO L225 Difference]: With dead ends: 287 [2018-10-27 04:45:46,591 INFO L226 Difference]: Without dead ends: 287 [2018-10-27 04:45:46,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-27 04:45:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 279. [2018-10-27 04:45:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-27 04:45:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 318 transitions. [2018-10-27 04:45:46,596 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 318 transitions. Word has length 53 [2018-10-27 04:45:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:46,596 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 318 transitions. [2018-10-27 04:45:46,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:45:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 318 transitions. [2018-10-27 04:45:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-27 04:45:46,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:46,597 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, 1, 1, 1, 1] [2018-10-27 04:45:46,597 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr29REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION]=== [2018-10-27 04:45:46,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:46,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1874786911, now seen corresponding path program 1 times [2018-10-27 04:45:46,597 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:46,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:46,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:46,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:46,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 04:45:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 04:45:46,645 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-27 04:45:46,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:45:46 BoogieIcfgContainer [2018-10-27 04:45:46,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:45:46,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 04:45:46,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 04:45:46,678 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 04:45:46,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:27" (3/4) ... [2018-10-27 04:45:46,683 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-27 04:45:46,730 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f24eaa3e-1114-41fe-b036-58b82024ca59/bin-2019/uautomizer/witness.graphml [2018-10-27 04:45:46,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 04:45:46,731 INFO L168 Benchmark]: Toolchain (without parser) took 21056.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.2 MB). Free memory was 955.3 MB in the beginning and 887.5 MB in the end (delta: 67.8 MB). Peak memory consumption was 309.0 MB. Max. memory is 11.5 GB. [2018-10-27 04:45:46,732 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:45:46,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.34 ms. Allocated memory is still 1.0 GB. Free memory was 955.3 MB in the beginning and 931.2 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-27 04:45:46,732 INFO L168 Benchmark]: Boogie Preprocessor took 116.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -212.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-27 04:45:46,733 INFO L168 Benchmark]: RCFGBuilder took 1315.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. [2018-10-27 04:45:46,733 INFO L168 Benchmark]: TraceAbstraction took 19162.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 88.6 MB). Free memory was 1.1 GB in the beginning and 887.5 MB in the end (delta: 185.5 MB). Peak memory consumption was 274.1 MB. Max. memory is 11.5 GB. [2018-10-27 04:45:46,734 INFO L168 Benchmark]: Witness Printer took 52.17 ms. Allocated memory is still 1.3 GB. Free memory is still 887.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:45:46,736 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.34 ms. Allocated memory is still 1.0 GB. Free memory was 955.3 MB in the beginning and 931.2 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 116.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -212.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1315.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19162.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 88.6 MB). Free memory was 1.1 GB in the beginning and 887.5 MB in the end (delta: 185.5 MB). Peak memory consumption was 274.1 MB. Max. memory is 11.5 GB. * Witness Printer took 52.17 ms. Allocated memory is still 1.3 GB. Free memory is still 887.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={11:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L992] FCALL list->next = ((void*)0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner = malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->next = ((void*)0) VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->inner = ((void*)0) VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={11:0}, list->inner={10:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L995] SLL* end = list; VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(0) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={11:0}, len=0, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1017] EXPR, FCALL end->inner VAL [end={11:0}, end->inner={10:0}, len=0, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={11:0}, inner={10:0}, len=0, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(0) VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1025] EXPR, FCALL inner->inner VAL [end={11:0}, inner={10:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1025] COND FALSE !(0) VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1026] EXPR, FCALL inner->next VAL [end={11:0}, inner={10:0}, inner->next={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1026] COND FALSE !(0) VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1027] EXPR, FCALL inner->inner VAL [end={11:0}, inner={10:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={11:0}, inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1029] FCALL inner->inner - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 192 locations, 65 error locations. UNSAFE Result, 19.1s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 13.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3570 SDtfs, 7784 SDslu, 11411 SDs, 0 SdLazy, 8242 SolverSat, 409 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=21, 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, 21 MinimizatonAttempts, 2158 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 782 NumberOfCodeBlocks, 782 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 232285 SizeOfPredicates, 9 NumberOfNonLiveVariables, 137 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...