./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f7cafa734d0f20d504408b2e981cc49af978383 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:46:09,268 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:46:09,269 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:46:09,274 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:46:09,275 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:46:09,275 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:46:09,276 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:46:09,277 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:46:09,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:46:09,279 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:46:09,279 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:46:09,280 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:46:09,281 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:46:09,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:46:09,282 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:46:09,282 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:46:09,283 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:46:09,284 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:46:09,285 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:46:09,286 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:46:09,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:46:09,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:46:09,289 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:46:09,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:46:09,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:46:09,290 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:46:09,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:46:09,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:46:09,291 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:46:09,292 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:46:09,292 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:46:09,293 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:46:09,293 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:46:09,293 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:46:09,294 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:46:09,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:46:09,294 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 10:46:09,301 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:46:09,301 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:46:09,302 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:46:09,302 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 10:46:09,302 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:46:09,302 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:46:09,303 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:46:09,303 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:46:09,303 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:46:09,303 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:46:09,303 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:46:09,303 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:46:09,303 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:46:09,303 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:46:09,304 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:46:09,304 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:46:09,304 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:46:09,304 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:46:09,304 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:46:09,306 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:46:09,306 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:46:09,306 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:46:09,306 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:46:09,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:46:09,306 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:46:09,307 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:46:09,307 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:46:09,307 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:46:09,307 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:46:09,307 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:46:09,307 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f7cafa734d0f20d504408b2e981cc49af978383 [2018-11-18 10:46:09,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:46:09,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:46:09,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:46:09,344 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:46:09,344 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:46:09,345 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 10:46:09,387 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer/data/fb3cf4cab/03105966dab3483b824c6fe281eae2df/FLAG75f193522 [2018-11-18 10:46:09,838 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:46:09,838 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 10:46:09,846 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer/data/fb3cf4cab/03105966dab3483b824c6fe281eae2df/FLAG75f193522 [2018-11-18 10:46:09,856 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer/data/fb3cf4cab/03105966dab3483b824c6fe281eae2df [2018-11-18 10:46:09,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:46:09,859 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 10:46:09,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:46:09,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:46:09,862 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:46:09,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:46:09" (1/1) ... [2018-11-18 10:46:09,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@266329ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:09, skipping insertion in model container [2018-11-18 10:46:09,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:46:09" (1/1) ... [2018-11-18 10:46:09,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:46:09,897 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:46:10,089 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:46:10,096 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:46:10,170 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:46:10,203 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:46:10,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:10 WrapperNode [2018-11-18 10:46:10,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:46:10,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:46:10,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:46:10,204 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:46:10,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:10" (1/1) ... [2018-11-18 10:46:10,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:10" (1/1) ... [2018-11-18 10:46:10,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:10" (1/1) ... [2018-11-18 10:46:10,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:10" (1/1) ... [2018-11-18 10:46:10,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:10" (1/1) ... [2018-11-18 10:46:10,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:10" (1/1) ... [2018-11-18 10:46:10,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:10" (1/1) ... [2018-11-18 10:46:10,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:46:10,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:46:10,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:46:10,239 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:46:10,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:46:10,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:46:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:46:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 10:46:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 10:46:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 10:46:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 10:46:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-18 10:46:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-18 10:46:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-18 10:46:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:46:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 10:46:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 10:46:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 10:46:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 10:46:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 10:46:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 10:46:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 10:46:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 10:46:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 10:46:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 10:46:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 10:46:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 10:46:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 10:46:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 10:46:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 10:46:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 10:46:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 10:46:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 10:46:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 10:46:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 10:46:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 10:46:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 10:46:10,276 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 10:46:10,277 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 10:46:10,277 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 10:46:10,277 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 10:46:10,277 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 10:46:10,277 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 10:46:10,277 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 10:46:10,277 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 10:46:10,277 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 10:46:10,277 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 10:46:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 10:46:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 10:46:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 10:46:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 10:46:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 10:46:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 10:46:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 10:46:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 10:46:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 10:46:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 10:46:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 10:46:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 10:46:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 10:46:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 10:46:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 10:46:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 10:46:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 10:46:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 10:46:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 10:46:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 10:46:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 10:46:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 10:46:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 10:46:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 10:46:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 10:46:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 10:46:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 10:46:10,284 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 10:46:10,285 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 10:46:10,285 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 10:46:10,285 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 10:46:10,285 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 10:46:10,285 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 10:46:10,285 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 10:46:10,285 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 10:46:10,285 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 10:46:10,285 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 10:46:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 10:46:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 10:46:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 10:46:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 10:46:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 10:46:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 10:46:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 10:46:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 10:46:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 10:46:10,287 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 10:46:10,287 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 10:46:10,287 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 10:46:10,287 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 10:46:10,287 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 10:46:10,287 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 10:46:10,287 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 10:46:10,287 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 10:46:10,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 10:46:10,288 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 10:46:10,288 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 10:46:10,288 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 10:46:10,288 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 10:46:10,288 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 10:46:10,288 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 10:46:10,288 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 10:46:10,288 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 10:46:10,289 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 10:46:10,289 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 10:46:10,289 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 10:46:10,289 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 10:46:10,289 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 10:46:10,289 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 10:46:10,289 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 10:46:10,289 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 10:46:10,289 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 10:46:10,289 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 10:46:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 10:46:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 10:46:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:46:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 10:46:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:46:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-18 10:46:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-18 10:46:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 10:46:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:46:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-18 10:46:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:46:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:46:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:46:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:46:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 10:46:10,581 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:46:10,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:46:10 BoogieIcfgContainer [2018-11-18 10:46:10,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:46:10,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:46:10,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:46:10,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:46:10,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:46:09" (1/3) ... [2018-11-18 10:46:10,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a81694a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:46:10, skipping insertion in model container [2018-11-18 10:46:10,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:10" (2/3) ... [2018-11-18 10:46:10,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a81694a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:46:10, skipping insertion in model container [2018-11-18 10:46:10,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:46:10" (3/3) ... [2018-11-18 10:46:10,586 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 10:46:10,592 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:46:10,598 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 10:46:10,606 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 10:46:10,627 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:46:10,627 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:46:10,627 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:46:10,627 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:46:10,627 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:46:10,627 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:46:10,628 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:46:10,628 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:46:10,628 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:46:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-18 10:46:10,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 10:46:10,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:46:10,642 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-11-18 10:46:10,644 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:46:10,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:46:10,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1358843866, now seen corresponding path program 1 times [2018-11-18 10:46:10,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:46:10,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:46:10,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:46:10,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:46:10,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:46:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:46:10,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:46:10,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:46:10,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 10:46:10,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 10:46:10,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 10:46:10,776 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-11-18 10:46:10,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:46:10,797 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-18 10:46:10,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 10:46:10,798 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-18 10:46:10,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:46:10,805 INFO L225 Difference]: With dead ends: 93 [2018-11-18 10:46:10,805 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 10:46:10,808 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 10:46:10,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 10:46:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-18 10:46:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 10:46:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-18 10:46:10,833 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 31 [2018-11-18 10:46:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:46:10,833 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 10:46:10,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 10:46:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 10:46:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 10:46:10,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:46:10,835 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:46:10,835 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:46:10,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:46:10,835 INFO L82 PathProgramCache]: Analyzing trace with hash -772516059, now seen corresponding path program 1 times [2018-11-18 10:46:10,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:46:10,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:46:10,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:46:10,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:46:10,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:46:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:46:10,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:46:10,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:46:10,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:46:10,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:46:10,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:46:10,906 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2018-11-18 10:46:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:46:10,927 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-18 10:46:10,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:46:10,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 10:46:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:46:10,930 INFO L225 Difference]: With dead ends: 55 [2018-11-18 10:46:10,930 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 10:46:10,931 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:46:10,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 10:46:10,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-18 10:46:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 10:46:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-18 10:46:10,938 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2018-11-18 10:46:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:46:10,940 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-18 10:46:10,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:46:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-18 10:46:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 10:46:10,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:46:10,941 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:46:10,941 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:46:10,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:46:10,942 INFO L82 PathProgramCache]: Analyzing trace with hash -92457689, now seen corresponding path program 1 times [2018-11-18 10:46:10,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:46:10,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:46:10,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:46:10,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:46:10,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:46:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:46:10,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:46:10,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:46:10,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:46:10,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:46:10,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:46:10,992 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-11-18 10:46:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:46:11,035 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-18 10:46:11,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:46:11,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-18 10:46:11,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:46:11,037 INFO L225 Difference]: With dead ends: 76 [2018-11-18 10:46:11,037 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 10:46:11,037 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:46:11,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 10:46:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-11-18 10:46:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 10:46:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-18 10:46:11,043 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 34 [2018-11-18 10:46:11,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:46:11,043 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-18 10:46:11,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:46:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-18 10:46:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 10:46:11,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:46:11,045 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:46:11,045 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:46:11,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:46:11,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2033311528, now seen corresponding path program 1 times [2018-11-18 10:46:11,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:46:11,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:46:11,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:46:11,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:46:11,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:46:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 10:46:11,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:46:11,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:46:11,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:46:11,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:46:11,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:46:11,136 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 5 states. [2018-11-18 10:46:11,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:46:11,169 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-18 10:46:11,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:46:11,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-18 10:46:11,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:46:11,171 INFO L225 Difference]: With dead ends: 54 [2018-11-18 10:46:11,171 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 10:46:11,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:46:11,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 10:46:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-18 10:46:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 10:46:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-18 10:46:11,176 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 44 [2018-11-18 10:46:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:46:11,176 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-18 10:46:11,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:46:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-18 10:46:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 10:46:11,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:46:11,178 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:46:11,179 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:46:11,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:46:11,179 INFO L82 PathProgramCache]: Analyzing trace with hash 938611648, now seen corresponding path program 1 times [2018-11-18 10:46:11,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:46:11,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:46:11,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:46:11,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:46:11,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:46:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 10:46:11,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:46:11,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:46:11,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:46:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:11,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:46:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:46:11,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:46:11,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-18 10:46:11,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:46:11,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:46:11,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:46:11,351 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 6 states. [2018-11-18 10:46:11,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:46:11,402 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-11-18 10:46:11,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:46:11,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-18 10:46:11,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:46:11,406 INFO L225 Difference]: With dead ends: 79 [2018-11-18 10:46:11,406 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 10:46:11,407 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:46:11,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 10:46:11,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-18 10:46:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 10:46:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-18 10:46:11,413 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 46 [2018-11-18 10:46:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:46:11,413 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-18 10:46:11,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:46:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-18 10:46:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 10:46:11,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:46:11,414 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:46:11,414 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:46:11,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:46:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash 964346945, now seen corresponding path program 2 times [2018-11-18 10:46:11,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:46:11,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:46:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:46:11,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:46:11,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:46:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:46:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:46:12,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:46:12,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:46:12,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 10:46:12,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 10:46:12,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:46:12,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:46:12,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 10:46:12,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:12,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:12,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 10:46:12,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 10:46:12,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:46:12,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:12,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:12,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 10:46:12,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:46:12,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:12,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:12,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:12,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2018-11-18 10:46:26,059 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 10:46:26,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 85 [2018-11-18 10:46:26,090 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 84 treesize of output 83 [2018-11-18 10:46:26,090 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,145 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 86 [2018-11-18 10:46:26,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 59 [2018-11-18 10:46:26,203 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 18 treesize of output 17 [2018-11-18 10:46:26,203 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2018-11-18 10:46:26,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2018-11-18 10:46:26,220 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,225 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,230 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 68 [2018-11-18 10:46:26,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-11-18 10:46:26,290 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,336 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,337 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,337 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:46:26,338 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 84 [2018-11-18 10:46:26,340 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,373 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 63 [2018-11-18 10:46:26,394 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,395 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:46:26,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2018-11-18 10:46:26,400 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 10:46:26,410 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 10:46:26,433 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 10:46:26,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-11-18 10:46:26,488 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:46:26,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-18 10:46:26,490 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,496 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 62 [2018-11-18 10:46:26,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2018-11-18 10:46:26,559 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,591 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:46:26,618 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 10:46:26,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 67 [2018-11-18 10:46:26,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-11-18 10:46:26,684 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,734 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 65 [2018-11-18 10:46:26,735 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-11-18 10:46:26,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-18 10:46:26,773 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,778 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,802 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 62 [2018-11-18 10:46:26,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-18 10:46:26,830 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:26,865 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,866 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:46:26,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2018-11-18 10:46:26,871 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 10:46:26,881 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 10:46:26,907 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 10:46:26,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:26,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 61 [2018-11-18 10:46:26,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-11-18 10:46:26,972 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2018-11-18 10:46:27,002 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,018 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,039 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 10:46:27,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 10:46:27,088 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 48 treesize of output 44 [2018-11-18 10:46:27,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-18 10:46:27,090 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,094 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,096 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 60 treesize of output 54 [2018-11-18 10:46:27,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-18 10:46:27,098 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,105 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,106 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 60 treesize of output 54 [2018-11-18 10:46:27,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-18 10:46:27,108 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,114 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 10:46:27,138 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 5 variables, input treesize:168, output treesize:109 [2018-11-18 10:46:27,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:46:27,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-11-18 10:46:27,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 10:46:27,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-11-18 10:46:27,213 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2018-11-18 10:46:27,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-11-18 10:46:27,228 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-11-18 10:46:27,237 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-11-18 10:46:27,246 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,250 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:46:27,254 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:72, output treesize:1 [2018-11-18 10:46:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:46:27,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:46:27,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 30 [2018-11-18 10:46:27,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 10:46:27,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 10:46:27,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=784, Unknown=8, NotChecked=0, Total=870 [2018-11-18 10:46:27,295 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 30 states. [2018-11-18 10:47:01,737 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2018-11-18 10:47:01,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:47:01,909 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-18 10:47:01,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 10:47:01,913 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-11-18 10:47:01,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:47:01,913 INFO L225 Difference]: With dead ends: 66 [2018-11-18 10:47:01,913 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 10:47:01,914 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=120, Invalid=1200, Unknown=12, NotChecked=0, Total=1332 [2018-11-18 10:47:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 10:47:01,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 10:47:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 10:47:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 10:47:01,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-11-18 10:47:01,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:47:01,915 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:47:01,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 10:47:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:47:01,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 10:47:01,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 10:47:02,039 INFO L425 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-11-18 10:47:02,039 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 560 562) no Hoare annotation was computed. [2018-11-18 10:47:02,039 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 560 562) the Hoare annotation is: true [2018-11-18 10:47:02,039 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 560 562) no Hoare annotation was computed. [2018-11-18 10:47:02,039 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:47:02,039 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-18 10:47:02,040 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:47:02,040 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-11-18 10:47:02,040 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 586) no Hoare annotation was computed. [2018-11-18 10:47:02,040 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-11-18 10:47:02,040 INFO L428 ceAbstractionStarter]: At program point L582-3(lines 582 586) the Hoare annotation is: true [2018-11-18 10:47:02,040 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 581 587) no Hoare annotation was computed. [2018-11-18 10:47:02,040 INFO L425 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2018-11-18 10:47:02,040 INFO L425 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2018-11-18 10:47:02,040 INFO L425 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2018-11-18 10:47:02,040 INFO L421 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (select |#valid| sll_create_~head~0.base) 1) (= 0 sll_create_~head~0.offset) (not (= 0 sll_create_~head~0.base)))) [2018-11-18 10:47:02,040 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-11-18 10:47:02,040 INFO L425 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-11-18 10:47:02,040 INFO L425 ceAbstractionStarter]: For program point L574-1(lines 574 578) no Hoare annotation was computed. [2018-11-18 10:47:02,040 INFO L425 ceAbstractionStarter]: For program point L574-3(lines 574 578) no Hoare annotation was computed. [2018-11-18 10:47:02,041 INFO L421 ceAbstractionStarter]: At program point L574-4(lines 574 578) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (select |#valid| sll_create_~head~0.base) 1) (= 0 sll_create_~head~0.offset) (not (= 0 sll_create_~head~0.base)))) [2018-11-18 10:47:02,041 INFO L425 ceAbstractionStarter]: For program point L574-5(lines 574 578) no Hoare annotation was computed. [2018-11-18 10:47:02,041 INFO L421 ceAbstractionStarter]: At program point sll_createENTRY(lines 572 580) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-18 10:47:02,041 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-11-18 10:47:02,041 INFO L425 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2018-11-18 10:47:02,041 INFO L425 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2018-11-18 10:47:02,041 INFO L425 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2018-11-18 10:47:02,041 INFO L425 ceAbstractionStarter]: For program point L597-1(lines 597 601) no Hoare annotation was computed. [2018-11-18 10:47:02,041 INFO L421 ceAbstractionStarter]: At program point sll_insertENTRY(lines 588 603) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-18 10:47:02,041 INFO L425 ceAbstractionStarter]: For program point L592-1(lines 592 596) no Hoare annotation was computed. [2018-11-18 10:47:02,041 INFO L421 ceAbstractionStarter]: At program point L589(line 589) the Hoare annotation is: (and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#valid| |old(#valid)|) (= sll_insert_~index |sll_insert_#in~index|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-18 10:47:02,041 INFO L428 ceAbstractionStarter]: At program point L592-3(lines 592 596) the Hoare annotation is: true [2018-11-18 10:47:02,041 INFO L425 ceAbstractionStarter]: For program point sll_insertEXIT(lines 588 603) no Hoare annotation was computed. [2018-11-18 10:47:02,041 INFO L425 ceAbstractionStarter]: For program point L589-1(line 589) no Hoare annotation was computed. [2018-11-18 10:47:02,042 INFO L425 ceAbstractionStarter]: For program point L592-4(lines 588 603) no Hoare annotation was computed. [2018-11-18 10:47:02,042 INFO L425 ceAbstractionStarter]: For program point sll_insertFINAL(lines 588 603) no Hoare annotation was computed. [2018-11-18 10:47:02,042 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:47:02,042 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 10:47:02,042 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 10:47:02,042 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:47:02,042 INFO L421 ceAbstractionStarter]: At program point L611-3(lines 611 618) the Hoare annotation is: (and (= 0 |main_~#s~0.offset|) (<= 2 main_~len~0)) [2018-11-18 10:47:02,042 INFO L421 ceAbstractionStarter]: At program point L607(line 607) the Hoare annotation is: (and (= 0 |main_~#s~0.offset|) (<= 2 main_~len~0)) [2018-11-18 10:47:02,042 INFO L425 ceAbstractionStarter]: For program point L611-4(lines 604 626) no Hoare annotation was computed. [2018-11-18 10:47:02,042 INFO L425 ceAbstractionStarter]: For program point L607-1(line 607) no Hoare annotation was computed. [2018-11-18 10:47:02,042 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 604 626) no Hoare annotation was computed. [2018-11-18 10:47:02,042 INFO L428 ceAbstractionStarter]: At program point L622(line 622) the Hoare annotation is: true [2018-11-18 10:47:02,042 INFO L425 ceAbstractionStarter]: For program point L622-1(line 622) no Hoare annotation was computed. [2018-11-18 10:47:02,042 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 604 626) no Hoare annotation was computed. [2018-11-18 10:47:02,043 INFO L421 ceAbstractionStarter]: At program point L620(lines 604 626) the Hoare annotation is: (and (= 0 |main_~#s~0.offset|) (<= 2 main_~len~0)) [2018-11-18 10:47:02,043 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2018-11-18 10:47:02,043 INFO L421 ceAbstractionStarter]: At program point L608(line 608) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (not (= 0 .cse0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 |main_~#s~0.offset|) (= (select |#valid| .cse0) 1) (<= 2 main_~len~0))) [2018-11-18 10:47:02,043 INFO L425 ceAbstractionStarter]: For program point L608-1(line 608) no Hoare annotation was computed. [2018-11-18 10:47:02,043 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 604 626) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-18 10:47:02,043 INFO L425 ceAbstractionStarter]: For program point L613(lines 613 615) no Hoare annotation was computed. [2018-11-18 10:47:02,043 INFO L425 ceAbstractionStarter]: For program point L611-1(lines 611 618) no Hoare annotation was computed. [2018-11-18 10:47:02,043 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-18 10:47:02,043 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-11-18 10:47:02,043 INFO L428 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-11-18 10:47:02,043 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-11-18 10:47:02,044 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-11-18 10:47:02,044 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-11-18 10:47:02,053 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 10:47:02,053 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 10:47:02,054 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 10:47:02,054 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 10:47:02,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,055 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 10:47:02,055 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 10:47:02,055 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 10:47:02,055 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 10:47:02,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:47:02 BoogieIcfgContainer [2018-11-18 10:47:02,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 10:47:02,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:47:02,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:47:02,058 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:47:02,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:46:10" (3/4) ... [2018-11-18 10:47:02,061 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 10:47:02,065 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-11-18 10:47:02,065 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 10:47:02,065 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-11-18 10:47:02,065 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-18 10:47:02,065 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-18 10:47:02,065 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-11-18 10:47:02,066 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_insert [2018-11-18 10:47:02,066 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 10:47:02,066 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-18 10:47:02,069 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-11-18 10:47:02,069 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-18 10:47:02,069 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 10:47:02,087 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\valid == \old(\valid) && \old(len) <= len) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || ((\valid[head] == 1 && 0 == head) && !(0 == head)) [2018-11-18 10:47:02,103 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f11d11f0-6b11-4374-aafb-82b05d00ef6d/bin-2019/uautomizer/witness.graphml [2018-11-18 10:47:02,103 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:47:02,103 INFO L168 Benchmark]: Toolchain (without parser) took 52244.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:47:02,104 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:47:02,104 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:47:02,104 INFO L168 Benchmark]: Boogie Preprocessor took 34.81 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:47:02,104 INFO L168 Benchmark]: RCFGBuilder took 342.98 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: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2018-11-18 10:47:02,105 INFO L168 Benchmark]: TraceAbstraction took 51475.25 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:47:02,105 INFO L168 Benchmark]: Witness Printer took 45.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:47:02,106 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.81 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 342.98 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: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51475.25 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 45.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 624]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 0 == s && 2 <= len - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 574]: Loop Invariant [2018-11-18 10:47:02,109 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 10:47:02,109 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 10:47:02,110 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 10:47:02,110 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 10:47:02,110 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,110 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,110 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,110 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,110 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 10:47:02,111 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 10:47:02,111 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 10:47:02,111 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 10:47:02,111 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,111 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,111 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 10:47:02,111 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((\valid == \old(\valid) && \old(len) <= len) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || ((\valid[head] == 1 && 0 == head) && !(0 == head)) - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 0 == s && 2 <= len - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 61 locations, 1 error locations. SAFE Result, 51.4s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 34.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 257 SDtfs, 88 SDslu, 922 SDs, 0 SdLazy, 698 SolverSat, 20 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 26.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 99 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 22.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 42 PreInvPairs, 55 NumberOfFragments, 176 HoareAnnotationTreeSize, 42 FomulaSimplifications, 344 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 339 ConstructedInterpolants, 3 QuantifiedInterpolants, 137718 SizeOfPredicates, 26 NumberOfNonLiveVariables, 534 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 61/77 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...