./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35d30cdccac93bddd26c3755048a0b29ad39c8fa .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35d30cdccac93bddd26c3755048a0b29ad39c8fa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:50:08,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:50:08,153 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:50:08,162 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:50:08,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:50:08,163 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:50:08,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:50:08,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:50:08,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:50:08,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:50:08,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:50:08,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:50:08,169 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:50:08,170 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:50:08,171 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:50:08,172 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:50:08,173 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:50:08,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:50:08,176 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:50:08,177 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:50:08,178 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:50:08,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:50:08,181 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:50:08,182 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:50:08,182 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:50:08,182 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:50:08,183 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:50:08,184 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:50:08,185 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:50:08,186 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:50:08,186 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:50:08,187 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:50:08,187 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:50:08,187 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:50:08,188 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:50:08,188 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:50:08,188 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 09:50:08,198 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:50:08,199 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:50:08,199 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:50:08,199 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 09:50:08,199 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 09:50:08,199 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 09:50:08,200 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 09:50:08,200 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 09:50:08,200 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 09:50:08,200 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 09:50:08,200 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 09:50:08,201 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:50:08,201 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:50:08,201 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:50:08,201 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:50:08,201 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:50:08,201 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:50:08,202 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:50:08,202 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:50:08,202 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:50:08,202 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:50:08,202 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:50:08,202 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:50:08,203 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:50:08,203 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:50:08,203 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 09:50:08,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:50:08,203 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:50:08,203 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:50:08,203 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:50:08,203 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 09:50:08,203 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:50:08,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:50:08,203 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 09:50:08,204 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan 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 -> Taipan 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 -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2018-11-10 09:50:08,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:50:08,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:50:08,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:50:08,241 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:50:08,241 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:50:08,242 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 09:50:08,284 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/data/fdc07b5ea/d43a75e6369541c1afb9684b6faafb23/FLAG72bedc893 [2018-11-10 09:50:08,626 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:50:08,627 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 09:50:08,632 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/data/fdc07b5ea/d43a75e6369541c1afb9684b6faafb23/FLAG72bedc893 [2018-11-10 09:50:08,642 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/data/fdc07b5ea/d43a75e6369541c1afb9684b6faafb23 [2018-11-10 09:50:08,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:50:08,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:50:08,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:50:08,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:50:08,648 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:50:08,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:50:08" (1/1) ... [2018-11-10 09:50:08,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b497cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:08, skipping insertion in model container [2018-11-10 09:50:08,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:50:08" (1/1) ... [2018-11-10 09:50:08,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:50:08,670 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:50:08,772 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:50:08,776 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:50:08,788 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:50:08,801 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:50:08,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:08 WrapperNode [2018-11-10 09:50:08,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:50:08,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:50:08,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:50:08,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:50:08,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:08" (1/1) ... [2018-11-10 09:50:08,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:08" (1/1) ... [2018-11-10 09:50:08,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:50:08,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:50:08,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:50:08,830 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:50:08,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:08" (1/1) ... [2018-11-10 09:50:08,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:08" (1/1) ... [2018-11-10 09:50:08,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:08" (1/1) ... [2018-11-10 09:50:08,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:08" (1/1) ... [2018-11-10 09:50:08,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:08" (1/1) ... [2018-11-10 09:50:08,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:08" (1/1) ... [2018-11-10 09:50:08,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:08" (1/1) ... [2018-11-10 09:50:08,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:50:08,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:50:08,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:50:08,852 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:50:08,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:50:08,942 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-10 09:50:08,942 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-10 09:50:08,942 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 09:50:08,943 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-11-10 09:50:08,943 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-10 09:50:08,943 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-10 09:50:08,943 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-10 09:50:08,943 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-10 09:50:08,943 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-10 09:50:08,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-10 09:50:08,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 09:50:08,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 09:50:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 09:50:08,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 09:50:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:50:08,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:50:09,215 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:50:09,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:50:09 BoogieIcfgContainer [2018-11-10 09:50:09,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:50:09,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 09:50:09,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 09:50:09,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 09:50:09,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:50:08" (1/3) ... [2018-11-10 09:50:09,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64711693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:50:09, skipping insertion in model container [2018-11-10 09:50:09,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:08" (2/3) ... [2018-11-10 09:50:09,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64711693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:50:09, skipping insertion in model container [2018-11-10 09:50:09,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:50:09" (3/3) ... [2018-11-10 09:50:09,221 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 09:50:09,229 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 09:50:09,235 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 09:50:09,249 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 09:50:09,271 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 09:50:09,271 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 09:50:09,271 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 09:50:09,271 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:50:09,272 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:50:09,272 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 09:50:09,272 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:50:09,272 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 09:50:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-10 09:50:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 09:50:09,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:09,288 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] [2018-11-10 09:50:09,289 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:09,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:09,293 INFO L82 PathProgramCache]: Analyzing trace with hash -914248174, now seen corresponding path program 1 times [2018-11-10 09:50:09,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:09,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:09,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:09,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:09,329 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:09,425 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-10 09:50:09,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:50:09,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 09:50:09,428 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:50:09,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 09:50:09,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 09:50:09,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 09:50:09,440 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-10 09:50:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:09,459 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2018-11-10 09:50:09,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 09:50:09,460 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2018-11-10 09:50:09,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:09,467 INFO L225 Difference]: With dead ends: 89 [2018-11-10 09:50:09,467 INFO L226 Difference]: Without dead ends: 44 [2018-11-10 09:50:09,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 09:50:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-10 09:50:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-10 09:50:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 09:50:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-10 09:50:09,498 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 40 [2018-11-10 09:50:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:09,498 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-10 09:50:09,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 09:50:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-10 09:50:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 09:50:09,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:09,500 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] [2018-11-10 09:50:09,501 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:09,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:09,501 INFO L82 PathProgramCache]: Analyzing trace with hash -622423070, now seen corresponding path program 1 times [2018-11-10 09:50:09,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:09,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:09,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:09,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:09,503 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:09,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:50:09,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:50:09,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:50:09,565 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:50:09,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:50:09,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:50:09,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:50:09,567 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-11-10 09:50:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:09,586 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-11-10 09:50:09,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:50:09,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-10 09:50:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:09,588 INFO L225 Difference]: With dead ends: 80 [2018-11-10 09:50:09,588 INFO L226 Difference]: Without dead ends: 47 [2018-11-10 09:50:09,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:50:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-10 09:50:09,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-10 09:50:09,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 09:50:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-10 09:50:09,595 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 43 [2018-11-10 09:50:09,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:09,596 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-10 09:50:09,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:50:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-10 09:50:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 09:50:09,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:09,597 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:50:09,597 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:09,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:09,598 INFO L82 PathProgramCache]: Analyzing trace with hash -485166222, now seen corresponding path program 1 times [2018-11-10 09:50:09,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:09,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:09,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:09,599 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:50:09,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:09,647 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:50:09,648 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-10 09:50:09,649 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [27], [40], [41], [45], [50], [53], [58], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-11-10 09:50:09,680 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:50:09,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:50:10,227 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 09:50:10,228 INFO L272 AbstractInterpreter]: Visited 27 different actions 49 times. Merged at 5 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 44 variables. [2018-11-10 09:50:10,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:10,236 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 09:50:10,417 INFO L227 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 63.66% of their original sizes. [2018-11-10 09:50:10,418 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 09:50:10,806 INFO L415 sIntCurrentIteration]: We unified 45 AI predicates to 45 [2018-11-10 09:50:10,806 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 09:50:10,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 09:50:10,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [3] total 16 [2018-11-10 09:50:10,807 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:50:10,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 09:50:10,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 09:50:10,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:50:10,809 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 15 states. [2018-11-10 09:50:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:12,654 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-11-10 09:50:12,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 09:50:12,655 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-10 09:50:12,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:12,657 INFO L225 Difference]: With dead ends: 84 [2018-11-10 09:50:12,657 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 09:50:12,658 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-10 09:50:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 09:50:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-11-10 09:50:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 09:50:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-11-10 09:50:12,673 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 46 [2018-11-10 09:50:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:12,674 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-11-10 09:50:12,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 09:50:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-10 09:50:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 09:50:12,675 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:12,675 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, 1] [2018-11-10 09:50:12,676 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:12,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:12,676 INFO L82 PathProgramCache]: Analyzing trace with hash 861974448, now seen corresponding path program 1 times [2018-11-10 09:50:12,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:12,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:12,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:12,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:12,677 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:50:12,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:50:12,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:50:12,737 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:50:12,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:50:12,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:50:12,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:50:12,738 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 3 states. [2018-11-10 09:50:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:12,777 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-11-10 09:50:12,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:50:12,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-10 09:50:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:12,780 INFO L225 Difference]: With dead ends: 84 [2018-11-10 09:50:12,781 INFO L226 Difference]: Without dead ends: 68 [2018-11-10 09:50:12,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:50:12,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-10 09:50:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-11-10 09:50:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 09:50:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-11-10 09:50:12,798 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 47 [2018-11-10 09:50:12,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:12,799 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-10 09:50:12,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:50:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-10 09:50:12,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 09:50:12,800 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:12,800 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:50:12,801 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:12,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:12,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1897299478, now seen corresponding path program 1 times [2018-11-10 09:50:12,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:12,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:12,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:12,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:12,804 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:50:12,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:12,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:50:12,880 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-10 09:50:12,880 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [29], [32], [40], [41], [45], [50], [53], [58], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-11-10 09:50:12,882 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:50:12,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:50:13,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:50:13,289 INFO L272 AbstractInterpreter]: Visited 40 different actions 67 times. Merged at 5 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 51 variables. [2018-11-10 09:50:13,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:13,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:50:13,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:13,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:50:13,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:13,310 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:50:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:13,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:50:13,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:50:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:50:13,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:50:13,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2018-11-10 09:50:13,516 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:50:13,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:50:13,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:50:13,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:50:13,517 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 5 states. [2018-11-10 09:50:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:13,574 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2018-11-10 09:50:13,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:50:13,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-10 09:50:13,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:13,579 INFO L225 Difference]: With dead ends: 110 [2018-11-10 09:50:13,579 INFO L226 Difference]: Without dead ends: 63 [2018-11-10 09:50:13,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:50:13,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-10 09:50:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-10 09:50:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 09:50:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-11-10 09:50:13,591 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 48 [2018-11-10 09:50:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:13,592 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-11-10 09:50:13,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:50:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-10 09:50:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 09:50:13,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:13,594 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:50:13,594 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:13,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:13,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1740986502, now seen corresponding path program 2 times [2018-11-10 09:50:13,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:13,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:13,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:13,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:13,596 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 09:50:13,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:50:13,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 09:50:13,784 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:50:13,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 09:50:13,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 09:50:13,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:50:13,785 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 8 states. [2018-11-10 09:50:14,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:14,001 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2018-11-10 09:50:14,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 09:50:14,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-10 09:50:14,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:14,006 INFO L225 Difference]: With dead ends: 116 [2018-11-10 09:50:14,007 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 09:50:14,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:50:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 09:50:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-11-10 09:50:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 09:50:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2018-11-10 09:50:14,030 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 51 [2018-11-10 09:50:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:14,031 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2018-11-10 09:50:14,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 09:50:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2018-11-10 09:50:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 09:50:14,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:14,032 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:50:14,032 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:14,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash 211576461, now seen corresponding path program 1 times [2018-11-10 09:50:14,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:14,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:14,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:50:14,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:14,034 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:50:14,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:14,600 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:50:14,600 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-10 09:50:14,600 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [29], [32], [40], [41], [45], [50], [53], [58], [63], [65], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-11-10 09:50:14,602 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:50:14,602 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:50:15,133 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:50:15,133 INFO L272 AbstractInterpreter]: Visited 42 different actions 87 times. Merged at 11 different actions 30 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 51 variables. [2018-11-10 09:50:15,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:15,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:50:15,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:15,137 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:50:15,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:15,143 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:50:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:15,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:15,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:50:15,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:50:15,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:15,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:15,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:15,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-10 09:50:15,369 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 7 treesize of output 5 [2018-11-10 09:50:15,371 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-10 09:50:15,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:15,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:15,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:15,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-10 09:50:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 09:50:15,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:50:15,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-11-10 09:50:15,691 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 12 treesize of output 5 [2018-11-10 09:50:15,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:15,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:50:15,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:50:15,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-11-10 09:50:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 09:50:15,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:50:15,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 44 [2018-11-10 09:50:15,832 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:50:15,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-10 09:50:15,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-10 09:50:15,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1734, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 09:50:15,832 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand 32 states. [2018-11-10 09:50:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:17,568 INFO L93 Difference]: Finished difference Result 243 states and 291 transitions. [2018-11-10 09:50:17,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-10 09:50:17,568 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2018-11-10 09:50:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:17,570 INFO L225 Difference]: With dead ends: 243 [2018-11-10 09:50:17,570 INFO L226 Difference]: Without dead ends: 207 [2018-11-10 09:50:17,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=707, Invalid=4843, Unknown=0, NotChecked=0, Total=5550 [2018-11-10 09:50:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-10 09:50:17,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 170. [2018-11-10 09:50:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-10 09:50:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 201 transitions. [2018-11-10 09:50:17,597 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 201 transitions. Word has length 55 [2018-11-10 09:50:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:17,597 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 201 transitions. [2018-11-10 09:50:17,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-10 09:50:17,598 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 201 transitions. [2018-11-10 09:50:17,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 09:50:17,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:17,599 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:50:17,599 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:17,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:17,599 INFO L82 PathProgramCache]: Analyzing trace with hash -833255376, now seen corresponding path program 1 times [2018-11-10 09:50:17,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:17,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:17,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:17,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:17,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:50:17,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:17,650 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:50:17,650 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 09:50:17,650 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [27], [29], [34], [36], [40], [41], [45], [50], [53], [58], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-11-10 09:50:17,652 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:50:17,652 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:50:18,331 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:50:18,331 INFO L272 AbstractInterpreter]: Visited 42 different actions 101 times. Merged at 11 different actions 40 times. Never widened. Found 7 fixpoints after 5 different actions. Largest state had 44 variables. [2018-11-10 09:50:18,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:50:18,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:18,332 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:50:18,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:18,340 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:50:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 09:50:18,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:50:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:50:18,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:50:18,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2018-11-10 09:50:18,439 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:50:18,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:50:18,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:50:18,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:50:18,439 INFO L87 Difference]: Start difference. First operand 170 states and 201 transitions. Second operand 5 states. [2018-11-10 09:50:18,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:18,465 INFO L93 Difference]: Finished difference Result 275 states and 328 transitions. [2018-11-10 09:50:18,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:50:18,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-11-10 09:50:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:18,467 INFO L225 Difference]: With dead ends: 275 [2018-11-10 09:50:18,467 INFO L226 Difference]: Without dead ends: 182 [2018-11-10 09:50:18,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:50:18,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-10 09:50:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-11-10 09:50:18,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-10 09:50:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 213 transitions. [2018-11-10 09:50:18,487 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 213 transitions. Word has length 57 [2018-11-10 09:50:18,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:18,487 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 213 transitions. [2018-11-10 09:50:18,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:50:18,487 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 213 transitions. [2018-11-10 09:50:18,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 09:50:18,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:18,489 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:50:18,489 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:18,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:18,489 INFO L82 PathProgramCache]: Analyzing trace with hash -411043866, now seen corresponding path program 1 times [2018-11-10 09:50:18,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:18,490 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 09:50:18,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:18,607 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:50:18,607 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-11-10 09:50:18,607 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [29], [32], [34], [36], [40], [41], [45], [50], [53], [58], [63], [65], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-11-10 09:50:18,610 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:50:18,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:50:19,610 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:50:19,610 INFO L272 AbstractInterpreter]: Visited 44 different actions 123 times. Merged at 17 different actions 58 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 52 variables. [2018-11-10 09:50:19,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:19,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:50:19,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:19,612 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:50:19,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:19,618 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:50:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:19,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:19,692 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 15 treesize of output 12 [2018-11-10 09:50:19,694 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 12 treesize of output 11 [2018-11-10 09:50:19,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:19,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:19,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:50:19,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-11-10 09:50:19,742 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 18 treesize of output 14 [2018-11-10 09:50:19,743 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 09:50:19,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-11-10 09:50:19,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:19,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:19,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:19,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:3 [2018-11-10 09:50:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 09:50:19,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:50:19,790 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 16 treesize of output 14 [2018-11-10 09:50:19,797 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 7 treesize of output 3 [2018-11-10 09:50:19,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:19,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:19,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:19,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:5 [2018-11-10 09:50:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 09:50:19,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:50:19,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 12 [2018-11-10 09:50:19,847 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:50:19,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 09:50:19,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 09:50:19,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-10 09:50:19,848 INFO L87 Difference]: Start difference. First operand 182 states and 213 transitions. Second operand 11 states. [2018-11-10 09:50:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:20,027 INFO L93 Difference]: Finished difference Result 248 states and 301 transitions. [2018-11-10 09:50:20,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 09:50:20,027 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-11-10 09:50:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:20,028 INFO L225 Difference]: With dead ends: 248 [2018-11-10 09:50:20,028 INFO L226 Difference]: Without dead ends: 223 [2018-11-10 09:50:20,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 116 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-10 09:50:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-10 09:50:20,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 212. [2018-11-10 09:50:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-10 09:50:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 254 transitions. [2018-11-10 09:50:20,045 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 254 transitions. Word has length 59 [2018-11-10 09:50:20,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:20,045 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 254 transitions. [2018-11-10 09:50:20,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 09:50:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 254 transitions. [2018-11-10 09:50:20,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 09:50:20,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:20,047 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:50:20,047 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:20,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:20,047 INFO L82 PathProgramCache]: Analyzing trace with hash -26587930, now seen corresponding path program 1 times [2018-11-10 09:50:20,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:20,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:20,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:20,048 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:50:20,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:20,252 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:50:20,253 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-11-10 09:50:20,253 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [29], [32], [34], [36], [40], [41], [45], [50], [53], [58], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-11-10 09:50:20,254 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:50:20,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:50:20,955 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:50:20,955 INFO L272 AbstractInterpreter]: Visited 42 different actions 103 times. Merged at 11 different actions 44 times. Never widened. Found 9 fixpoints after 5 different actions. Largest state had 52 variables. [2018-11-10 09:50:20,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:20,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:50:20,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:20,968 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:50:20,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:20,985 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:50:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:21,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:21,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 09:50:21,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 09:50:21,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:21,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:21,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:21,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 09:50:21,200 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 9 treesize of output 7 [2018-11-10 09:50:21,202 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 7 treesize of output 1 [2018-11-10 09:50:21,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:21,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:21,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:21,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 09:50:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 09:50:21,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:50:21,548 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 17 treesize of output 15 [2018-11-10 09:50:21,555 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 14 treesize of output 5 [2018-11-10 09:50:21,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:21,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:50:21,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:50:21,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-10 09:50:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 09:50:21,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:50:21,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 48 [2018-11-10 09:50:21,752 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:50:21,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 09:50:21,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 09:50:21,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2082, Unknown=0, NotChecked=0, Total=2256 [2018-11-10 09:50:21,753 INFO L87 Difference]: Start difference. First operand 212 states and 254 transitions. Second operand 34 states. [2018-11-10 09:50:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:22,994 INFO L93 Difference]: Finished difference Result 307 states and 374 transitions. [2018-11-10 09:50:22,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 09:50:22,995 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 59 [2018-11-10 09:50:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:22,996 INFO L225 Difference]: With dead ends: 307 [2018-11-10 09:50:22,996 INFO L226 Difference]: Without dead ends: 269 [2018-11-10 09:50:22,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=483, Invalid=4073, Unknown=0, NotChecked=0, Total=4556 [2018-11-10 09:50:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-11-10 09:50:23,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 212. [2018-11-10 09:50:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-10 09:50:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 252 transitions. [2018-11-10 09:50:23,016 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 252 transitions. Word has length 59 [2018-11-10 09:50:23,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:23,017 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 252 transitions. [2018-11-10 09:50:23,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 09:50:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 252 transitions. [2018-11-10 09:50:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 09:50:23,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:23,018 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1] [2018-11-10 09:50:23,018 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:23,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:23,018 INFO L82 PathProgramCache]: Analyzing trace with hash -318623257, now seen corresponding path program 1 times [2018-11-10 09:50:23,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:23,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:23,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:23,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:23,019 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 09:50:23,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:23,396 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:50:23,396 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-11-10 09:50:23,396 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [27], [29], [32], [34], [36], [40], [41], [45], [50], [53], [58], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-11-10 09:50:23,398 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:50:23,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:50:24,145 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:50:24,145 INFO L272 AbstractInterpreter]: Visited 43 different actions 119 times. Merged at 12 different actions 52 times. Never widened. Found 13 fixpoints after 5 different actions. Largest state had 52 variables. [2018-11-10 09:50:24,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:24,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:50:24,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:24,146 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:50:24,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:24,153 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:50:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:24,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:24,249 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 15 treesize of output 12 [2018-11-10 09:50:24,250 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 12 treesize of output 11 [2018-11-10 09:50:24,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 09:50:24,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 09:50:24,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:50:24,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 09:50:24,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-11-10 09:50:24,408 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 7 treesize of output 5 [2018-11-10 09:50:24,410 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 3 [2018-11-10 09:50:24,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-10 09:50:24,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 09:50:24,506 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:50:24,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 09:50:24,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-11-10 09:50:24,518 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 7 treesize of output 5 [2018-11-10 09:50:24,519 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 3 [2018-11-10 09:50:24,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-10 09:50:24,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 09:50:24,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 09:50:24,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-10 09:50:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 33 refuted. 2 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 09:50:24,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:50:24,938 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 16 treesize of output 14 [2018-11-10 09:50:24,940 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-11-10 09:50:24,944 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 13 treesize of output 4 [2018-11-10 09:50:24,945 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,946 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:24,948 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-11-10 09:50:25,055 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 23 treesize of output 21 [2018-11-10 09:50:25,056 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-10 09:50:25,066 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 23 treesize of output 13 [2018-11-10 09:50:25,066 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:25,068 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 09:50:25,071 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 09:50:25,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-10 09:50:25,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:25,078 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:50:25,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:50:25,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:50:25,090 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:27, output treesize:31 [2018-11-10 09:50:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 09:50:25,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:50:25,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 18] total 49 [2018-11-10 09:50:25,144 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:50:25,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-10 09:50:25,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-10 09:50:25,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2150, Unknown=17, NotChecked=0, Total=2352 [2018-11-10 09:50:25,146 INFO L87 Difference]: Start difference. First operand 212 states and 252 transitions. Second operand 33 states. [2018-11-10 09:50:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:26,640 INFO L93 Difference]: Finished difference Result 297 states and 362 transitions. [2018-11-10 09:50:26,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 09:50:26,641 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2018-11-10 09:50:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:26,642 INFO L225 Difference]: With dead ends: 297 [2018-11-10 09:50:26,642 INFO L226 Difference]: Without dead ends: 156 [2018-11-10 09:50:26,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1270 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=638, Invalid=5023, Unknown=39, NotChecked=0, Total=5700 [2018-11-10 09:50:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-10 09:50:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 141. [2018-11-10 09:50:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-10 09:50:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 165 transitions. [2018-11-10 09:50:26,670 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 165 transitions. Word has length 62 [2018-11-10 09:50:26,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:26,670 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 165 transitions. [2018-11-10 09:50:26,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-10 09:50:26,670 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2018-11-10 09:50:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 09:50:26,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:26,671 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:50:26,671 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:26,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:26,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1083909650, now seen corresponding path program 1 times [2018-11-10 09:50:26,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:26,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:26,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:26,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:26,672 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 09:50:26,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:26,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:50:26,741 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-10 09:50:26,741 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [29], [32], [34], [36], [40], [41], [45], [50], [53], [56], [58], [61], [63], [65], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-11-10 09:50:26,742 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:50:26,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:50:27,813 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:50:27,813 INFO L272 AbstractInterpreter]: Visited 46 different actions 129 times. Merged at 18 different actions 60 times. Never widened. Found 13 fixpoints after 7 different actions. Largest state had 52 variables. [2018-11-10 09:50:27,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:27,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:50:27,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:27,832 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:50:27,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:27,847 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:50:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:27,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 09:50:27,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:50:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 09:50:27,942 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 09:50:27,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 6 [2018-11-10 09:50:27,942 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:50:27,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:50:27,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:50:27,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:50:27,943 INFO L87 Difference]: Start difference. First operand 141 states and 165 transitions. Second operand 5 states. [2018-11-10 09:50:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:27,977 INFO L93 Difference]: Finished difference Result 235 states and 281 transitions. [2018-11-10 09:50:27,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:50:27,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-10 09:50:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:27,978 INFO L225 Difference]: With dead ends: 235 [2018-11-10 09:50:27,978 INFO L226 Difference]: Without dead ends: 144 [2018-11-10 09:50:27,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:50:27,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-10 09:50:27,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-11-10 09:50:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 09:50:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2018-11-10 09:50:27,997 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 65 [2018-11-10 09:50:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:27,997 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2018-11-10 09:50:27,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:50:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2018-11-10 09:50:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:50:27,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:27,998 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:50:27,998 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:27,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:27,999 INFO L82 PathProgramCache]: Analyzing trace with hash 592150880, now seen corresponding path program 1 times [2018-11-10 09:50:27,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:27,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:27,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:27,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:28,000 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 09:50:28,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:28,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:50:28,045 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-11-10 09:50:28,046 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [27], [29], [32], [34], [36], [40], [41], [45], [48], [50], [53], [56], [58], [61], [65], [69], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110] [2018-11-10 09:50:28,047 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:50:28,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:50:29,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:50:29,613 INFO L272 AbstractInterpreter]: Visited 50 different actions 187 times. Merged at 21 different actions 88 times. Never widened. Found 16 fixpoints after 7 different actions. Largest state had 52 variables. [2018-11-10 09:50:29,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:29,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:50:29,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:29,617 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:50:29,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:29,624 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:50:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:29,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 09:50:29,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:50:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 09:50:29,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:50:29,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2018-11-10 09:50:29,704 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:50:29,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:50:29,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:50:29,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:50:29,705 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand 5 states. [2018-11-10 09:50:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:29,726 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2018-11-10 09:50:29,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:50:29,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-10 09:50:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:29,728 INFO L225 Difference]: With dead ends: 171 [2018-11-10 09:50:29,728 INFO L226 Difference]: Without dead ends: 144 [2018-11-10 09:50:29,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:50:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-10 09:50:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-11-10 09:50:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 09:50:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2018-11-10 09:50:29,742 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 70 [2018-11-10 09:50:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:29,742 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2018-11-10 09:50:29,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:50:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2018-11-10 09:50:29,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:50:29,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:29,743 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:50:29,743 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:29,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:29,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1594544456, now seen corresponding path program 1 times [2018-11-10 09:50:29,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:29,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:29,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:29,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:29,744 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 09:50:30,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:30,297 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:50:30,297 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-11-10 09:50:30,297 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [29], [32], [34], [36], [40], [41], [45], [48], [50], [53], [56], [58], [61], [63], [65], [69], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110] [2018-11-10 09:50:30,299 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:50:30,299 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:50:31,548 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:50:31,548 INFO L272 AbstractInterpreter]: Visited 50 different actions 177 times. Merged at 20 different actions 80 times. Never widened. Found 18 fixpoints after 8 different actions. Largest state had 52 variables. [2018-11-10 09:50:31,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:31,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:50:31,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:31,552 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:50:31,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:31,559 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:50:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:31,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:31,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:50:31,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:50:31,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:31,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:31,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:31,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 09:50:31,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:50:31,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:50:31,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:31,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:31,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:31,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-10 09:50:32,006 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 17 treesize of output 13 [2018-11-10 09:50:32,009 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 09:50:32,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 09:50:32,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:32,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:32,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:32,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2018-11-10 09:50:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 09:50:32,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:50:32,291 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 14 treesize of output 12 [2018-11-10 09:50:32,295 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 5 treesize of output 3 [2018-11-10 09:50:32,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:32,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:32,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:32,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-11-10 09:50:32,407 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 23 treesize of output 19 [2018-11-10 09:50:32,424 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 09:50:32,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:32,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:50:32,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:32,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:4 [2018-11-10 09:50:32,628 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 09:50:32,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:50:32,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 19] total 60 [2018-11-10 09:50:32,645 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:50:32,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-10 09:50:32,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-10 09:50:32,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3326, Unknown=0, NotChecked=0, Total=3540 [2018-11-10 09:50:32,647 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 43 states. [2018-11-10 09:50:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:36,048 INFO L93 Difference]: Finished difference Result 233 states and 251 transitions. [2018-11-10 09:50:36,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-10 09:50:36,049 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 71 [2018-11-10 09:50:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:36,050 INFO L225 Difference]: With dead ends: 233 [2018-11-10 09:50:36,050 INFO L226 Difference]: Without dead ends: 167 [2018-11-10 09:50:36,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2054 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=909, Invalid=9597, Unknown=0, NotChecked=0, Total=10506 [2018-11-10 09:50:36,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-10 09:50:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2018-11-10 09:50:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 09:50:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-11-10 09:50:36,068 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 71 [2018-11-10 09:50:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:36,068 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-11-10 09:50:36,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-10 09:50:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-11-10 09:50:36,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:50:36,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:36,069 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:50:36,069 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:36,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:36,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1227535224, now seen corresponding path program 2 times [2018-11-10 09:50:36,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:36,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:36,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:36,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:36,070 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:50:36,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:36,659 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:50:36,659 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 09:50:36,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 09:50:36,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:36,659 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:50:36,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:50:36,665 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 09:50:36,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 09:50:36,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:50:36,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:37,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:50:37,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:50:37,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:37,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:37,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:37,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-10 09:50:37,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 09:50:37,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:50:37,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2018-11-10 09:50:37,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:37,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:37,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:37,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:16 [2018-11-10 09:50:37,381 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 19 treesize of output 15 [2018-11-10 09:50:37,382 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 09:50:37,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-10 09:50:37,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:37,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:37,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:37,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2018-11-10 09:50:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 09:50:37,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:50:57,726 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 13 treesize of output 11 [2018-11-10 09:50:57,728 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-11-10 09:50:57,737 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 09:50:57,737 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:57,738 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 12 treesize of output 3 [2018-11-10 09:50:57,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:57,741 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:57,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:57,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:50:57,747 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:27, output treesize:3 [2018-11-10 09:50:57,843 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 19 treesize of output 17 [2018-11-10 09:50:57,844 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 09:50:57,853 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 09:50:57,853 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 09:50:57,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-10 09:50:57,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 09:50:57,862 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:50:57,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:50:57,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:50:57,870 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:34, output treesize:13 [2018-11-10 09:50:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 09:50:58,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:50:58,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 20] total 63 [2018-11-10 09:50:58,191 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:50:58,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-10 09:50:58,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-10 09:50:58,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3665, Unknown=33, NotChecked=0, Total=3906 [2018-11-10 09:50:58,192 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 45 states. [2018-11-10 09:51:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:10,331 INFO L93 Difference]: Finished difference Result 192 states and 195 transitions. [2018-11-10 09:51:10,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-10 09:51:10,331 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 71 [2018-11-10 09:51:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:10,332 INFO L225 Difference]: With dead ends: 192 [2018-11-10 09:51:10,332 INFO L226 Difference]: Without dead ends: 158 [2018-11-10 09:51:10,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4030 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=1882, Invalid=15317, Unknown=93, NotChecked=0, Total=17292 [2018-11-10 09:51:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-10 09:51:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 99. [2018-11-10 09:51:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 09:51:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-11-10 09:51:10,356 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 71 [2018-11-10 09:51:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:10,357 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-11-10 09:51:10,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-10 09:51:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-10 09:51:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 09:51:10,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:10,358 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:51:10,358 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:10,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:10,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1256785793, now seen corresponding path program 3 times [2018-11-10 09:51:10,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:51:10,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:51:10,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:51:10,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:51:10,359 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:51:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 09:51:10,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:10,761 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:51:10,761 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 09:51:10,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 09:51:10,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:10,761 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:10,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:51:10,768 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 09:51:10,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:51:10,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:51:10,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:10,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 09:51:10,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 09:51:10,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:11,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:11,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:11,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 09:51:11,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 09:51:11,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 09:51:11,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:11,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:11,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:11,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-10 09:51:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 09:51:11,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:11,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-10 09:51:11,433 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 7 treesize of output 3 [2018-11-10 09:51:11,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:11,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:11,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:11,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:9 [2018-11-10 09:51:11,616 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 16 treesize of output 14 [2018-11-10 09:51:11,622 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 7 treesize of output 3 [2018-11-10 09:51:11,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:11,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:11,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:11,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-11-10 09:51:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:51:11,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:51:11,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 58 [2018-11-10 09:51:11,799 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:51:11,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-10 09:51:11,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-10 09:51:11,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3093, Unknown=0, NotChecked=0, Total=3306 [2018-11-10 09:51:11,800 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 41 states. [2018-11-10 09:51:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:12,920 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-11-10 09:51:12,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 09:51:12,921 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 75 [2018-11-10 09:51:12,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:12,921 INFO L225 Difference]: With dead ends: 112 [2018-11-10 09:51:12,921 INFO L226 Difference]: Without dead ends: 79 [2018-11-10 09:51:12,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 118 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=477, Invalid=5843, Unknown=0, NotChecked=0, Total=6320 [2018-11-10 09:51:12,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-10 09:51:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-10 09:51:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 09:51:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-11-10 09:51:12,933 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 75 [2018-11-10 09:51:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:12,933 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-10 09:51:12,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-10 09:51:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-10 09:51:12,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 09:51:12,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:12,934 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:51:12,934 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:12,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:12,934 INFO L82 PathProgramCache]: Analyzing trace with hash 132044873, now seen corresponding path program 1 times [2018-11-10 09:51:12,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:51:12,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:51:12,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:51:12,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:51:12,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:51:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 09:51:13,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:13,216 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:51:13,216 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 77 with the following transitions: [2018-11-10 09:51:13,216 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [27], [29], [32], [34], [36], [40], [41], [45], [48], [50], [53], [58], [63], [65], [69], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110] [2018-11-10 09:51:13,217 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:51:13,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:51:14,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:51:14,375 INFO L272 AbstractInterpreter]: Visited 49 different actions 181 times. Merged at 20 different actions 84 times. Never widened. Found 16 fixpoints after 7 different actions. Largest state had 52 variables. [2018-11-10 09:51:14,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:14,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:51:14,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:14,380 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:14,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:14,386 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:51:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:14,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:14,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:51:14,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:51:14,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:14,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:14,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:51:14,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:51:14,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:14,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:14,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:14,525 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-10 09:51:14,558 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 7 treesize of output 5 [2018-11-10 09:51:14,560 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-10 09:51:14,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:14,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:14,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:14,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2018-11-10 09:51:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 09:51:14,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:14,888 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 14 treesize of output 12 [2018-11-10 09:51:14,923 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 5 treesize of output 3 [2018-11-10 09:51:14,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:14,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:14,932 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 14 treesize of output 12 [2018-11-10 09:51:14,946 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 5 treesize of output 3 [2018-11-10 09:51:14,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:14,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:14,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 09:51:14,954 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:12 [2018-11-10 09:51:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 09:51:15,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:51:15,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 9] total 37 [2018-11-10 09:51:15,060 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:51:15,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-10 09:51:15,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 09:51:15,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1199, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 09:51:15,060 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 30 states. [2018-11-10 09:51:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:16,153 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-11-10 09:51:16,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 09:51:16,153 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 76 [2018-11-10 09:51:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:16,154 INFO L225 Difference]: With dead ends: 79 [2018-11-10 09:51:16,154 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 09:51:16,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=419, Invalid=2773, Unknown=0, NotChecked=0, Total=3192 [2018-11-10 09:51:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 09:51:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 09:51:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 09:51:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 09:51:16,155 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2018-11-10 09:51:16,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:16,155 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:51:16,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-10 09:51:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:51:16,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 09:51:16,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 09:51:16,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:51:16,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:51:16,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:51:16,485 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 63 [2018-11-10 09:51:16,841 WARN L179 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 88 [2018-11-10 09:51:17,319 WARN L179 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 114 [2018-11-10 09:51:17,461 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 83 [2018-11-10 09:51:17,734 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 91 [2018-11-10 09:51:18,079 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 84 [2018-11-10 09:51:18,284 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 88 [2018-11-10 09:51:18,556 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 72 [2018-11-10 09:51:18,764 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 86 [2018-11-10 09:51:19,322 WARN L179 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 85 [2018-11-10 09:51:19,467 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 76 [2018-11-10 09:51:19,552 INFO L421 ceAbstractionStarter]: At program point initENTRY(lines 15 21) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse0 .cse1) 0)) (< 1 (+ ~counter~0 |~#pp~0.offset|)) (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#memory_int| |old(#memory_int)|)) (not (= 0 (select .cse2 |~#pp~0.offset|))) (not (= (select .cse0 0) 0)) (< (+ ~counter~0 |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse2 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-11-10 09:51:19,552 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 20) no Hoare annotation was computed. [2018-11-10 09:51:19,552 INFO L425 ceAbstractionStarter]: For program point L17-3(lines 17 20) no Hoare annotation was computed. [2018-11-10 09:51:19,553 INFO L421 ceAbstractionStarter]: At program point L17-4(lines 17 20) the Hoare annotation is: (let ((.cse3 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse4 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse0 .cse1)) (= 0 (select (select |#memory_int| |~#pstate~0.base|) (- (+ (- |~#pstate~0.offset|) (- 4))))) (= 0 (select .cse2 (+ |~#pp~0.offset| 4))) (= 0 (select .cse0 0)) (<= (* 2 init_~i~0) 4) (<= |~#pstate~0.offset| init_~i~0) (= 0 (select .cse2 |~#pp~0.offset|)))) (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse3 .cse1) 0)) (< 1 (+ ~counter~0 |~#pp~0.offset|)) (not (= 0 (select .cse4 |~#pp~0.offset|))) (not (= (select .cse3 0) 0)) (< (+ ~counter~0 |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse4 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-11-10 09:51:19,553 INFO L425 ceAbstractionStarter]: For program point initEXIT(lines 15 21) no Hoare annotation was computed. [2018-11-10 09:51:19,553 INFO L425 ceAbstractionStarter]: For program point L17-5(lines 15 21) no Hoare annotation was computed. [2018-11-10 09:51:19,553 INFO L425 ceAbstractionStarter]: For program point mallocFINAL(lines 46 49) no Hoare annotation was computed. [2018-11-10 09:51:19,553 INFO L425 ceAbstractionStarter]: For program point mallocEXIT(lines 46 49) no Hoare annotation was computed. [2018-11-10 09:51:19,553 INFO L421 ceAbstractionStarter]: At program point mallocENTRY(lines 46 49) the Hoare annotation is: (let ((.cse10 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse11 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse9 (+ |~#pstate~0.offset| 4))) (let ((.cse0 (= 0 |~#pp~0.base|)) (.cse1 (= 0 |~#pstate~0.base|)) (.cse2 (not (= (select .cse11 .cse9) 0))) (.cse3 (not (= 0 (select .cse10 |~#pp~0.offset|)))) (.cse4 (not (= (select .cse11 0) 0))) (.cse6 (not (= (select .cse10 .cse9) 0))) (.cse7 (< 8 (* 2 |malloc_#in~size|))) (.cse5 (select |#memory_int| |~#pstate~0.base|)) (.cse8 (< 0 (* 2 |~#pstate~0.offset|)))) (and (or (and (<= 2 (* 2 ~counter~0)) (<= (+ ~counter~0 |~#pstate~0.offset|) 1)) .cse0 .cse1 .cse2 (< |malloc_#in~size| (+ |old(~counter~0)| 3)) .cse3 .cse4 (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (not (= 0 (select .cse5 (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) .cse6 (< |malloc_#in~size| (+ |~#pp~0.offset| 4)) (< (* 2 |~#pp~0.offset|) 0) .cse7 .cse8) (or .cse0 .cse1 .cse2 (= ~counter~0 |old(~counter~0)|) .cse3 .cse4 .cse6 .cse7 (< (* 2 |old(~counter~0)|) 4) (< (+ |malloc_#in~size| |~#pstate~0.offset|) 4) (not (= (select .cse5 .cse9) 0)) (< (+ |~#pp~0.offset| 2) |old(~counter~0)|) (< 2 (+ |old(~counter~0)| |~#pp~0.offset|)) .cse8)))) [2018-11-10 09:51:19,553 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:51:19,553 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-10 09:51:19,553 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:51:19,553 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2018-11-10 09:51:19,553 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 25 31) no Hoare annotation was computed. [2018-11-10 09:51:19,553 INFO L425 ceAbstractionStarter]: For program point L25-3(lines 25 31) no Hoare annotation was computed. [2018-11-10 09:51:19,553 INFO L421 ceAbstractionStarter]: At program point L25-4(lines 25 31) the Hoare annotation is: (let ((.cse11 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse13 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse7 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse12 (+ |~#pstate~0.offset| 4))) (let ((.cse0 (not (= (select .cse7 .cse12) 0))) (.cse9 (not (= (select .cse13 .cse12) 0))) (.cse1 (select .cse13 |~#pp~0.offset|)) (.cse10 (not (= (select .cse11 .cse12) 0))) (.cse3 (= |f_#in~pointer.base| f_~pointer.base)) (.cse4 (= |f_#in~pointer.offset| f_~pointer.offset)) (.cse6 (= |#memory_int| |old(#memory_int)|)) (.cse5 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (and (let ((.cse8 (+ |f_#in~pointer.offset| |~#pp~0.offset|))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) .cse0 (not (= 0 .cse1)) (and .cse2 .cse3 .cse4 .cse5 (<= (* 2 f_~i~1) 0) .cse6 (<= 0 (+ |~#pp~0.offset| f_~i~1))) (not (= (select .cse7 0) 0)) (< .cse8 1) .cse9 (< |~#pp~0.offset| |f_#in~pointer.base|) (< 1 .cse8) (< 0 (+ |~#pp~0.offset| |f_#in~pointer.base|)) .cse10 (< (+ |~#pstate~0.offset| |f_#in~pointer.base|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) (or (< |f_#in~pointer.offset| .cse1) .cse0 (not (= 0 |~#pstate~0.offset|)) (and (= f_~pointer.base |f_#in~pointer.base|) .cse4 .cse6 (= f_~i~1 0) .cse5 .cse2) .cse9 (not (= 1 .cse1)) (not (= 0 |~#pp~0.offset|)) (not (= 1 (select .cse11 0))) .cse10 (and .cse3 (<= (* 4 f_~i~1) 7) .cse4 (<= 1 f_~i~1) .cse6 .cse5 .cse2))))) [2018-11-10 09:51:19,553 INFO L425 ceAbstractionStarter]: For program point L25-5(lines 23 32) no Hoare annotation was computed. [2018-11-10 09:51:19,553 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 23 32) no Hoare annotation was computed. [2018-11-10 09:51:19,554 INFO L421 ceAbstractionStarter]: At program point fENTRY(lines 23 32) the Hoare annotation is: (let ((.cse6 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse11 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse8 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse10 (+ |~#pstate~0.offset| 4))) (let ((.cse1 (not (= (select .cse8 .cse10) 0))) (.cse0 (select .cse11 |~#pp~0.offset|)) (.cse4 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse3 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse5 (not (= (select .cse11 .cse10) 0))) (.cse7 (not (= (select .cse6 .cse10) 0)))) (and (or (< |f_#in~pointer.offset| .cse0) .cse1 (and .cse2 .cse3 .cse4) (not (= 0 |~#pstate~0.offset|)) .cse5 (not (= 1 .cse0)) (not (= 0 |~#pp~0.offset|)) (not (= 1 (select .cse6 0))) .cse7) (let ((.cse9 (+ |f_#in~pointer.offset| |~#pp~0.offset|))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) .cse1 (not (= 0 .cse0)) (not (= (select .cse8 0) 0)) (and .cse4 .cse3 .cse2) (< .cse9 1) .cse5 (< |~#pp~0.offset| |f_#in~pointer.base|) (< 1 .cse9) (< 0 (+ |~#pp~0.offset| |f_#in~pointer.base|)) .cse7 (< (+ |~#pstate~0.offset| |f_#in~pointer.base|) 0) (< 0 (* 2 |~#pstate~0.offset|))))))) [2018-11-10 09:51:19,554 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 36 42) no Hoare annotation was computed. [2018-11-10 09:51:19,554 INFO L425 ceAbstractionStarter]: For program point L36-3(lines 36 42) no Hoare annotation was computed. [2018-11-10 09:51:19,554 INFO L421 ceAbstractionStarter]: At program point L36-4(lines 36 42) the Hoare annotation is: (let ((.cse23 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse25 (+ |~#pstate~0.offset| 4)) (.cse22 (select |#memory_int| |~#pstate~0.base|))) (let ((.cse14 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse5 (= 1 (select .cse22 (- (+ (- |~#pstate~0.offset|) (- 4)))))) (.cse27 (not (= (select .cse23 .cse25) 1)))) (let ((.cse6 (= 1 (select .cse22 0))) (.cse1 (or .cse27 (not (= 1 (select .cse23 0))))) (.cse0 (<= 2 g_~i~2)) (.cse3 (and (= |~#pstate~0.offset| 0) (= g_~i~2 1) .cse5)) (.cse21 (select .cse14 |~#pp~0.offset|)) (.cse16 (select .cse14 0)) (.cse17 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (not (= 0 |~#pstate~0.offset|))) (.cse4 (not (= 0 |~#pp~0.offset|))) (.cse8 (= g_~pointer.base |g_#in~pointer.base|)) (.cse12 (= (select .cse22 |~#pstate~0.offset|) 2)) (.cse7 (<= 0 g_~i~2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7)) (let ((.cse20 (select .cse22 .cse25))) (let ((.cse11 (= 1 .cse20)) (.cse13 (<= (* 4 g_~i~2) 8)) (.cse19 (= .cse22 (let ((.cse24 (@diff .cse23 .cse22))) (store .cse23 .cse24 (select .cse22 .cse24))))) (.cse10 (= |g_#in~pointer.offset| .cse21)) (.cse9 (= |g_#in~pointer.offset| g_~pointer.offset)) (.cse18 (select .cse14 (+ |~#pp~0.offset| 4)))) (or (and .cse8 .cse9 (= |#memory_int| |old(#memory_int)|)) (and .cse10 .cse8 .cse11 .cse12 .cse13 (let ((.cse15 (- (+ (- |~#pp~0.offset|) (- 4))))) (or (not (= (select .cse14 .cse15) .cse16)) (not (= (select .cse17 .cse15) |g_#in~pointer.base|)))) .cse0) (and .cse6 .cse11 .cse0) .cse1 .cse2 (not (= 2 .cse18)) (and (and .cse8 (<= g_~i~2 1) .cse12 .cse19 (= g_~pointer.offset .cse16)) .cse9) .cse4 (and (= 2 .cse20) .cse13 (or (and .cse8 .cse19) (and .cse10 .cse8 .cse12)) .cse9 (= |g_#in~pointer.offset| .cse18))))) (or .cse0 (not (= 2 (select .cse23 |~#pstate~0.offset|))) .cse3 (not (= 1 .cse21)) (let ((.cse26 (- (+ (* (- 1) |~#pp~0.offset|) (- 4))))) (and (= .cse16 (select .cse14 .cse26)) (= |g_#in~pointer.base| (select .cse17 .cse26)))) (or .cse27 .cse2 .cse4) (and .cse8 .cse5 (= 2 g_~pointer.offset) .cse12 .cse7) (not (= |g_#in~pointer.offset| 2))))))) [2018-11-10 09:51:19,554 INFO L425 ceAbstractionStarter]: For program point L36-5(lines 34 43) no Hoare annotation was computed. [2018-11-10 09:51:19,554 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 34 43) no Hoare annotation was computed. [2018-11-10 09:51:19,554 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-10 09:51:19,554 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-10 09:51:19,554 INFO L421 ceAbstractionStarter]: At program point L39-2(line 39) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse3 (not (= (select .cse0 (+ |~#pstate~0.offset| 4)) 1))) (.cse4 (not (= 0 |~#pstate~0.offset|))) (.cse5 (not (= 0 |~#pp~0.offset|)))) (and (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (or (not (= 2 (select .cse0 |~#pstate~0.offset|))) (not (= 1 (select .cse1 |~#pp~0.offset|))) (let ((.cse2 (- (+ (* (- 1) |~#pp~0.offset|) (- 4))))) (and (= (select .cse1 0) (select .cse1 .cse2)) (= |g_#in~pointer.base| (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse2)))) (or .cse3 .cse4 .cse5) (not (= |g_#in~pointer.offset| 2)))) (or (or .cse3 (not (= 1 (select .cse0 0)))) .cse4 .cse5)))) [2018-11-10 09:51:19,554 INFO L421 ceAbstractionStarter]: At program point gENTRY(lines 34 43) the Hoare annotation is: (let ((.cse6 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse9 (+ |~#pstate~0.offset| 4))) (let ((.cse2 (select |#memory_int| |~#pstate~0.base|)) (.cse8 (not (= (select .cse6 .cse9) 1)))) (let ((.cse0 (or .cse8 (not (= 1 (select .cse6 0))))) (.cse3 (= 1 (select .cse2 .cse9))) (.cse5 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (not (= 0 |~#pstate~0.offset|))) (.cse4 (not (= 0 |~#pp~0.offset|)))) (and (or .cse0 .cse1 (and (= 1 (select .cse2 0)) .cse3) .cse4) (or .cse0 .cse1 (not (= 2 (select .cse5 (+ |~#pp~0.offset| 4)))) .cse4 (= |#memory_int| |old(#memory_int)|)) (or (and (= (select .cse2 |~#pstate~0.offset|) 2) .cse3) (not (= 2 (select .cse6 |~#pstate~0.offset|))) (not (= 1 (select .cse5 |~#pp~0.offset|))) (let ((.cse7 (- (+ (* (- 1) |~#pp~0.offset|) (- 4))))) (and (= (select .cse5 0) (select .cse5 .cse7)) (= |g_#in~pointer.base| (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse7)))) (or .cse8 .cse1 .cse4) (not (= |g_#in~pointer.offset| 2))))))) [2018-11-10 09:51:19,554 INFO L425 ceAbstractionStarter]: For program point L39-3(line 39) no Hoare annotation was computed. [2018-11-10 09:51:19,555 INFO L425 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-11-10 09:51:19,555 INFO L425 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-10 09:51:19,555 INFO L425 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-11-10 09:51:19,555 INFO L428 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-11-10 09:51:19,555 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:51:19,555 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse0 (+ |~#pstate~0.offset| 4))) (= 0 (select .cse1 (+ |~#pp~0.offset| 4))) (not (= |~#pstate~0.base| 0)) (= 0 (select .cse0 0)) (<= 0 (* 2 |~#pp~0.offset|)) (not (= |~#pp~0.base| 0)) (<= (+ |~#pp~0.offset| 1) ~counter~0) (= 0 (select .cse1 |~#pp~0.offset|)) (= 0 (select (select |#memory_int| |~#pstate~0.base|) (- (+ (- |~#pstate~0.offset|) (- 4))))) (<= 0 (* 2 |~#pstate~0.offset|)) (<= (+ ~counter~0 |~#pstate~0.offset|) 1))) [2018-11-10 09:51:19,555 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 09:51:19,555 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:51:19,555 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-10 09:51:19,555 INFO L421 ceAbstractionStarter]: At program point L62(line 62) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |~#pstate~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (let ((.cse3 (<= main_~b~0.offset (+ main_~b~0.base 2))) (.cse4 (= 1 (select .cse2 .cse1))) (.cse5 (<= (* 2 main_~a~0.base) 0)) (.cse6 (<= (+ main_~a~0.offset 1) main_~b~0.offset)) (.cse7 (<= 1 (+ main_~a~0.offset main_~a~0.base))) (.cse8 (<= (+ main_~b~0.base main_~a~0.offset) 1)) (.cse9 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse10 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= main_~b~0.offset (select .cse0 .cse1)) (= (select .cse2 |~#pstate~0.offset|) 2) (= main_~a~0.base (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse1)) (= 1 (select .cse0 |~#pp~0.offset|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (and (= 1 (select .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse9 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (not (= 0 (select .cse10 |~#pp~0.offset|))) (not (= (select .cse9 0) 0)) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse10 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|))))) [2018-11-10 09:51:19,555 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 51 69) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse0 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#memory_int| |old(#memory_int)|) (<= 2 (* 2 ~counter~0)) (<= (+ ~counter~0 |~#pstate~0.offset|) 1)) (not (= 0 (select .cse2 |~#pp~0.offset|))) (not (= (select .cse0 0) 0)) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse2 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-11-10 09:51:19,556 INFO L421 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse4 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse5 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (let ((.cse0 (select |#memory_int| |~#pstate~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse3 (+ main_~a~0.offset 1))) (and (= 1 (select .cse0 0)) (= main_~a~0.base (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse1)) (= 2 (select .cse2 (+ |~#pp~0.offset| 4))) (<= .cse3 ~counter~0) (<= main_~b~0.offset (+ main_~b~0.base 2)) (= 1 (select .cse0 .cse1)) (<= (+ (select .cse2 |~#pp~0.offset|) 1) main_~b~0.offset) (<= (* 2 main_~a~0.base) 0) (<= .cse3 main_~b~0.offset) (<= 1 (+ main_~a~0.offset main_~a~0.base)) (<= (+ main_~b~0.base main_~a~0.offset) 1))) (not (= (select .cse4 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (not (= 0 (select .cse5 |~#pp~0.offset|))) (not (= (select .cse4 0) 0)) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse5 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-11-10 09:51:19,556 INFO L421 ceAbstractionStarter]: At program point L60(line 60) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse0 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (not (= 0 (select .cse2 |~#pp~0.offset|))) (not (= (select .cse0 0) 0)) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (let ((.cse3 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse4 (+ main_~a~0.offset 1)) (.cse5 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse3 .cse1)) (= 0 (select (select |#memory_int| |~#pstate~0.base|) (- (+ (- |~#pstate~0.offset|) (- 4))))) (<= .cse4 ~counter~0) (<= main_~b~0.offset (+ main_~b~0.base 2)) (= 0 (select .cse5 (+ |~#pp~0.offset| 4))) (<= (* 2 main_~a~0.base) 0) (= 0 (select .cse3 0)) (<= .cse4 main_~b~0.offset) (= 0 (select .cse5 |~#pp~0.offset|)) (<= 1 (+ main_~a~0.offset main_~a~0.base)) (<= (+ main_~b~0.base main_~a~0.offset) 1))) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse2 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-11-10 09:51:19,556 INFO L421 ceAbstractionStarter]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse5 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse6 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (let ((.cse4 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse2 (select |#memory_int| |~#pstate~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse3 (select .cse4 |~#pp~0.offset|))) (and (= 0 (select .cse0 .cse1)) (= 1 (select .cse2 0)) (= 0 (select .cse2 (- (+ (- |~#pstate~0.offset|) (- 4))))) (<= (+ main_~a~0.offset 1) ~counter~0) (<= main_~b~0.offset (+ main_~b~0.base 2)) (= (select .cse0 |~#pp~0.offset|) main_~a~0.base) (<= (+ |~#pstate~0.offset| main_~a~0.base) 0) (= main_~a~0.offset .cse3) (<= (+ .cse3 1) main_~b~0.offset) (= 0 (select .cse4 (+ |~#pp~0.offset| 4))) (<= 1 (+ main_~a~0.offset main_~a~0.base)) (<= (+ main_~b~0.base main_~a~0.offset) 1)))) (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse5 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (not (= 0 (select .cse6 |~#pp~0.offset|))) (not (= (select .cse5 0) 0)) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse6 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-11-10 09:51:19,556 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2018-11-10 09:51:19,556 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 51 69) no Hoare annotation was computed. [2018-11-10 09:51:19,556 INFO L421 ceAbstractionStarter]: At program point L56(line 56) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse0 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (not (= 0 (select .cse2 |~#pp~0.offset|))) (not (= (select .cse0 0) 0)) (let ((.cse3 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse4 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse3 .cse1)) (= 0 (select (select |#memory_int| |~#pstate~0.base|) (- (+ (- |~#pstate~0.offset|) (- 4))))) (= 0 (select .cse4 (+ |~#pp~0.offset| 4))) (<= (* 2 main_~a~0.base) 0) (= 0 (select .cse3 0)) (= ~counter~0 (+ main_~a~0.offset 1)) (<= main_~a~0.offset (+ main_~a~0.base 1)) (= 0 (select .cse4 |~#pp~0.offset|)) (<= 1 (+ main_~a~0.offset main_~a~0.base)))) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse2 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-11-10 09:51:19,556 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-10 09:51:19,556 INFO L425 ceAbstractionStarter]: For program point L56-1(line 56) no Hoare annotation was computed. [2018-11-10 09:51:19,556 INFO L421 ceAbstractionStarter]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse0 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#memory_int| |old(#memory_int)|) (<= 2 (* 2 ~counter~0)) (<= (+ ~counter~0 |~#pstate~0.offset|) 1)) (not (= 0 (select .cse2 |~#pp~0.offset|))) (not (= (select .cse0 0) 0)) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse2 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-11-10 09:51:19,557 INFO L421 ceAbstractionStarter]: At program point L54-1(line 54) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse0 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (not (= 0 (select .cse2 |~#pp~0.offset|))) (not (= (select .cse0 0) 0)) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (let ((.cse3 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse4 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse3 .cse1)) (= 0 (select (select |#memory_int| |~#pstate~0.base|) (- (+ (- |~#pstate~0.offset|) (- 4))))) (= 0 (select .cse4 (+ |~#pp~0.offset| 4))) (= 0 (select .cse3 0)) (<= 2 (* 2 ~counter~0)) (= 0 (select .cse4 |~#pp~0.offset|)) (<= (+ ~counter~0 |~#pstate~0.offset|) 1))) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse2 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-11-10 09:51:19,557 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 51 69) no Hoare annotation was computed. [2018-11-10 09:51:19,560 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,560 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,561 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,561 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,561 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,562 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,562 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,562 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,563 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,563 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,563 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,563 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,563 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,564 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,564 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,564 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,564 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,564 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,565 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,565 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,567 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,567 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,568 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,568 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,568 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,568 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,570 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,570 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,570 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,570 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,570 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,571 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,571 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,571 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,571 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,571 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,571 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,572 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,572 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,572 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,572 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,572 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,572 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,575 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,576 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,576 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,576 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,576 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,577 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,577 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,577 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,577 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,577 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,577 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,577 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,578 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,578 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,578 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,578 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,578 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,578 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,578 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,578 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,583 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:551) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:246) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:313) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:373) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:108) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:537) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 09:51:19,586 INFO L168 Benchmark]: Toolchain (without parser) took 70941.71 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 960.3 MB in the beginning and 1.2 GB in the end (delta: -198.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-11-10 09:51:19,587 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:51:19,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.39 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 948.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 09:51:19,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.97 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:51:19,587 INFO L168 Benchmark]: Boogie Preprocessor took 20.90 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:51:19,587 INFO L168 Benchmark]: RCFGBuilder took 363.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 09:51:19,588 INFO L168 Benchmark]: TraceAbstraction took 70369.99 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -52.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-11-10 09:51:19,593 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.39 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 948.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.97 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.90 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 363.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 70369.99 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -52.9 MB). Peak memory consumption was 1.8 GB. 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$.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$.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$.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$.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$.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 - 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$.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$.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$.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$.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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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: 25]: Loop Invariant [2018-11-10 09:51:19,596 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,597 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,597 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,597 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,597 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,597 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,598 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,598 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,598 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,598 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,599 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,599 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,599 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,599 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,599 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,599 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,600 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,600 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,600 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,600 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,600 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,600 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,600 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,602 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,602 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,602 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,602 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,602 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,602 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,602 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,604 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,604 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,604 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,605 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,605 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,605 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,605 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,606 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,606 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,606 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,606 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,606 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,606 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,607 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,607 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,607 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,607 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,607 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:51:19,607 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,607 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:51:19,608 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,608 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,608 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,609 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,609 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,609 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,609 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,609 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,609 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,610 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,610 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,610 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,610 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,610 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,610 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,610 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,611 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,611 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,611 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,611 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,611 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,611 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,611 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,611 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,612 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:51:19,612 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,612 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,612 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:51:19,612 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((0 == pp || 0 == pstate) || !(\old(#memory_$Pointer$)[pp][pstate + 4] == 0)) || !(0 == \old(#memory_$Pointer$)[pp][pp])) || ((((((#memory_$Pointer$ == \old(#memory_$Pointer$) && pointer == pointer) && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 * i <= 0) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 0 <= pp + i)) || !(\old(#memory_$Pointer$)[pp][0] == 0)) || pointer + pp < 1) || !(\old(#memory_$Pointer$)[pp][pstate + 4] == 0)) || pp < pointer) || 1 < pointer + pp) || 0 < pp + pointer) || !(\old(unknown-#memory_int-unknown)[pstate][pstate + 4] == 0)) || pstate + pointer < 0) || 0 < 2 * pstate) && (((((((((pointer < \old(#memory_$Pointer$)[pp][pp] || !(\old(#memory_$Pointer$)[pp][pstate + 4] == 0)) || !(0 == pstate)) || (((((pointer == pointer && pointer == pointer) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(\old(#memory_$Pointer$)[pp][pstate + 4] == 0)) || !(1 == \old(#memory_$Pointer$)[pp][pp])) || !(0 == pp)) || !(1 == \old(unknown-#memory_int-unknown)[pstate][0])) || !(\old(unknown-#memory_int-unknown)[pstate][pstate + 4] == 0)) || ((((((pointer == pointer && 4 * i <= 7) && pointer == pointer) && 1 <= i) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:551) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:51:21,132 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:51:21,133 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:51:21,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:51:21,143 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:51:21,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:51:21,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:51:21,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:51:21,147 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:51:21,147 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:51:21,148 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:51:21,148 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:51:21,149 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:51:21,150 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:51:21,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:51:21,151 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:51:21,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:51:21,153 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:51:21,154 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:51:21,156 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:51:21,156 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:51:21,157 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:51:21,159 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:51:21,159 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:51:21,159 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:51:21,160 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:51:21,161 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:51:21,162 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:51:21,162 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:51:21,163 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:51:21,163 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:51:21,164 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:51:21,164 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:51:21,164 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:51:21,165 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:51:21,165 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:51:21,165 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 09:51:21,177 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:51:21,178 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:51:21,178 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:51:21,178 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 09:51:21,179 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 09:51:21,179 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 09:51:21,179 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 09:51:21,179 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 09:51:21,180 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:51:21,180 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:51:21,180 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:51:21,181 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:51:21,181 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:51:21,181 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:51:21,181 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:51:21,182 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 09:51:21,182 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 09:51:21,182 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:51:21,182 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:51:21,182 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:51:21,182 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:51:21,183 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:51:21,183 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:51:21,183 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 09:51:21,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:51:21,183 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:51:21,183 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:51:21,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:51:21,184 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 09:51:21,184 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:51:21,184 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 09:51:21,184 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 09:51:21,184 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_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan 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 -> Taipan 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 -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2018-11-10 09:51:21,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:51:21,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:51:21,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:51:21,232 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:51:21,232 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:51:21,233 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 09:51:21,270 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/data/c75589737/b89a2c922e194b4bbb2ba26807c3432e/FLAGbc6fcbf2a [2018-11-10 09:51:21,589 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:51:21,589 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 09:51:21,593 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/data/c75589737/b89a2c922e194b4bbb2ba26807c3432e/FLAGbc6fcbf2a [2018-11-10 09:51:21,602 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/data/c75589737/b89a2c922e194b4bbb2ba26807c3432e [2018-11-10 09:51:21,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:51:21,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:51:21,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:51:21,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:51:21,610 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:51:21,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:51:21" (1/1) ... [2018-11-10 09:51:21,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5919abc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:21, skipping insertion in model container [2018-11-10 09:51:21,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:51:21" (1/1) ... [2018-11-10 09:51:21,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:51:21,640 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:51:21,760 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:51:21,765 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:51:21,782 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:51:21,804 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:51:21,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:21 WrapperNode [2018-11-10 09:51:21,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:51:21,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:51:21,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:51:21,806 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:51:21,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:21" (1/1) ... [2018-11-10 09:51:21,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:21" (1/1) ... [2018-11-10 09:51:21,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:51:21,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:51:21,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:51:21,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:51:21,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:21" (1/1) ... [2018-11-10 09:51:21,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:21" (1/1) ... [2018-11-10 09:51:21,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:21" (1/1) ... [2018-11-10 09:51:21,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:21" (1/1) ... [2018-11-10 09:51:21,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:21" (1/1) ... [2018-11-10 09:51:21,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:21" (1/1) ... [2018-11-10 09:51:21,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:21" (1/1) ... [2018-11-10 09:51:21,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:51:21,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:51:21,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:51:21,865 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:51:21,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:51:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-10 09:51:21,945 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-10 09:51:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 09:51:21,945 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-11-10 09:51:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-10 09:51:21,945 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-10 09:51:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-10 09:51:21,946 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-10 09:51:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-10 09:51:21,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-10 09:51:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 09:51:21,946 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 09:51:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 09:51:21,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 09:51:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:51:21,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:51:22,237 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:51:22,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:51:22 BoogieIcfgContainer [2018-11-10 09:51:22,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:51:22,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 09:51:22,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 09:51:22,241 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 09:51:22,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:51:21" (1/3) ... [2018-11-10 09:51:22,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd8e6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:51:22, skipping insertion in model container [2018-11-10 09:51:22,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:21" (2/3) ... [2018-11-10 09:51:22,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd8e6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:51:22, skipping insertion in model container [2018-11-10 09:51:22,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:51:22" (3/3) ... [2018-11-10 09:51:22,244 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 09:51:22,252 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 09:51:22,258 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 09:51:22,268 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 09:51:22,285 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:51:22,286 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 09:51:22,286 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 09:51:22,286 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 09:51:22,286 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:51:22,286 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:51:22,286 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 09:51:22,286 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:51:22,286 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 09:51:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-10 09:51:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 09:51:22,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:22,302 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] [2018-11-10 09:51:22,303 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:22,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:22,307 INFO L82 PathProgramCache]: Analyzing trace with hash -914248174, now seen corresponding path program 1 times [2018-11-10 09:51:22,310 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 09:51:22,310 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 09:51:22,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:22,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:22,431 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-10 09:51:22,431 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 09:51:22,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:51:22,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 09:51:22,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 09:51:22,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 09:51:22,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 09:51:22,452 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-10 09:51:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:22,469 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2018-11-10 09:51:22,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 09:51:22,470 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2018-11-10 09:51:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:22,477 INFO L225 Difference]: With dead ends: 89 [2018-11-10 09:51:22,477 INFO L226 Difference]: Without dead ends: 44 [2018-11-10 09:51:22,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 09:51:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-10 09:51:22,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-10 09:51:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 09:51:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-10 09:51:22,505 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 40 [2018-11-10 09:51:22,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:22,506 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-10 09:51:22,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 09:51:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-10 09:51:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 09:51:22,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:22,508 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] [2018-11-10 09:51:22,509 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:22,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:22,510 INFO L82 PathProgramCache]: Analyzing trace with hash -622423070, now seen corresponding path program 1 times [2018-11-10 09:51:22,510 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 09:51:22,511 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 09:51:22,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:22,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:51:22,650 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 09:51:22,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:51:22,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:51:22,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:51:22,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:51:22,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:51:22,654 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-11-10 09:51:22,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:22,683 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-11-10 09:51:22,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:51:22,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-10 09:51:22,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:22,687 INFO L225 Difference]: With dead ends: 80 [2018-11-10 09:51:22,687 INFO L226 Difference]: Without dead ends: 47 [2018-11-10 09:51:22,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:51:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-10 09:51:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-10 09:51:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 09:51:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-10 09:51:22,695 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 43 [2018-11-10 09:51:22,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:22,696 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-10 09:51:22,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:51:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-10 09:51:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 09:51:22,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:22,697 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:51:22,698 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:22,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:22,698 INFO L82 PathProgramCache]: Analyzing trace with hash -485166222, now seen corresponding path program 1 times [2018-11-10 09:51:22,699 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 09:51:22,699 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 09:51:22,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:22,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:51:22,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:51:22,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:22,912 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:22,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:22,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 09:51:22,975 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 09:51:22,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:51:22,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2018-11-10 09:51:22,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 09:51:22,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:51:22,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:51:22,993 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 7 states. [2018-11-10 09:51:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:23,094 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2018-11-10 09:51:23,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 09:51:23,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-10 09:51:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:23,097 INFO L225 Difference]: With dead ends: 89 [2018-11-10 09:51:23,098 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 09:51:23,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:51:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 09:51:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-11-10 09:51:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 09:51:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-11-10 09:51:23,108 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 46 [2018-11-10 09:51:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:23,108 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-10 09:51:23,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 09:51:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-10 09:51:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 09:51:23,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:23,110 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:51:23,110 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:23,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:23,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1740986502, now seen corresponding path program 1 times [2018-11-10 09:51:23,111 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 09:51:23,111 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 09:51:23,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:23,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:23,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:51:23,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:51:23,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:23,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:23,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:23,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-10 09:51:23,486 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 7 treesize of output 5 [2018-11-10 09:51:23,489 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-10 09:51:23,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:23,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:23,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:23,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-10 09:51:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 09:51:23,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:23,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-11-10 09:51:23,949 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 12 treesize of output 5 [2018-11-10 09:51:23,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:23,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:23,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:23,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-11-10 09:51:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 09:51:24,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:24,135 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:24,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:24,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:24,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:51:24,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:51:24,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:24,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:24,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:24,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-10 09:51:24,227 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 7 treesize of output 5 [2018-11-10 09:51:24,237 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-10 09:51:24,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:24,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:24,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:24,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-10 09:51:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 09:51:24,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:24,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-11-10 09:51:24,399 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 12 treesize of output 5 [2018-11-10 09:51:24,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:24,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:24,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:24,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-11-10 09:51:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 09:51:24,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 09:51:24,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15, 14] total 27 [2018-11-10 09:51:24,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 09:51:24,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 09:51:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2018-11-10 09:51:24,484 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 27 states. [2018-11-10 09:51:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:26,279 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-11-10 09:51:26,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 09:51:26,280 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-11-10 09:51:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:26,281 INFO L225 Difference]: With dead ends: 102 [2018-11-10 09:51:26,281 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 09:51:26,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 09:51:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 09:51:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2018-11-10 09:51:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 09:51:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2018-11-10 09:51:26,291 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 51 [2018-11-10 09:51:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:26,292 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2018-11-10 09:51:26,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 09:51:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2018-11-10 09:51:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 09:51:26,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:26,293 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:51:26,294 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:26,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:26,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1192231495, now seen corresponding path program 1 times [2018-11-10 09:51:26,295 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 09:51:26,295 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 09:51:26,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:26,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 09:51:26,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 09:51:26,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:26,470 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:26,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:26,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:26,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:51:26,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:51:26,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:26,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:26,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:26,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-10 09:51:26,551 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 7 treesize of output 5 [2018-11-10 09:51:26,553 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-10 09:51:26,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:26,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:26,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:26,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-10 09:51:26,592 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 17 treesize of output 13 [2018-11-10 09:51:26,593 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 13 treesize of output 5 [2018-11-10 09:51:26,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:26,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:26,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:26,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 09:51:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 09:51:26,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:26,710 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 16 treesize of output 14 [2018-11-10 09:51:26,723 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 7 treesize of output 5 [2018-11-10 09:51:26,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:26,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:26,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:26,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:5 [2018-11-10 09:51:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 09:51:26,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 09:51:26,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 8, 7] total 16 [2018-11-10 09:51:26,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 09:51:26,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 09:51:26,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-11-10 09:51:26,783 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 16 states. [2018-11-10 09:51:27,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:27,561 INFO L93 Difference]: Finished difference Result 146 states and 179 transitions. [2018-11-10 09:51:27,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 09:51:27,561 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-11-10 09:51:27,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:27,563 INFO L225 Difference]: With dead ends: 146 [2018-11-10 09:51:27,564 INFO L226 Difference]: Without dead ends: 115 [2018-11-10 09:51:27,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 09:51:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-10 09:51:27,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 93. [2018-11-10 09:51:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 09:51:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2018-11-10 09:51:27,582 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 54 [2018-11-10 09:51:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:27,582 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2018-11-10 09:51:27,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 09:51:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2018-11-10 09:51:27,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 09:51:27,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:27,584 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:51:27,584 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:27,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:27,585 INFO L82 PathProgramCache]: Analyzing trace with hash -411043866, now seen corresponding path program 1 times [2018-11-10 09:51:27,585 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 09:51:27,586 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 09:51:27,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:27,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:27,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 09:51:27,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 09:51:27,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:27,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:27,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:27,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 09:51:28,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 09:51:28,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 09:51:28,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:28,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:28,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:28,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-10 09:51:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:51:28,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:28,420 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 16 treesize of output 14 [2018-11-10 09:51:28,433 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 7 treesize of output 3 [2018-11-10 09:51:28,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:28,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:28,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:28,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-11-10 09:51:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:51:28,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:28,712 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:28,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:28,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:28,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 09:51:28,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 09:51:28,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:28,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:28,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:28,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 09:51:28,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 09:51:28,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 09:51:28,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:28,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:28,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:28,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-10 09:51:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:51:28,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:28,926 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 16 treesize of output 14 [2018-11-10 09:51:28,941 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 7 treesize of output 3 [2018-11-10 09:51:28,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:28,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:28,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:28,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-11-10 09:51:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:51:29,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 09:51:29,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 19, 17] total 34 [2018-11-10 09:51:29,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 09:51:29,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 09:51:29,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 09:51:29,021 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand 34 states. [2018-11-10 09:51:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:31,194 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2018-11-10 09:51:31,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 09:51:31,194 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 59 [2018-11-10 09:51:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:31,196 INFO L225 Difference]: With dead ends: 184 [2018-11-10 09:51:31,196 INFO L226 Difference]: Without dead ends: 153 [2018-11-10 09:51:31,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 200 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=188, Invalid=1792, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 09:51:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-10 09:51:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 144. [2018-11-10 09:51:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-10 09:51:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 174 transitions. [2018-11-10 09:51:31,219 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 174 transitions. Word has length 59 [2018-11-10 09:51:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:31,219 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 174 transitions. [2018-11-10 09:51:31,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 09:51:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2018-11-10 09:51:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 09:51:31,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:31,221 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:51:31,221 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:31,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:31,221 INFO L82 PathProgramCache]: Analyzing trace with hash 934622484, now seen corresponding path program 2 times [2018-11-10 09:51:31,222 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 09:51:31,222 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 09:51:31,240 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 09:51:31,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:51:31,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:51:31,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:31,569 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 15 treesize of output 12 [2018-11-10 09:51:31,571 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 12 treesize of output 11 [2018-11-10 09:51:31,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-10 09:51:31,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 09:51:31,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 09:51:31,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 09:51:31,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:51:31,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 09:51:31,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,646 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-11-10 09:51:31,669 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 7 treesize of output 5 [2018-11-10 09:51:31,670 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 3 [2018-11-10 09:51:31,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2018-11-10 09:51:31,916 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 7 treesize of output 5 [2018-11-10 09:51:31,918 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 3 [2018-11-10 09:51:31,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,933 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 22 treesize of output 17 [2018-11-10 09:51:31,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:51:31,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 24 [2018-11-10 09:51:31,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,951 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:12 [2018-11-10 09:51:31,975 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 8 treesize of output 6 [2018-11-10 09:51:31,976 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 6 treesize of output 4 [2018-11-10 09:51:31,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:31,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:7 [2018-11-10 09:51:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 17 refuted. 2 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:51:32,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:32,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:32,457 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:32,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:51:32,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:51:32,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:51:32,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:32,838 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 15 treesize of output 12 [2018-11-10 09:51:32,840 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 12 treesize of output 11 [2018-11-10 09:51:32,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:32,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:32,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 09:51:32,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 09:51:32,857 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:32,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:32,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:32,867 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-11-10 09:51:32,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 09:51:32,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:51:32,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 09:51:32,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:32,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:32,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 09:51:32,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:51:32,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 09:51:32,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:33,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:33,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:33,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-11-10 09:51:33,043 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 7 treesize of output 5 [2018-11-10 09:51:33,045 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 3 [2018-11-10 09:51:33,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:33,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:33,053 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 7 treesize of output 5 [2018-11-10 09:51:33,055 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 3 [2018-11-10 09:51:33,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:33,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:33,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:33,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-10 09:51:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:51:33,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:33,540 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-10 09:51:33,646 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-10 09:51:33,827 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 09:51:33,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:33,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:33,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:31, output treesize:1 [2018-11-10 09:51:33,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-10 09:51:33,944 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-11-10 09:51:33,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-10 09:51:33,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:33,995 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 19 treesize of output 8 [2018-11-10 09:51:33,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:34,008 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:34,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:34,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-10 09:51:34,048 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-11-10 09:51:34,077 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 19 treesize of output 8 [2018-11-10 09:51:34,077 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:34,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-10 09:51:34,085 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:34,099 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:34,113 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:34,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:34,131 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:45, output treesize:23 [2018-11-10 09:51:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:51:34,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:51:34,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 10] total 31 [2018-11-10 09:51:34,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-10 09:51:34,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 09:51:34,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1121, Unknown=15, NotChecked=0, Total=1332 [2018-11-10 09:51:34,215 INFO L87 Difference]: Start difference. First operand 144 states and 174 transitions. Second operand 31 states. [2018-11-10 09:51:35,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:35,877 INFO L93 Difference]: Finished difference Result 209 states and 249 transitions. [2018-11-10 09:51:35,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 09:51:35,877 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-11-10 09:51:35,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:35,878 INFO L225 Difference]: With dead ends: 209 [2018-11-10 09:51:35,878 INFO L226 Difference]: Without dead ends: 126 [2018-11-10 09:51:35,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=425, Invalid=2007, Unknown=18, NotChecked=0, Total=2450 [2018-11-10 09:51:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-10 09:51:35,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2018-11-10 09:51:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-10 09:51:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2018-11-10 09:51:35,893 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 59 [2018-11-10 09:51:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:35,893 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2018-11-10 09:51:35,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-10 09:51:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2018-11-10 09:51:35,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 09:51:35,894 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:35,895 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:51:35,895 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:35,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:35,895 INFO L82 PathProgramCache]: Analyzing trace with hash -413561899, now seen corresponding path program 1 times [2018-11-10 09:51:35,895 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 09:51:35,896 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 09:51:35,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:51:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:36,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:36,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:51:36,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:51:36,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:51:36,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:51:36,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,158 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-10 09:51:36,198 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 7 treesize of output 5 [2018-11-10 09:51:36,199 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 3 [2018-11-10 09:51:36,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,208 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 9 treesize of output 7 [2018-11-10 09:51:36,209 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 7 treesize of output 1 [2018-11-10 09:51:36,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:10 [2018-11-10 09:51:36,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-10 09:51:36,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-10 09:51:36,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 09:51:36,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-10 09:51:36,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,352 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:15 [2018-11-10 09:51:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 09:51:36,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:36,771 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 14 treesize of output 12 [2018-11-10 09:51:36,783 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 5 treesize of output 3 [2018-11-10 09:51:36,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:36,795 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 14 treesize of output 12 [2018-11-10 09:51:36,807 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 5 treesize of output 3 [2018-11-10 09:51:36,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:36,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 09:51:36,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:12 [2018-11-10 09:51:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:51:36,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:36,895 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:36,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:36,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:36,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:51:36,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:51:36,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:51:36,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:51:36,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:36,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-10 09:51:37,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 09:51:37,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 09:51:37,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:37,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:37,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 09:51:37,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 09:51:37,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:37,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:37,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:37,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-10 09:51:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:51:37,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:37,320 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 14 treesize of output 12 [2018-11-10 09:51:37,331 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 5 treesize of output 3 [2018-11-10 09:51:37,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:37,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:37,343 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 14 treesize of output 12 [2018-11-10 09:51:37,355 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 5 treesize of output 3 [2018-11-10 09:51:37,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:37,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:37,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 09:51:37,365 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:12 [2018-11-10 09:51:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:51:37,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 09:51:37,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 10, 9] total 25 [2018-11-10 09:51:37,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 09:51:37,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 09:51:37,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-11-10 09:51:37,394 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand 25 states. [2018-11-10 09:51:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:38,949 INFO L93 Difference]: Finished difference Result 161 states and 187 transitions. [2018-11-10 09:51:38,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 09:51:38,950 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-11-10 09:51:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:38,951 INFO L225 Difference]: With dead ends: 161 [2018-11-10 09:51:38,951 INFO L226 Difference]: Without dead ends: 132 [2018-11-10 09:51:38,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 09:51:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-10 09:51:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2018-11-10 09:51:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-10 09:51:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 147 transitions. [2018-11-10 09:51:38,965 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 147 transitions. Word has length 62 [2018-11-10 09:51:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:38,965 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 147 transitions. [2018-11-10 09:51:38,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 09:51:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 147 transitions. [2018-11-10 09:51:38,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 09:51:38,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:38,966 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:51:38,966 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:38,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:38,967 INFO L82 PathProgramCache]: Analyzing trace with hash -449292819, now seen corresponding path program 3 times [2018-11-10 09:51:38,967 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 09:51:38,967 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 09:51:38,984 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-10 09:51:39,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 09:51:39,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:51:39,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 09:51:39,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 09:51:39,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:39,522 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:39,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:51:40,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 09:51:40,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:51:40,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 09:51:40,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 09:51:40,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 09:51:40,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 8 [2018-11-10 09:51:40,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 09:51:40,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 09:51:40,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:51:40,831 INFO L87 Difference]: Start difference. First operand 128 states and 147 transitions. Second operand 8 states. [2018-11-10 09:51:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:40,880 INFO L93 Difference]: Finished difference Result 194 states and 229 transitions. [2018-11-10 09:51:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:51:40,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-11-10 09:51:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:40,881 INFO L225 Difference]: With dead ends: 194 [2018-11-10 09:51:40,881 INFO L226 Difference]: Without dead ends: 140 [2018-11-10 09:51:40,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:51:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-10 09:51:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2018-11-10 09:51:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-10 09:51:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2018-11-10 09:51:40,897 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 63 [2018-11-10 09:51:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:40,897 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2018-11-10 09:51:40,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 09:51:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2018-11-10 09:51:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 09:51:40,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:40,898 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:51:40,898 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:40,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:40,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1726401345, now seen corresponding path program 4 times [2018-11-10 09:51:40,899 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 09:51:40,899 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 09:51:40,910 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:51:41,012 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:51:41,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:51:41,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 09:51:41,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 09:51:41,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:41,110 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:41,115 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:51:41,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:51:41,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:51:41,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 09:51:41,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 09:51:41,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 09:51:41,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 8 [2018-11-10 09:51:41,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 09:51:41,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 09:51:41,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:51:41,207 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand 8 states. [2018-11-10 09:51:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:41,264 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2018-11-10 09:51:41,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:51:41,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-11-10 09:51:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:41,265 INFO L225 Difference]: With dead ends: 202 [2018-11-10 09:51:41,265 INFO L226 Difference]: Without dead ends: 124 [2018-11-10 09:51:41,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:51:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-10 09:51:41,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2018-11-10 09:51:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-10 09:51:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-11-10 09:51:41,273 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 63 [2018-11-10 09:51:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:41,273 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-11-10 09:51:41,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 09:51:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-11-10 09:51:41,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 09:51:41,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:41,274 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:51:41,274 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:41,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:41,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1061585402, now seen corresponding path program 1 times [2018-11-10 09:51:41,274 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 09:51:41,275 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 09:51:41,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:51:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:41,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:41,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 09:51:41,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 09:51:41,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-10 09:51:41,658 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 9 treesize of output 7 [2018-11-10 09:51:41,659 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 7 treesize of output 1 [2018-11-10 09:51:41,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 09:51:41,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 09:51:41,725 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:51:41,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 09:51:41,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-11-10 09:51:41,744 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 9 treesize of output 7 [2018-11-10 09:51:41,746 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 7 treesize of output 1 [2018-11-10 09:51:41,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 09:51:41,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 09:51:41,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 09:51:41,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:41,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-10 09:51:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 21 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:51:41,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:42,497 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 17 treesize of output 15 [2018-11-10 09:51:42,511 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 14 treesize of output 5 [2018-11-10 09:51:42,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-11-10 09:51:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 09:51:42,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:42,612 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:42,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:42,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:42,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 09:51:42,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 09:51:42,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 09:51:42,893 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 9 treesize of output 7 [2018-11-10 09:51:42,894 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 7 treesize of output 1 [2018-11-10 09:51:42,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 09:51:42,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 09:51:42,907 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:51:42,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 09:51:42,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2018-11-10 09:51:42,923 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 9 treesize of output 7 [2018-11-10 09:51:42,924 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 7 treesize of output 1 [2018-11-10 09:51:42,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:42,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 09:51:43,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 09:51:43,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 09:51:43,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:43,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:43,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:43,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-11-10 09:51:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 25 refuted. 2 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 09:51:43,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:43,590 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 16 treesize of output 14 [2018-11-10 09:51:43,609 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 7 treesize of output 3 [2018-11-10 09:51:43,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:43,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:43,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:43,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:5 [2018-11-10 09:51:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 09:51:43,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 09:51:43,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18, 15] total 51 [2018-11-10 09:51:43,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-10 09:51:43,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-10 09:51:43,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2307, Unknown=15, NotChecked=0, Total=2550 [2018-11-10 09:51:43,713 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 51 states. [2018-11-10 09:51:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:48,082 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2018-11-10 09:51:48,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 09:51:48,083 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 64 [2018-11-10 09:51:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:48,084 INFO L225 Difference]: With dead ends: 162 [2018-11-10 09:51:48,084 INFO L226 Difference]: Without dead ends: 140 [2018-11-10 09:51:48,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 200 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=670, Invalid=5293, Unknown=43, NotChecked=0, Total=6006 [2018-11-10 09:51:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-10 09:51:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114. [2018-11-10 09:51:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-10 09:51:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-11-10 09:51:48,094 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 64 [2018-11-10 09:51:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:48,094 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-11-10 09:51:48,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-10 09:51:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-11-10 09:51:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:51:48,095 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:48,095 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:51:48,095 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:48,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:48,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1594544456, now seen corresponding path program 1 times [2018-11-10 09:51:48,095 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 09:51:48,095 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 09:51:48,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:48,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:48,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:51:48,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:51:48,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:48,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:48,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:51:48,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-11-10 09:51:48,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-10 09:51:48,730 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:51:48,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:51:48,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-10 09:51:48,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:48,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:48,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:48,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:9 [2018-11-10 09:51:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 09:51:48,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:49,167 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 23 treesize of output 19 [2018-11-10 09:51:49,191 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 6 treesize of output 1 [2018-11-10 09:51:49,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:49,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:49,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:49,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:4 [2018-11-10 09:51:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 09:51:49,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:49,455 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:49,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:49,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:49,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:51:49,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:51:49,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:49,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:49,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:49,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 09:51:49,796 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 17 treesize of output 13 [2018-11-10 09:51:49,798 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 13 treesize of output 5 [2018-11-10 09:51:49,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:49,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:49,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:49,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-10 09:51:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 09:51:49,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:49,858 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 23 treesize of output 19 [2018-11-10 09:51:49,876 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 09:51:49,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:49,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:51:49,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:49,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:4 [2018-11-10 09:51:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 09:51:50,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 09:51:50,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 18, 17] total 43 [2018-11-10 09:51:50,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-10 09:51:50,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-10 09:51:50,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1645, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 09:51:50,001 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 43 states. [2018-11-10 09:51:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:52,991 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-10 09:51:52,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 09:51:52,991 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 71 [2018-11-10 09:51:52,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:52,992 INFO L225 Difference]: With dead ends: 148 [2018-11-10 09:51:52,992 INFO L226 Difference]: Without dead ends: 138 [2018-11-10 09:51:52,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=433, Invalid=3857, Unknown=0, NotChecked=0, Total=4290 [2018-11-10 09:51:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-10 09:51:53,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 113. [2018-11-10 09:51:53,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-10 09:51:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2018-11-10 09:51:53,002 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 71 [2018-11-10 09:51:53,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:53,002 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2018-11-10 09:51:53,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-10 09:51:53,002 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2018-11-10 09:51:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 09:51:53,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:53,003 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:51:53,003 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:53,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:53,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1441419930, now seen corresponding path program 1 times [2018-11-10 09:51:53,003 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 09:51:53,003 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 09:51:53,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:53,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:53,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 09:51:53,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 09:51:53,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-10 09:51:53,258 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 11 treesize of output 9 [2018-11-10 09:51:53,259 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 9 treesize of output 1 [2018-11-10 09:51:53,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-11-10 09:51:53,314 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 17 treesize of output 13 [2018-11-10 09:51:53,315 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 13 treesize of output 5 [2018-11-10 09:51:53,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 09:51:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 09:51:53,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:53,513 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 18 treesize of output 16 [2018-11-10 09:51:53,529 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 7 treesize of output 3 [2018-11-10 09:51:53,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-10 09:51:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 09:51:53,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:53,589 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:53,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:53,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:53,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 09:51:53,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 09:51:53,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 09:51:53,713 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 11 treesize of output 9 [2018-11-10 09:51:53,714 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 9 treesize of output 1 [2018-11-10 09:51:53,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2018-11-10 09:51:53,755 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 17 treesize of output 13 [2018-11-10 09:51:53,756 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 13 treesize of output 5 [2018-11-10 09:51:53,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 09:51:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 09:51:53,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:53,826 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 18 treesize of output 16 [2018-11-10 09:51:53,842 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 9 treesize of output 5 [2018-11-10 09:51:53,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:53,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-10 09:51:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 09:51:53,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 09:51:53,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10, 9] total 23 [2018-11-10 09:51:53,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 09:51:53,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 09:51:53,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-11-10 09:51:53,880 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand 23 states. [2018-11-10 09:51:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:54,746 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-11-10 09:51:54,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 09:51:54,747 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-11-10 09:51:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:54,747 INFO L225 Difference]: With dead ends: 131 [2018-11-10 09:51:54,747 INFO L226 Difference]: Without dead ends: 79 [2018-11-10 09:51:54,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 09:51:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-10 09:51:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-10 09:51:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 09:51:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-11-10 09:51:54,759 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 73 [2018-11-10 09:51:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:54,759 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-11-10 09:51:54,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 09:51:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-11-10 09:51:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 09:51:54,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:54,760 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:51:54,760 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:54,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:54,760 INFO L82 PathProgramCache]: Analyzing trace with hash -409228882, now seen corresponding path program 1 times [2018-11-10 09:51:54,760 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 09:51:54,760 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 09:51:54,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:55,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:55,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 09:51:55,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 09:51:55,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-10 09:51:55,282 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 9 treesize of output 7 [2018-11-10 09:51:55,283 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 7 treesize of output 1 [2018-11-10 09:51:55,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 09:51:55,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 09:51:55,381 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:51:55,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 09:51:55,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-11-10 09:51:55,398 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 9 treesize of output 7 [2018-11-10 09:51:55,400 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 7 treesize of output 1 [2018-11-10 09:51:55,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 09:51:55,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 09:51:55,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 09:51:55,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:55,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-10 09:51:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 22 refuted. 2 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:51:55,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:56,584 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 19 treesize of output 17 [2018-11-10 09:51:56,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2018-11-10 09:51:56,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:56,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:56,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:56,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2018-11-10 09:51:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 09:51:56,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:56,758 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:56,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:56,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:56,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 09:51:56,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 09:51:56,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:56,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:56,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:56,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 09:51:57,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-10 09:51:57,094 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 7 treesize of output 1 [2018-11-10 09:51:57,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 09:51:57,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 09:51:57,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:51:57,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 09:51:57,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2018-11-10 09:51:57,123 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 9 treesize of output 7 [2018-11-10 09:51:57,124 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 7 treesize of output 1 [2018-11-10 09:51:57,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 09:51:57,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 09:51:57,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 09:51:57,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-11-10 09:51:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 25 refuted. 2 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:51:57,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:57,914 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 16 treesize of output 14 [2018-11-10 09:51:57,930 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 7 treesize of output 3 [2018-11-10 09:51:57,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:51:57,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:5 [2018-11-10 09:51:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 09:51:58,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 09:51:58,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 18, 15] total 56 [2018-11-10 09:51:58,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-10 09:51:58,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-10 09:51:58,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2804, Unknown=17, NotChecked=0, Total=3080 [2018-11-10 09:51:58,054 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 56 states. [2018-11-10 09:52:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:52:02,595 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-10 09:52:02,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 09:52:02,597 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 78 [2018-11-10 09:52:02,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:52:02,597 INFO L225 Difference]: With dead ends: 90 [2018-11-10 09:52:02,597 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 09:52:02,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 251 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=751, Invalid=5685, Unknown=44, NotChecked=0, Total=6480 [2018-11-10 09:52:02,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 09:52:02,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 09:52:02,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 09:52:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 09:52:02,599 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-11-10 09:52:02,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:52:02,599 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:52:02,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-10 09:52:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:52:02,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 09:52:02,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 09:52:02,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:52:02,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:52:03,408 WARN L179 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 61 [2018-11-10 09:52:03,583 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 49 [2018-11-10 09:52:05,267 WARN L179 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 144 DAG size of output: 102 [2018-11-10 09:52:05,675 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2018-11-10 09:52:06,175 WARN L179 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 64 [2018-11-10 09:52:06,383 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2018-11-10 09:52:06,572 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2018-11-10 09:52:06,821 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2018-11-10 09:52:07,017 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2018-11-10 09:52:07,142 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 41 [2018-11-10 09:52:07,192 INFO L421 ceAbstractionStarter]: At program point initENTRY(lines 15 21) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (not (= (_ bv0 32) (select .cse0 (bvadd |~#pp~0.offset| (_ bv4 32))))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)))) [2018-11-10 09:52:07,192 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 20) no Hoare annotation was computed. [2018-11-10 09:52:07,192 INFO L425 ceAbstractionStarter]: For program point L17-3(lines 17 20) no Hoare annotation was computed. [2018-11-10 09:52:07,193 INFO L421 ceAbstractionStarter]: At program point L17-4(lines 17 20) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse3 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse2 (select .cse0 .cse3))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (and (= (_ bv0 32) (select .cse1 |~#pp~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|))) (= .cse2 (select .cse1 .cse3)))) (not (= (_ bv0 32) .cse2)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-11-10 09:52:07,193 INFO L425 ceAbstractionStarter]: For program point initEXIT(lines 15 21) no Hoare annotation was computed. [2018-11-10 09:52:07,193 INFO L425 ceAbstractionStarter]: For program point L17-5(lines 15 21) no Hoare annotation was computed. [2018-11-10 09:52:07,193 INFO L425 ceAbstractionStarter]: For program point mallocFINAL(lines 46 49) no Hoare annotation was computed. [2018-11-10 09:52:07,193 INFO L425 ceAbstractionStarter]: For program point mallocEXIT(lines 46 49) no Hoare annotation was computed. [2018-11-10 09:52:07,193 INFO L421 ceAbstractionStarter]: At program point mallocENTRY(lines 46 49) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse0 (not (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32)))) (.cse1 (not (= (select .cse5 |~#pp~0.offset|) (_ bv0 32)))) (.cse2 (not (= (_ bv0 32) (select .cse5 (bvadd |~#pp~0.offset| (_ bv4 32)))))) (.cse3 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse4 (not (= (_ bv0 32) |~#pp~0.offset|)))) (and (or .cse0 .cse1 (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) .cse2 .cse3 .cse4) (or (= (bvadd ~counter~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0 .cse1 (not (= (bvadd |old(~counter~0)| (_ bv4294967294 32)) (_ bv0 32))) .cse2 .cse3 .cse4)))) [2018-11-10 09:52:07,193 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:52:07,193 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |~#pstate~0.base|)) (.cse0 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse4 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (and (or (not (= (bvadd (select .cse0 |~#pstate~0.offset|) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv1 32) (select .cse1 |~#pstate~0.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)) (= |old(~counter~0)| ~counter~0) (let ((.cse3 (bvadd |~#pp~0.offset| (_ bv4 32)))) (= (select .cse2 .cse3) (select .cse4 .cse3))) (let ((.cse5 (bvadd |~#pstate~0.offset| (_ bv4 32)))) (or (= (bvadd (select .cse1 .cse5) (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv1 32) (select .cse0 .cse5))))) (= (select .cse4 |~#pp~0.offset|) (select .cse2 |~#pp~0.offset|)))) [2018-11-10 09:52:07,193 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:52:07,193 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2018-11-10 09:52:07,193 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 25 31) no Hoare annotation was computed. [2018-11-10 09:52:07,193 INFO L425 ceAbstractionStarter]: For program point L25-3(lines 25 31) no Hoare annotation was computed. [2018-11-10 09:52:07,193 INFO L421 ceAbstractionStarter]: At program point L25-4(lines 25 31) the Hoare annotation is: (let ((.cse12 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse11 (select .cse12 (bvadd |~#pp~0.offset| (_ bv4 32)))) (.cse7 (= |old(#memory_int)| |#memory_int|)) (.cse8 (= |f_#in~pointer.offset| f_~pointer.offset)) (.cse9 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse10 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (let ((.cse1 (and .cse7 .cse8 .cse9 (= f_~pointer.base |f_#in~pointer.base|) .cse10 (= f_~i~1 (_ bv0 32)))) (.cse2 (= ~counter~0 .cse11)) (.cse3 (not (= (_ bv0 32) .cse11))) (.cse4 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse5 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse0 (select .cse12 |~#pp~0.offset|)) (.cse6 (= (bvadd ~counter~0 (_ bv1 32)) .cse11))) (and (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= .cse0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 (and .cse7 (= (_ bv2 32) f_~i~1) .cse8 .cse9 .cse10) (not (= (_ bv1 32) (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|))) .cse2 (and .cse7 .cse8 .cse9 (= (bvadd f_~i~1 (_ bv4294967295 32)) (_ bv0 32)) .cse10) .cse3 .cse4 .cse5 (not (= (bvadd .cse0 (_ bv4294967295 32)) (_ bv0 32))) .cse6))))) [2018-11-10 09:52:07,193 INFO L425 ceAbstractionStarter]: For program point L25-5(lines 23 32) no Hoare annotation was computed. [2018-11-10 09:52:07,193 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 23 32) no Hoare annotation was computed. [2018-11-10 09:52:07,194 INFO L421 ceAbstractionStarter]: At program point fENTRY(lines 23 32) the Hoare annotation is: (let ((.cse8 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse7 (select .cse8 (bvadd |~#pp~0.offset| (_ bv4 32))))) (let ((.cse5 (select .cse8 |~#pp~0.offset|)) (.cse1 (= ~counter~0 .cse7)) (.cse2 (not (= (_ bv0 32) .cse7))) (.cse3 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse4 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse0 (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (.cse6 (= (bvadd ~counter~0 (_ bv1 32)) .cse7))) (and (or (not (= (_ bv1 32) (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|))) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (bvadd .cse5 (_ bv4294967295 32)) (_ bv0 32))) .cse6) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= .cse5 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse0 .cse6))))) [2018-11-10 09:52:07,194 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 36 42) no Hoare annotation was computed. [2018-11-10 09:52:07,194 INFO L425 ceAbstractionStarter]: For program point L36-3(lines 36 42) no Hoare annotation was computed. [2018-11-10 09:52:07,194 INFO L421 ceAbstractionStarter]: At program point L36-4(lines 36 42) the Hoare annotation is: (let ((.cse25 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse16 (select .cse25 |~#pp~0.offset|))) (let ((.cse22 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse23 (bvadd |~#pstate~0.offset| (_ bv4 32))) (.cse12 (= (bvadd g_~i~2 (_ bv4294967295 32)) (_ bv0 32))) (.cse10 (select .cse25 (bvadd |~#pp~0.offset| (_ bv4 32)))) (.cse24 (= (_ bv2 32) |g_#in~pointer.offset|)) (.cse20 (not (= (bvadd .cse16 (_ bv4294967295 32)) (_ bv0 32))))) (let ((.cse9 (not (= (_ bv1 32) |g_#in~pointer.offset|))) (.cse11 (= (_ bv1 32) g_~pointer.offset)) (.cse3 (or (not .cse24) .cse20)) (.cse18 (= ~counter~0 .cse10)) (.cse19 (not (= (_ bv0 32) .cse10))) (.cse21 (= (bvadd ~counter~0 (_ bv1 32)) .cse10)) (.cse2 (= (_ bv2 32) g_~i~2)) (.cse7 (= g_~i~2 (_ bv0 32))) (.cse1 (= |old(#memory_int)| |#memory_int|)) (.cse8 (= |g_#in~pointer.offset| g_~pointer.offset)) (.cse0 (or (and .cse12 (= (_ bv1 32) .cse16) .cse24) (and .cse12 (exists ((|f_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |f_write~$Pointer$_#ptr.offset|)))))) (.cse15 (= (bvadd (select (select |#memory_int| |~#pstate~0.base|) .cse23) (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (not (= (_ bv1 32) (select .cse22 .cse23)))) (.cse14 (not (= (_ bv1 32) (select .cse22 |~#pstate~0.offset|)))) (.cse5 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse6 (not (= (_ bv0 32) |~#pp~0.offset|)))) (and (or (and .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (and (and .cse7 .cse1) .cse8)) (let ((.cse13 (= |g_#in~pointer.offset| .cse16))) (or (and .cse1 .cse2) .cse9 .cse5 (not (= (_ bv2 32) .cse10)) (and .cse11 .cse12 .cse13) (and .cse1 .cse11) .cse14 .cse4 (and .cse15 .cse13 .cse2) .cse6)) (let ((.cse17 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|))) (or .cse9 (and .cse11 .cse12) (not (= |g_#in~pointer.base| .cse17)) .cse18 .cse19 .cse5 (not (= .cse17 (_ bv0 32))) .cse2 (and .cse1 .cse7 (= g_~pointer.base .cse17) .cse8) .cse14 .cse6 .cse20 .cse21)) (or (and .cse1 .cse7 .cse8) .cse3 .cse2 .cse18 (and .cse12 .cse1 (= (_ bv2 32) g_~pointer.offset)) .cse19 .cse5 .cse6 .cse21) (or .cse2 (and .cse7 .cse1 .cse8) (and .cse0 .cse15) .cse4 .cse14 .cse5 (forall ((|f_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (not (= (bvadd (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |f_write~$Pointer$_#ptr.offset|) (_ bv4294967294 32)) (_ bv0 32)))) .cse6)))))) [2018-11-10 09:52:07,194 INFO L425 ceAbstractionStarter]: For program point L36-5(lines 34 43) no Hoare annotation was computed. [2018-11-10 09:52:07,194 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 34 43) no Hoare annotation was computed. [2018-11-10 09:52:07,194 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-10 09:52:07,194 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-10 09:52:07,194 INFO L421 ceAbstractionStarter]: At program point L39-2(line 39) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse10 (select .cse12 (bvadd |~#pp~0.offset| (_ bv4 32)))) (.cse8 (not (= (bvadd (select .cse12 |~#pp~0.offset|) (_ bv4294967295 32)) (_ bv0 32)))) (.cse11 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse1 (not (= (_ bv1 32) (select .cse11 (bvadd |~#pstate~0.offset| (_ bv4 32)))))) (.cse5 (not (= (_ bv1 32) (select .cse11 |~#pstate~0.offset|)))) (.cse0 (or (not (= (_ bv2 32) |g_#in~pointer.offset|)) .cse8)) (.cse6 (= ~counter~0 .cse10)) (.cse7 (not (= (_ bv0 32) .cse10))) (.cse2 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse3 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse9 (= (bvadd ~counter~0 (_ bv1 32)) .cse10))) (and (or .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|))) (or (not (= .cse4 (_ bv0 32))) (not (= (_ bv1 32) |g_#in~pointer.offset|)) (not (= |g_#in~pointer.base| .cse4)) .cse5 .cse6 .cse7 .cse2 .cse3 .cse8 .cse9)) (or .cse1 .cse5 .cse2 (forall ((|f_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (not (= (bvadd (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |f_write~$Pointer$_#ptr.offset|) (_ bv4294967294 32)) (_ bv0 32)))) .cse3) (or .cse0 .cse6 .cse7 .cse2 .cse3 .cse9))))) [2018-11-10 09:52:07,194 INFO L421 ceAbstractionStarter]: At program point gENTRY(lines 34 43) the Hoare annotation is: (let ((.cse16 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse14 (select .cse16 |~#pp~0.offset|))) (let ((.cse12 (select .cse16 (bvadd |~#pp~0.offset| (_ bv4 32)))) (.cse10 (not (= (bvadd .cse14 (_ bv4294967295 32)) (_ bv0 32)))) (.cse13 (= (_ bv2 32) |g_#in~pointer.offset|)) (.cse0 (= |old(#memory_int)| |#memory_int|)) (.cse15 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse1 (not (= (_ bv1 32) (select .cse15 (bvadd |~#pstate~0.offset| (_ bv4 32)))))) (.cse2 (not (= (_ bv1 32) (select .cse15 |~#pstate~0.offset|)))) (.cse6 (and (= (_ bv1 32) .cse14) .cse13 .cse0)) (.cse5 (or (not .cse13) .cse10)) (.cse8 (= ~counter~0 .cse12)) (.cse9 (not (= (_ bv0 32) .cse12))) (.cse3 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse4 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse11 (= (bvadd ~counter~0 (_ bv1 32)) .cse12))) (and (or .cse0 .cse1 .cse2 .cse3 (forall ((|f_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (not (= (bvadd (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |f_write~$Pointer$_#ptr.offset|) (_ bv4294967294 32)) (_ bv0 32)))) .cse4) (or .cse5 .cse1 .cse6 .cse3 .cse4) (let ((.cse7 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|))) (or (not (= (_ bv1 32) |g_#in~pointer.offset|)) .cse0 (not (= |g_#in~pointer.base| .cse7)) .cse8 .cse9 .cse3 (not (= .cse7 (_ bv0 32))) .cse2 .cse4 .cse10 .cse11)) (or .cse6 .cse5 .cse8 .cse9 .cse3 .cse4 .cse11)))))) [2018-11-10 09:52:07,194 INFO L425 ceAbstractionStarter]: For program point L39-3(line 39) no Hoare annotation was computed. [2018-11-10 09:52:07,194 INFO L425 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-10 09:52:07,194 INFO L425 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-11-10 09:52:07,195 INFO L425 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-11-10 09:52:07,195 INFO L428 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-11-10 09:52:07,195 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:52:07,195 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= |~#pstate~0.offset| (_ bv0 32)) (= (_ bv0 32) (select .cse0 |~#pp~0.offset|)) (= (_ bv0 32) |~#pp~0.offset|) (= (_ bv0 32) (select .cse0 (bvadd |~#pp~0.offset| (_ bv4 32)))) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)))) [2018-11-10 09:52:07,195 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 09:52:07,195 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:52:07,195 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-10 09:52:07,195 INFO L421 ceAbstractionStarter]: At program point L62(line 62) the Hoare annotation is: (let ((.cse11 (select |#memory_int| |~#pstate~0.base|)) (.cse1 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse7 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse8 (not (= main_~a~0.offset ~counter~0))) (.cse0 (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|)) (.cse6 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse9 (= (bvadd main_~b~0.offset (_ bv4294967294 32)) (_ bv0 32))) (.cse10 (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= (_ bv0 32) main_~a~0.base))) (let ((.cse3 (and .cse8 (= (_ bv0 32) .cse0) (= (_ bv1 32) (select .cse6 |~#pp~0.offset|)) .cse9 .cse10 .cse12)) (.cse5 (select .cse1 .cse7)) (.cse2 (= (bvadd (select .cse11 (bvadd |~#pstate~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)))) (or (not (= .cse0 (_ bv0 32))) (not (= (select .cse1 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and .cse2 .cse3) (let ((.cse4 (select .cse6 .cse7))) (and (= (_ bv0 32) main_~b~0.base) (not (= ~counter~0 .cse4)) .cse3 (not (= (bvadd ~counter~0 (_ bv1 32)) .cse4)) (= .cse5 .cse4))) (not (= (_ bv0 32) .cse5)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (and .cse8 .cse2 (exists ((|f_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (= main_~b~0.offset (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |f_write~$Pointer$_#ptr.offset|))) .cse9 .cse10 (= (_ bv1 32) (select .cse11 |~#pstate~0.offset|)) .cse12) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-11-10 09:52:07,195 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 51 69) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (not (= (_ bv0 32) (select .cse0 (bvadd |~#pp~0.offset| (_ bv4 32))))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)))) [2018-11-10 09:52:07,195 INFO L421 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse8 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse10 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse3 (select |#memory_int| |~#pstate~0.base|))) (let ((.cse1 (not (= main_~a~0.offset ~counter~0))) (.cse4 (= (bvadd main_~b~0.offset (_ bv4294967294 32)) (_ bv0 32))) (.cse5 (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32))) (.cse6 (= (_ bv1 32) (select .cse3 |~#pstate~0.offset|))) (.cse2 (select .cse8 .cse10)) (.cse7 (= (_ bv0 32) main_~a~0.base)) (.cse9 (select .cse0 .cse10))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 (= (bvadd .cse2 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select .cse3 (bvadd |~#pstate~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) .cse4 .cse5 .cse6 .cse7) (and .cse1 (= (_ bv0 32) main_~b~0.base) (= main_~a~0.base (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)) .cse4 (= main_~a~0.offset (select .cse8 |~#pp~0.offset|)) .cse5 (= .cse9 .cse2) .cse6 (not (= ~counter~0 .cse2)) (not (= (bvadd ~counter~0 (_ bv1 32)) .cse2)) .cse7) (not (= (_ bv0 32) .cse9)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-11-10 09:52:07,195 INFO L421 ceAbstractionStarter]: At program point L60(line 60) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse4 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse3 (select .cse0 .cse4))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse1 (select .cse2 .cse4))) (and (= (_ bv0 32) main_~b~0.base) (not (= ~counter~0 .cse1)) (= (bvadd main_~b~0.offset (_ bv4294967294 32)) (_ bv0 32)) (and (not (= main_~a~0.offset ~counter~0)) (= (_ bv0 32) (select .cse2 |~#pp~0.offset|)) (= .cse3 .cse1) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)) (= (_ bv0 32) main_~a~0.base)) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvadd ~counter~0 (_ bv1 32)) .cse1))))) (not (= (_ bv0 32) .cse3)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-11-10 09:52:07,195 INFO L421 ceAbstractionStarter]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse4 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse1 (select .cse0 .cse4))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse3 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse2 (select .cse3 .cse4))) (and (not (= main_~a~0.offset ~counter~0)) (= (_ bv0 32) main_~b~0.base) (= main_~a~0.base (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)) (= (bvadd main_~b~0.offset (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= .cse1 .cse2) (= (_ bv1 32) (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|)) (not (= ~counter~0 .cse2)) (= (_ bv1 32) (select .cse3 |~#pp~0.offset|)) (not (= (bvadd ~counter~0 (_ bv1 32)) .cse2)) (= (_ bv0 32) main_~a~0.base)))) (not (= (_ bv0 32) .cse1)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-11-10 09:52:07,196 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2018-11-10 09:52:07,196 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 51 69) no Hoare annotation was computed. [2018-11-10 09:52:07,196 INFO L421 ceAbstractionStarter]: At program point L56(line 56) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse3 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse2 (select .cse0 .cse3))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (_ bv0 32) (select .cse1 |~#pp~0.offset|)) (= (bvadd ~counter~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= .cse2 (select .cse1 .cse3)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)) (= (_ bv0 32) main_~a~0.base))) (not (= (_ bv0 32) .cse2)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-11-10 09:52:07,196 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-10 09:52:07,196 INFO L425 ceAbstractionStarter]: For program point L56-1(line 56) no Hoare annotation was computed. [2018-11-10 09:52:07,196 INFO L421 ceAbstractionStarter]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (not (= (_ bv0 32) (select .cse0 (bvadd |~#pp~0.offset| (_ bv4 32))))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)))) [2018-11-10 09:52:07,196 INFO L421 ceAbstractionStarter]: At program point L54-1(line 54) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse3 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse2 (select .cse0 .cse3))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (_ bv0 32) (select .cse1 |~#pp~0.offset|)) (= .cse2 (select .cse1 .cse3)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)))) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) .cse2)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-11-10 09:52:07,196 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 51 69) no Hoare annotation was computed. [2018-11-10 09:52:07,203 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,204 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,204 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,204 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,204 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,204 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,204 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,204 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,205 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,205 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,205 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,205 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,205 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,205 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,205 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,205 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,206 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,206 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,206 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,206 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,206 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,206 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,206 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,206 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,206 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,208 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,210 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,210 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,210 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,210 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,210 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,210 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,210 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,210 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,210 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,211 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,211 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,211 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,211 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,211 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,211 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,211 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,211 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,211 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,211 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,212 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,212 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,212 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,212 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,212 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,212 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,212 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,212 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,215 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,215 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,216 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,216 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,216 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,216 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,216 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,217 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,217 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,217 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,217 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,217 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,218 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,218 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,218 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,218 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,218 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,219 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,219 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,219 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,219 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,219 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,219 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,220 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,220 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,221 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,221 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,221 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,221 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,221 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,222 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,222 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,222 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,222 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,222 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,222 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,226 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,226 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,226 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,226 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,226 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,228 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,229 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,229 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-11-10 09:52:07,229 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,230 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,230 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,230 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,230 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,230 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,231 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,231 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,231 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,231 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,231 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,231 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,231 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,232 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,232 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,232 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,232 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,233 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-11-10 09:52:07,233 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,233 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-11-10 09:52:07,234 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,234 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,236 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,236 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,236 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,236 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,236 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,236 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,237 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,237 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,237 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,237 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,237 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,238 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,238 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,238 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,238 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,238 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,239 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,239 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,239 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,239 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,239 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,240 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,240 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,240 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,240 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,240 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,240 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,241 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,241 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,241 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,241 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,241 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,241 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,242 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,242 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,242 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,242 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,243 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,244 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,244 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-11-10 09:52:07,244 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,244 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,245 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,245 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,245 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,245 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,246 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,246 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,246 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,246 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,246 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,247 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,247 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,247 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,247 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,248 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,248 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-11-10 09:52:07,248 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-11-10 09:52:07,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,254 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,254 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,254 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,254 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,254 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,254 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,257 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,258 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,259 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,259 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,260 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,260 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,260 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,260 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,262 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,262 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,262 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,262 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,262 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,263 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,263 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:52:07 BoogieIcfgContainer [2018-11-10 09:52:07,265 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 09:52:07,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:52:07,265 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:52:07,265 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:52:07,266 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:51:22" (3/4) ... [2018-11-10 09:52:07,268 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 09:52:07,272 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-11-10 09:52:07,272 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure malloc [2018-11-10 09:52:07,272 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 09:52:07,272 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-11-10 09:52:07,272 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2018-11-10 09:52:07,273 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2018-11-10 09:52:07,273 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 09:52:07,276 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 48 nodes and edges [2018-11-10 09:52:07,277 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-10 09:52:07,277 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-10 09:52:07,277 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 09:52:07,294 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(#memory_$Pointer$)[pp][pp] == 0bv32) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || !(~bvadd64(counter, 4294967295bv32) == 0bv32)) || ((0bv32 == #memory_$Pointer$[pp][pp] && 0bv32 == #memory_$Pointer$[pp][pp]) && \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp) [2018-11-10 09:52:07,294 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(\old(#memory_$Pointer$)[pp][pp] == 0bv32) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || (((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32)) || counter == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || ~bvadd64(counter, 1bv32) == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) && ((((((((((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32) || ((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 2bv32 == i) && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || counter == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) || ((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && ~bvadd64(i, 4294967295bv32) == 0bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || !(~bvadd64(\old(#memory_$Pointer$)[pp][pp], 4294967295bv32) == 0bv32)) || ~bvadd64(counter, 1bv32) == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) [2018-11-10 09:52:07,294 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((~bvadd64(i, 4294967295bv32) == 0bv32 && 1bv32 == #memory_$Pointer$[pp][pp]) && 2bv32 == pointer) || (~bvadd64(i, 4294967295bv32) == 0bv32 && (\exists f_write~$Pointer$_#ptr.offset : bv32 :: 2bv32 == #memory_$Pointer$[pp][f_write~$Pointer$_#ptr.offset]))) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) || 2bv32 == i) || !(2bv32 == pointer) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || ((i == 0bv32 && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && pointer == pointer)) && ((((((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 2bv32 == i) || !(1bv32 == pointer)) || !(0bv32 == pstate)) || !(2bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || ((1bv32 == pointer && ~bvadd64(i, 4294967295bv32) == 0bv32) && pointer == #memory_$Pointer$[pp][pp])) || (\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 1bv32 == pointer)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || ((~bvadd64(unknown-#memory_int-unknown[pstate][~bvadd64(pstate, 4bv32)], 4294967295bv32) == 0bv32 && pointer == #memory_$Pointer$[pp][pp]) && 2bv32 == i)) || !(0bv32 == pp))) && ((((((((((((!(1bv32 == pointer) || (1bv32 == pointer && ~bvadd64(i, 4294967295bv32) == 0bv32)) || !(pointer == #memory_$Pointer$[pp][pp])) || counter == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || !(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(#memory_$Pointer$[pp][pp] == 0bv32)) || 2bv32 == i) || (((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && i == 0bv32) && pointer == #memory_$Pointer$[pp][pp]) && pointer == pointer)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(0bv32 == pp)) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) || ~bvadd64(counter, 1bv32) == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) && ((((((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && i == 0bv32) && pointer == pointer) || !(2bv32 == pointer) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) || 2bv32 == i) || counter == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || ((~bvadd64(i, 4294967295bv32) == 0bv32 && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && 2bv32 == pointer)) || !(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || ~bvadd64(counter, 1bv32) == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) && (((((((2bv32 == i || ((i == 0bv32 && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && pointer == pointer)) || ((((~bvadd64(i, 4294967295bv32) == 0bv32 && 1bv32 == #memory_$Pointer$[pp][pp]) && 2bv32 == pointer) || (~bvadd64(i, 4294967295bv32) == 0bv32 && (\exists f_write~$Pointer$_#ptr.offset : bv32 :: 2bv32 == #memory_$Pointer$[pp][f_write~$Pointer$_#ptr.offset]))) && ~bvadd64(unknown-#memory_int-unknown[pstate][~bvadd64(pstate, 4bv32)], 4294967295bv32) == 0bv32)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(0bv32 == pstate)) || (forall f_write~$Pointer$_#ptr.offset : bv32 :: !(~bvadd64(#memory_$Pointer$[pp][f_write~$Pointer$_#ptr.offset], 4294967294bv32) == 0bv32))) || !(0bv32 == pp)) [2018-11-10 09:52:07,310 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fcc07c72-041b-4edd-91c0-408f9cd3e0c5/bin-2019/utaipan/witness.graphml [2018-11-10 09:52:07,310 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:52:07,311 INFO L168 Benchmark]: Toolchain (without parser) took 45705.01 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 396.4 MB). Free memory was 948.7 MB in the beginning and 1.3 GB in the end (delta: -350.9 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2018-11-10 09:52:07,311 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:52:07,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.14 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:52:07,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.03 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:52:07,311 INFO L168 Benchmark]: Boogie Preprocessor took 28.28 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:52:07,312 INFO L168 Benchmark]: RCFGBuilder took 372.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2018-11-10 09:52:07,312 INFO L168 Benchmark]: TraceAbstraction took 45026.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 259.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -212.2 MB). Peak memory consumption was 582.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:52:07,312 INFO L168 Benchmark]: Witness Printer took 44.85 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:52:07,313 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 198.14 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.03 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.28 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 372.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45026.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 259.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -212.2 MB). Peak memory consumption was 582.1 MB. Max. memory is 11.5 GB. * Witness Printer took 44.85 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. 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$.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$.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 - 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$.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 - 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$.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 - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 - 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$.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 - 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$.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 - 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$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] - 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$.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$.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 - 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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] - 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$.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$.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 - 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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] - 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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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$ - 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: 6]: 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: 25]: Loop Invariant [2018-11-10 09:52:07,317 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,317 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,317 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,317 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,317 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,317 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,317 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,319 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,319 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,320 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,320 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,320 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,320 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,320 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,320 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,320 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,320 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,320 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,320 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,321 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,321 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,321 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,321 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,321 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,321 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,322 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,322 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,322 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,322 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,322 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,322 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,322 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,323 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,323 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,323 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,323 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,323 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,323 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,323 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,324 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,324 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,324 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,324 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,325 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,325 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,325 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,325 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,325 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,325 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,325 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,325 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,326 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,326 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,326 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,326 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,326 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,326 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,326 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,326 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,326 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,326 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,326 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,327 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,327 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,327 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,327 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((!(\old(#memory_$Pointer$)[pp][pp] == 0bv32) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || (((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32)) || counter == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || ~bvadd64(counter, 1bv32) == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) && ((((((((((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32) || ((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 2bv32 == i) && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || counter == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) || ((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && ~bvadd64(i, 4294967295bv32) == 0bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || !(~bvadd64(\old(#memory_$Pointer$)[pp][pp], 4294967295bv32) == 0bv32)) || ~bvadd64(counter, 1bv32) == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) - InvariantResult [Line: 36]: Loop Invariant [2018-11-10 09:52:07,333 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,333 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,333 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-11-10 09:52:07,333 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,334 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,334 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,334 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,334 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,334 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,335 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,335 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,335 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,335 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,335 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,336 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,336 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,336 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,336 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,336 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,336 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,337 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-11-10 09:52:07,337 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,337 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-11-10 09:52:07,338 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,338 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,338 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,338 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,338 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,338 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,346 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,346 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,346 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,347 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,347 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,347 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,347 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,347 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,347 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,347 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-11-10 09:52:07,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,352 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,352 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,369 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-11-10 09:52:07,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,369 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-11-10 09:52:07,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,387 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,387 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,387 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,387 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,387 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:52:07,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((~bvadd64(i, 4294967295bv32) == 0bv32 && 1bv32 == #memory_$Pointer$[pp][pp]) && 2bv32 == pointer) || (~bvadd64(i, 4294967295bv32) == 0bv32 && (\exists f_write~$Pointer$_#ptr.offset : bv32 :: 2bv32 == #memory_$Pointer$[pp][f_write~$Pointer$_#ptr.offset]))) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) || 2bv32 == i) || !(2bv32 == pointer) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || ((i == 0bv32 && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && pointer == pointer)) && ((((((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 2bv32 == i) || !(1bv32 == pointer)) || !(0bv32 == pstate)) || !(2bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || ((1bv32 == pointer && ~bvadd64(i, 4294967295bv32) == 0bv32) && pointer == #memory_$Pointer$[pp][pp])) || (\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 1bv32 == pointer)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || ((~bvadd64(unknown-#memory_int-unknown[pstate][~bvadd64(pstate, 4bv32)], 4294967295bv32) == 0bv32 && pointer == #memory_$Pointer$[pp][pp]) && 2bv32 == i)) || !(0bv32 == pp))) && ((((((((((((!(1bv32 == pointer) || (1bv32 == pointer && ~bvadd64(i, 4294967295bv32) == 0bv32)) || !(pointer == #memory_$Pointer$[pp][pp])) || counter == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || !(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(#memory_$Pointer$[pp][pp] == 0bv32)) || 2bv32 == i) || (((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && i == 0bv32) && pointer == #memory_$Pointer$[pp][pp]) && pointer == pointer)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(0bv32 == pp)) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) || ~bvadd64(counter, 1bv32) == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) && ((((((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && i == 0bv32) && pointer == pointer) || !(2bv32 == pointer) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) || 2bv32 == i) || counter == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || ((~bvadd64(i, 4294967295bv32) == 0bv32 && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && 2bv32 == pointer)) || !(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || ~bvadd64(counter, 1bv32) == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) && (((((((2bv32 == i || ((i == 0bv32 && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && pointer == pointer)) || ((((~bvadd64(i, 4294967295bv32) == 0bv32 && 1bv32 == #memory_$Pointer$[pp][pp]) && 2bv32 == pointer) || (~bvadd64(i, 4294967295bv32) == 0bv32 && (\exists f_write~$Pointer$_#ptr.offset : bv32 :: 2bv32 == #memory_$Pointer$[pp][f_write~$Pointer$_#ptr.offset]))) && ~bvadd64(unknown-#memory_int-unknown[pstate][~bvadd64(pstate, 4bv32)], 4294967295bv32) == 0bv32)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(0bv32 == pstate)) || (forall f_write~$Pointer$_#ptr.offset : bv32 :: !(~bvadd64(#memory_$Pointer$[pp][f_write~$Pointer$_#ptr.offset], 4294967294bv32) == 0bv32))) || !(0bv32 == pp)) - InvariantResult [Line: 17]: Loop Invariant [2018-11-10 09:52:07,407 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,407 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,407 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,427 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,427 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,427 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,428 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,428 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,428 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,429 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,429 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,429 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,429 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,429 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,429 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,430 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,430 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,430 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 09:52:07,430 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,430 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,430 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 09:52:07,430 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,431 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,431 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,431 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,431 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,431 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 09:52:07,431 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((!(\old(#memory_$Pointer$)[pp][pp] == 0bv32) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || !(~bvadd64(counter, 4294967295bv32) == 0bv32)) || ((0bv32 == #memory_$Pointer$[pp][pp] && 0bv32 == #memory_$Pointer$[pp][pp]) && \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 51 locations, 1 error locations. SAFE Result, 44.9s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 21.0s AutomataDifference, 0.0s DeadEndRemovalTime, 4.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 658 SDtfs, 1559 SDslu, 2248 SDs, 0 SdLazy, 9762 SolverSat, 935 SolverUnsat, 153 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3117 GetRequests, 2636 SyntacticMatches, 17 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6422 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 131 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 152 PreInvPairs, 199 NumberOfFragments, 2414 HoareAnnotationTreeSize, 152 FomulaSimplifications, 9405 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 20 FomulaSimplificationsInter, 5940 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 1569 NumberOfCodeBlocks, 1569 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2902 ConstructedInterpolants, 47 QuantifiedInterpolants, 1205220 SizeOfPredicates, 388 NumberOfNonLiveVariables, 7459 ConjunctsInSsa, 556 ConjunctsInUnsatCore, 48 InterpolantComputations, 3 PerfectInterpolantSequences, 939/1500 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...