./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/lcp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/verifythis/lcp.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/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 17e6e52dd20f9be422d05cd630fd9252ae3011a2 .................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/verifythis/lcp.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/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 17e6e52dd20f9be422d05cd630fd9252ae3011a2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:34:30,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:34:30,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:34:30,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:34:30,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:34:30,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:34:30,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:34:30,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:34:30,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:34:30,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:34:30,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:34:30,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:34:30,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:34:30,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:34:30,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:34:30,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:34:30,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:34:30,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:34:30,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:34:30,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:34:30,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:34:30,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:34:30,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:34:30,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:34:30,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:34:30,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:34:30,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:34:30,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:34:30,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:34:30,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:34:30,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:34:30,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:34:30,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:34:30,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:34:30,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:34:30,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:34:30,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:34:30,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:34:30,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:34:30,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:34:30,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:34:30,211 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:34:30,220 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:34:30,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:34:30,221 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:34:30,221 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:34:30,221 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:34:30,221 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:34:30,221 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:34:30,222 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:34:30,222 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:34:30,222 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:34:30,222 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:34:30,222 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:34:30,222 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:34:30,222 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:34:30,222 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:34:30,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:34:30,223 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:34:30,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:34:30,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:34:30,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:34:30,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:34:30,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:34:30,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:34:30,223 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:34:30,224 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:34:30,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:34:30,224 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:34:30,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:34:30,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:34:30,224 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:34:30,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:34:30,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:34:30,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:34:30,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:34:30,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:34:30,225 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:34:30,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:34:30,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:34:30,225 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:34:30,225 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:34:30,225 INFO L138 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/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/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 -> 17e6e52dd20f9be422d05cd630fd9252ae3011a2 [2019-12-07 11:34:30,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:34:30,332 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:34:30,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:34:30,336 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:34:30,336 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:34:30,337 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/../../sv-benchmarks/c/verifythis/lcp.c [2019-12-07 11:34:30,376 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/data/08eba6ab0/cd71e4e4f12949349bbc983a0a476459/FLAG4fd101f17 [2019-12-07 11:34:30,803 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:34:30,804 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/sv-benchmarks/c/verifythis/lcp.c [2019-12-07 11:34:30,808 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/data/08eba6ab0/cd71e4e4f12949349bbc983a0a476459/FLAG4fd101f17 [2019-12-07 11:34:30,816 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/data/08eba6ab0/cd71e4e4f12949349bbc983a0a476459 [2019-12-07 11:34:30,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:34:30,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:34:30,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:34:30,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:34:30,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:34:30,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:34:30" (1/1) ... [2019-12-07 11:34:30,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@521bf317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:30, skipping insertion in model container [2019-12-07 11:34:30,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:34:30" (1/1) ... [2019-12-07 11:34:30,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:34:30,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:34:30,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:34:30,982 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:34:30,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:34:31,006 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:34:31,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:31 WrapperNode [2019-12-07 11:34:31,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:34:31,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:34:31,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:34:31,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:34:31,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:31" (1/1) ... [2019-12-07 11:34:31,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:31" (1/1) ... [2019-12-07 11:34:31,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:34:31,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:34:31,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:34:31,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:34:31,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:31" (1/1) ... [2019-12-07 11:34:31,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:31" (1/1) ... [2019-12-07 11:34:31,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:31" (1/1) ... [2019-12-07 11:34:31,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:31" (1/1) ... [2019-12-07 11:34:31,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:31" (1/1) ... [2019-12-07 11:34:31,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:31" (1/1) ... [2019-12-07 11:34:31,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:31" (1/1) ... [2019-12-07 11:34:31,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:34:31,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:34:31,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:34:31,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:34:31,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/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 [2019-12-07 11:34:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:34:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:34:31,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:34:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:34:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:34:31,331 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:34:31,331 INFO L287 CfgBuilder]: Removed 15 assume(true) statements. [2019-12-07 11:34:31,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:34:31 BoogieIcfgContainer [2019-12-07 11:34:31,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:34:31,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:34:31,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:34:31,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:34:31,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:34:30" (1/3) ... [2019-12-07 11:34:31,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1ecd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:34:31, skipping insertion in model container [2019-12-07 11:34:31,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:31" (2/3) ... [2019-12-07 11:34:31,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1ecd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:34:31, skipping insertion in model container [2019-12-07 11:34:31,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:34:31" (3/3) ... [2019-12-07 11:34:31,338 INFO L109 eAbstractionObserver]: Analyzing ICFG lcp.c [2019-12-07 11:34:31,345 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:34:31,350 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:34:31,357 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 11:34:31,373 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:34:31,373 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:34:31,373 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:34:31,373 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:34:31,373 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:34:31,373 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:34:31,373 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:34:31,373 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:34:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-12-07 11:34:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:34:31,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:31,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:34:31,388 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:31,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:31,392 INFO L82 PathProgramCache]: Analyzing trace with hash 83827037, now seen corresponding path program 1 times [2019-12-07 11:34:31,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:34:31,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022358817] [2019-12-07 11:34:31,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:34:31,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022358817] [2019-12-07 11:34:31,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:31,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:34:31,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033084722] [2019-12-07 11:34:31,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 11:34:31,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:34:31,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 11:34:31,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:34:31,510 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-12-07 11:34:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:31,521 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-12-07 11:34:31,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 11:34:31,522 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-12-07 11:34:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:31,528 INFO L225 Difference]: With dead ends: 27 [2019-12-07 11:34:31,529 INFO L226 Difference]: Without dead ends: 12 [2019-12-07 11:34:31,531 INFO L630 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 [2019-12-07 11:34:31,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-12-07 11:34:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-12-07 11:34:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-07 11:34:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-12-07 11:34:31,553 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 5 [2019-12-07 11:34:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:31,553 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-12-07 11:34:31,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 11:34:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-12-07 11:34:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 11:34:31,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:31,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 11:34:31,554 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:31,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:31,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1661417942, now seen corresponding path program 1 times [2019-12-07 11:34:31,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:34:31,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345021431] [2019-12-07 11:34:31,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:34:31,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345021431] [2019-12-07 11:34:31,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:31,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:34:31,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065133066] [2019-12-07 11:34:31,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:34:31,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:34:31,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:34:31,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:34:31,622 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-12-07 11:34:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:31,635 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-12-07 11:34:31,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:34:31,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 11:34:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:31,636 INFO L225 Difference]: With dead ends: 23 [2019-12-07 11:34:31,636 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 11:34:31,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:34:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 11:34:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 11:34:31,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 11:34:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-12-07 11:34:31,639 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 6 [2019-12-07 11:34:31,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:31,639 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-12-07 11:34:31,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:34:31,639 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-12-07 11:34:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 11:34:31,639 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:31,640 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-07 11:34:31,640 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:31,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1166765971, now seen corresponding path program 1 times [2019-12-07 11:34:31,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:34:31,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859500279] [2019-12-07 11:34:31,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:31,684 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (const Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1315) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1196) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.TermTransferrer.convertApplicationTerm(TermTransferrer.java:182) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:573) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:171) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:269) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:205) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-12-07 11:34:31,687 INFO L168 Benchmark]: Toolchain (without parser) took 867.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 944.6 MB in the beginning and 1.0 GB in the end (delta: -81.2 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:31,688 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:34:31,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:31,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:34:31,689 INFO L168 Benchmark]: Boogie Preprocessor took 16.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:31,690 INFO L168 Benchmark]: RCFGBuilder took 282.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:31,691 INFO L168 Benchmark]: TraceAbstraction took 352.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:31,694 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 187.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 282.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 352.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (const Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (const Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 11:34:33,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:34:33,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:34:33,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:34:33,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:34:33,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:34:33,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:34:33,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:34:33,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:34:33,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:34:33,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:34:33,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:34:33,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:34:33,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:34:33,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:34:33,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:34:33,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:34:33,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:34:33,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:34:33,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:34:33,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:34:33,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:34:33,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:34:33,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:34:33,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:34:33,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:34:33,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:34:33,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:34:33,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:34:33,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:34:33,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:34:33,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:34:33,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:34:33,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:34:33,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:34:33,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:34:33,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:34:33,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:34:33,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:34:33,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:34:33,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:34:33,125 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 11:34:33,138 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:34:33,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:34:33,139 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:34:33,139 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:34:33,139 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:34:33,139 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:34:33,139 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:34:33,140 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:34:33,140 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:34:33,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:34:33,141 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:34:33,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:34:33,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:34:33,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:34:33,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:34:33,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:34:33,142 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:34:33,142 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 11:34:33,142 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 11:34:33,142 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:34:33,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:34:33,143 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:34:33,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:34:33,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:34:33,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:34:33,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:34:33,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:34:33,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:34:33,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:34:33,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:34:33,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:34:33,145 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 11:34:33,145 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 11:34:33,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:34:33,145 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:34:33,145 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:34:33,146 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/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 -> 17e6e52dd20f9be422d05cd630fd9252ae3011a2 [2019-12-07 11:34:33,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:34:33,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:34:33,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:34:33,333 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:34:33,333 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:34:33,334 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/../../sv-benchmarks/c/verifythis/lcp.c [2019-12-07 11:34:33,383 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/data/cdc8dc358/f22c348b77b643609fba3566a89f52f5/FLAGdb4172fa6 [2019-12-07 11:34:33,782 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:34:33,783 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/sv-benchmarks/c/verifythis/lcp.c [2019-12-07 11:34:33,787 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/data/cdc8dc358/f22c348b77b643609fba3566a89f52f5/FLAGdb4172fa6 [2019-12-07 11:34:34,153 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/data/cdc8dc358/f22c348b77b643609fba3566a89f52f5 [2019-12-07 11:34:34,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:34:34,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:34:34,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:34:34,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:34:34,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:34:34,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:34:34" (1/1) ... [2019-12-07 11:34:34,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@589e2c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:34, skipping insertion in model container [2019-12-07 11:34:34,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:34:34" (1/1) ... [2019-12-07 11:34:34,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:34:34,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:34:34,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:34:34,287 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:34:34,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:34:34,312 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:34:34,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:34 WrapperNode [2019-12-07 11:34:34,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:34:34,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:34:34,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:34:34,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:34:34,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:34" (1/1) ... [2019-12-07 11:34:34,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:34" (1/1) ... [2019-12-07 11:34:34,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:34:34,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:34:34,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:34:34,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:34:34,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:34" (1/1) ... [2019-12-07 11:34:34,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:34" (1/1) ... [2019-12-07 11:34:34,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:34" (1/1) ... [2019-12-07 11:34:34,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:34" (1/1) ... [2019-12-07 11:34:34,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:34" (1/1) ... [2019-12-07 11:34:34,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:34" (1/1) ... [2019-12-07 11:34:34,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:34" (1/1) ... [2019-12-07 11:34:34,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:34:34,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:34:34,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:34:34,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:34:34,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/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 [2019-12-07 11:34:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:34:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 11:34:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:34:34,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:34:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:34:34,615 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:34:34,616 INFO L287 CfgBuilder]: Removed 15 assume(true) statements. [2019-12-07 11:34:34,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:34:34 BoogieIcfgContainer [2019-12-07 11:34:34,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:34:34,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:34:34,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:34:34,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:34:34,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:34:34" (1/3) ... [2019-12-07 11:34:34,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8eb49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:34:34, skipping insertion in model container [2019-12-07 11:34:34,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:34:34" (2/3) ... [2019-12-07 11:34:34,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8eb49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:34:34, skipping insertion in model container [2019-12-07 11:34:34,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:34:34" (3/3) ... [2019-12-07 11:34:34,622 INFO L109 eAbstractionObserver]: Analyzing ICFG lcp.c [2019-12-07 11:34:34,628 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:34:34,632 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:34:34,639 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 11:34:34,654 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:34:34,654 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:34:34,654 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:34:34,654 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:34:34,654 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:34:34,655 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:34:34,655 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:34:34,655 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:34:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-12-07 11:34:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 11:34:34,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:34,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:34:34,668 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:34,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:34,672 INFO L82 PathProgramCache]: Analyzing trace with hash 103127864, now seen corresponding path program 1 times [2019-12-07 11:34:34,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:34:34,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713422584] [2019-12-07 11:34:34,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:34,740 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 11:34:34,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:34:34,756 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:34:34,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713422584] [2019-12-07 11:34:34,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:34,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 11:34:34,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209258689] [2019-12-07 11:34:34,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 11:34:34,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:34:34,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 11:34:34,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:34:34,773 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-12-07 11:34:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:34,784 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-12-07 11:34:34,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 11:34:34,785 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-12-07 11:34:34,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:34,791 INFO L225 Difference]: With dead ends: 36 [2019-12-07 11:34:34,791 INFO L226 Difference]: Without dead ends: 16 [2019-12-07 11:34:34,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:34:34,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-07 11:34:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-12-07 11:34:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 11:34:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-12-07 11:34:34,814 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2019-12-07 11:34:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:34,815 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-12-07 11:34:34,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 11:34:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-12-07 11:34:34,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:34:34,815 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:34,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:34:35,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 11:34:35,016 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:35,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:35,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1317893681, now seen corresponding path program 1 times [2019-12-07 11:34:35,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:34:35,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348519509] [2019-12-07 11:34:35,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:35,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:34:35,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:34:35,143 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:34:35,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348519509] [2019-12-07 11:34:35,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:35,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:34:35,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678752814] [2019-12-07 11:34:35,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:34:35,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:34:35,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:34:35,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:34:35,183 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2019-12-07 11:34:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:35,242 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-12-07 11:34:35,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:34:35,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 11:34:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:35,244 INFO L225 Difference]: With dead ends: 29 [2019-12-07 11:34:35,244 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 11:34:35,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:34:35,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 11:34:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-07 11:34:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 11:34:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-12-07 11:34:35,248 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 10 [2019-12-07 11:34:35,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:35,248 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-12-07 11:34:35,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:34:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-12-07 11:34:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:34:35,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:35,249 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:34:35,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 11:34:35,450 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:35,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:35,451 INFO L82 PathProgramCache]: Analyzing trace with hash -573521694, now seen corresponding path program 1 times [2019-12-07 11:34:35,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:34:35,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315780433] [2019-12-07 11:34:35,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:35,579 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 11:34:35,581 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:35,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:39,927 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:39,928 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 104 [2019-12-07 11:34:39,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:39,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:39,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:39,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:39,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:39,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:39,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:39,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:39,939 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:39,957 INFO L614 ElimStorePlain]: treesize reduction 104, result has 2.8 percent of original size [2019-12-07 11:34:39,957 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:39,957 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:3 [2019-12-07 11:34:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:34:39,979 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:46,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:46,414 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 11:34:46,414 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:46,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 152 [2019-12-07 11:34:46,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:34:46,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:34:46,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:34:46,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:46,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:34:46,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:46,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:46,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:34:46,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:46,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:34:46,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:34:46,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:46,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:34:46,426 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-12-07 11:34:47,197 WARN L192 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-12-07 11:34:47,198 INFO L614 ElimStorePlain]: treesize reduction 983, result has 12.7 percent of original size [2019-12-07 11:34:47,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:47,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:47,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:47,202 INFO L534 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. [2019-12-07 11:34:47,203 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:143 [2019-12-07 11:34:47,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:47,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:47,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:48,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:48,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:48,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:48,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:34:48,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315780433] [2019-12-07 11:34:48,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [170094535] [2019-12-07 11:34:48,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:34:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:48,933 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:34:48,934 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:48,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2019-12-07 11:34:48,940 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:48,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:48,943 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:48,943 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-12-07 11:34:49,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:34:49,084 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:49,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:34:55,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570365530] [2019-12-07 11:34:55,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:55,438 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 11:34:55,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:55,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2019-12-07 11:34:55,443 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:55,445 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:55,445 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:55,445 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-12-07 11:34:55,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:34:55,450 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:55,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:34:55,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 11:34:55,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5, 5, 5, 5] total 18 [2019-12-07 11:34:55,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257750400] [2019-12-07 11:34:55,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:34:55,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:34:55,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:34:55,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=261, Unknown=6, NotChecked=0, Total=306 [2019-12-07 11:34:55,461 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 18 states. [2019-12-07 11:34:55,791 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 27 [2019-12-07 11:34:58,069 WARN L192 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-12-07 11:35:00,396 WARN L192 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-12-07 11:35:02,633 WARN L192 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-12-07 11:35:17,443 WARN L192 SmtUtils]: Spent 4.15 s on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 11:35:34,040 WARN L192 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 11:35:39,793 WARN L192 SmtUtils]: Spent 3.56 s on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 11:36:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:36:20,352 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-12-07 11:36:20,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 11:36:20,353 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 13 [2019-12-07 11:36:20,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:36:20,353 INFO L225 Difference]: With dead ends: 55 [2019-12-07 11:36:20,353 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 11:36:20,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 68.9s TimeCoverageRelationStatistics Valid=283, Invalid=954, Unknown=23, NotChecked=0, Total=1260 [2019-12-07 11:36:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 11:36:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2019-12-07 11:36:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 11:36:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-12-07 11:36:20,359 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2019-12-07 11:36:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:36:20,359 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-12-07 11:36:20,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:36:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-12-07 11:36:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:36:20,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:36:20,360 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:36:20,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3,5 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:36:20,963 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:36:20,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:36:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1995743793, now seen corresponding path program 1 times [2019-12-07 11:36:20,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:36:20,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763072789] [2019-12-07 11:36:20,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 11:36:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:36:21,101 WARN L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 11:36:21,102 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:36:21,392 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-07 11:36:21,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:21,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:34,474 WARN L192 SmtUtils]: Spent 12.65 s on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-12-07 11:36:34,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:34,754 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 11:36:35,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:36:39,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:36:39,306 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 11:36:39,306 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:36:39,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 59 treesize of output 223 [2019-12-07 11:36:39,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:39,351 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 11:36:39,518 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 3 [2019-12-07 11:36:39,518 INFO L614 ElimStorePlain]: treesize reduction 1342, result has 0.2 percent of original size [2019-12-07 11:36:39,518 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:36:39,518 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:3 [2019-12-07 11:36:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:36:39,580 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:36:54,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:06,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:19,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,372 WARN L192 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-12-07 11:37:20,373 INFO L343 Elim1Store]: treesize reduction 46, result has 87.4 percent of original size [2019-12-07 11:37:20,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 330 [2019-12-07 11:37:20,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:37:20,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:20,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 6 xjuncts. [2019-12-07 11:37:29,297 WARN L192 SmtUtils]: Spent 8.86 s on a formula simplification. DAG size of input: 134 DAG size of output: 78 [2019-12-07 11:37:29,297 INFO L614 ElimStorePlain]: treesize reduction 50432, result has 1.9 percent of original size [2019-12-07 11:37:29,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:37:29,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,305 INFO L534 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. [2019-12-07 11:37:29,306 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:106, output treesize:971 [2019-12-07 11:37:29,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:37:29,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:29,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:37:30,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:37:30,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:38:02,276 WARN L192 SmtUtils]: Spent 29.90 s on a formula simplification. DAG size of input: 118 DAG size of output: 76 [2019-12-07 11:38:02,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:38:02,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:38:02,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763072789] [2019-12-07 11:38:02,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1470175809] [2019-12-07 11:38:02,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:38:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:02,402 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:38:02,403 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:38:02,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2019-12-07 11:38:02,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:02,409 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:02,409 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:38:02,409 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-12-07 11:38:02,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:38:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 11:38:02,686 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:38:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 11:38:25,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:38:25,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [12, 11] total 25 [2019-12-07 11:38:25,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978000611] [2019-12-07 11:38:25,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:38:25,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:38:25,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:38:25,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=502, Unknown=30, NotChecked=0, Total=600 [2019-12-07 11:38:25,283 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 8 states. [2019-12-07 11:38:25,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:25,441 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-12-07 11:38:25,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:38:25,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 11:38:25,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:25,442 INFO L225 Difference]: With dead ends: 26 [2019-12-07 11:38:25,442 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 11:38:25,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 109.9s TimeCoverageRelationStatistics Valid=95, Invalid=577, Unknown=30, NotChecked=0, Total=702 [2019-12-07 11:38:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 11:38:25,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2019-12-07 11:38:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 11:38:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-12-07 11:38:25,445 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2019-12-07 11:38:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:25,445 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-12-07 11:38:25,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:38:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-12-07 11:38:25,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:38:25,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:25,446 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:25,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:38:25,848 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:25,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:25,848 INFO L82 PathProgramCache]: Analyzing trace with hash 279056774, now seen corresponding path program 1 times [2019-12-07 11:38:25,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:38:25,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55915254] [2019-12-07 11:38:25,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 11:40:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:11,674 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 11:40:11,675 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:40:12,311 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-12-07 11:40:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:40:12,366 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:40:12,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:40:13,295 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 11:40:13,737 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 11:40:13,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:40:13,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:40:13,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:40:14,279 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 11:40:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:40:14,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55915254] [2019-12-07 11:40:14,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1066171187] [2019-12-07 11:40:14,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:40:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:14,404 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 11:40:14,405 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:40:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:40:14,522 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:40:14,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:40:15,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:40:16,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:40:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:40:16,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314863751] [2019-12-07 11:40:16,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:40:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:16,288 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 11:40:16,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:40:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:40:17,500 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:40:17,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:40:17,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:40:17,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:40:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:40:17,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 11:40:17,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11, 10, 11, 10] total 34 [2019-12-07 11:40:17,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867078460] [2019-12-07 11:40:17,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 11:40:17,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:40:17,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 11:40:17,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 11:40:17,837 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 34 states. [2019-12-07 11:40:18,393 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-12-07 11:40:18,764 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-12-07 11:40:19,256 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-12-07 11:40:19,603 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 11:40:19,818 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-12-07 11:40:20,313 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 11:40:20,570 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2019-12-07 11:40:21,328 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-12-07 11:40:22,391 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 11:40:22,730 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 11:40:23,304 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 11:40:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:28,534 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2019-12-07 11:40:28,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 11:40:28,535 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 16 [2019-12-07 11:40:28,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:28,537 INFO L225 Difference]: With dead ends: 58 [2019-12-07 11:40:28,537 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 11:40:28,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=692, Invalid=2388, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 11:40:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 11:40:28,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-12-07 11:40:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 11:40:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-12-07 11:40:28,544 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2019-12-07 11:40:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:28,544 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-12-07 11:40:28,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 11:40:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-12-07 11:40:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:40:28,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:28,545 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:40:29,146 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:40:29,147 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:40:29,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:29,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1698182889, now seen corresponding path program 2 times [2019-12-07 11:40:29,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:40:29,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637317357] [2019-12-07 11:40:29,149 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 11:40:29,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 11:40:29,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:40:29,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 11:40:29,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:40:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 11:40:30,068 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:40:30,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:40:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 11:40:37,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637317357] [2019-12-07 11:40:37,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [946792944] [2019-12-07 11:40:37,069 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:40:37,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 11:40:37,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:40:37,221 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 11:40:37,222 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:40:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 11:40:37,316 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:40:37,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:40:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 11:40:47,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172375283] [2019-12-07 11:40:47,115 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab6326-5bbc-4241-b039-400641f4c3cd/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:40:47,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 11:40:47,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:40:47,518 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 11:40:47,519 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:40:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 11:40:48,084 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:40:48,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:40:56,033 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 11:40:56,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 11:40:56,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8, 7, 8, 7] total 18 [2019-12-07 11:40:56,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731095466] [2019-12-07 11:40:56,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:40:56,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:40:56,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:40:56,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:40:56,035 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 18 states. [2019-12-07 11:40:56,392 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 11:40:56,825 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-12-07 11:40:57,385 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 11:40:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:57,386 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-12-07 11:40:57,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:40:57,386 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-12-07 11:40:57,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:57,387 INFO L225 Difference]: With dead ends: 39 [2019-12-07 11:40:57,387 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:40:57,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 83 SyntacticMatches, 45 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:40:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:40:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:40:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:40:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:40:57,388 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-12-07 11:40:57,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:57,388 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:40:57,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:40:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:40:57,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:40:57,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk,12 mathsat -unsat_core_generation=3 [2019-12-07 11:40:57,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:40:59,357 WARN L192 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2019-12-07 11:40:59,561 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 31 [2019-12-07 11:40:59,562 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-12-07 11:40:59,563 INFO L246 CegarLoopResult]: For program point L19(lines 19 28) no Hoare annotation was computed. [2019-12-07 11:40:59,563 INFO L246 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2019-12-07 11:40:59,563 INFO L246 CegarLoopResult]: For program point L7-1(lines 7 9) no Hoare annotation was computed. [2019-12-07 11:40:59,563 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 11:40:59,563 INFO L246 CegarLoopResult]: For program point L-1-1(line -1) no Hoare annotation was computed. [2019-12-07 11:40:59,563 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:40:59,563 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 11:40:59,563 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-12-07 11:40:59,563 INFO L242 CegarLoopResult]: At program point L16(lines 11 17) the Hoare annotation is: (or (and (= ULTIMATE.start_lcp_~l~0 (_ bv0 32)) (= |ULTIMATE.start_lcp_#res| (_ bv0 32))) (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (or (not (bvslt (bvadd ULTIMATE.start_main_~y~0 |ULTIMATE.start_lcp_#res|) ULTIMATE.start_main_~n~0)) (not (bvslt (bvadd ULTIMATE.start_main_~x~0 |ULTIMATE.start_lcp_#res|) ULTIMATE.start_main_~n~0))) (= .cse0 (select |#memory_int| ULTIMATE.start_main_~a~0.base)) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_#t~malloc12.base|)) (bvslt ULTIMATE.start_main_~n~0 (_ bv1073741824 32)) (or (not (bvslt (bvadd ULTIMATE.start_lcp_~l~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~n~0)) (not (bvslt (bvadd ULTIMATE.start_lcp_~l~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~n~0))) (= (_ bv0 32) |ULTIMATE.start_main_#t~malloc12.offset|) (= .cse0 (select |#memory_int| ULTIMATE.start_lcp_~a.base)) (bvsge ULTIMATE.start_main_~n~0 (_ bv0 32))))) [2019-12-07 11:40:59,563 INFO L246 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2019-12-07 11:40:59,563 INFO L246 CegarLoopResult]: For program point L8-1(line 8) no Hoare annotation was computed. [2019-12-07 11:40:59,563 INFO L246 CegarLoopResult]: For program point L8-3(line 8) no Hoare annotation was computed. [2019-12-07 11:40:59,563 INFO L246 CegarLoopResult]: For program point L8-4(line 8) no Hoare annotation was computed. [2019-12-07 11:40:59,563 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:40:59,563 INFO L246 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-12-07 11:40:59,564 INFO L246 CegarLoopResult]: For program point L13-3(lines 13 15) no Hoare annotation was computed. [2019-12-07 11:40:59,564 INFO L242 CegarLoopResult]: At program point L13-5(lines 13 15) the Hoare annotation is: (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (= .cse0 (select |#memory_int| ULTIMATE.start_main_~a~0.base)) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_#t~malloc12.base|)) (bvslt ULTIMATE.start_main_~n~0 (_ bv1073741824 32)) (= (_ bv0 32) |ULTIMATE.start_main_#t~malloc12.offset|) (= .cse0 (select |#memory_int| ULTIMATE.start_lcp_~a.base)) (= ULTIMATE.start_lcp_~n ULTIMATE.start_main_~n~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~n~0 (_ bv0 32)) (= ULTIMATE.start_lcp_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_lcp_~y ULTIMATE.start_main_~y~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv0 32)))) [2019-12-07 11:40:59,564 INFO L246 CegarLoopResult]: For program point L13-6(lines 13 15) no Hoare annotation was computed. [2019-12-07 11:40:59,564 INFO L246 CegarLoopResult]: For program point L26(lines 26 27) no Hoare annotation was computed. [2019-12-07 11:40:59,564 INFO L249 CegarLoopResult]: At program point L43(lines 30 44) the Hoare annotation is: true [2019-12-07 11:40:59,568 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) 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:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) 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:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:258) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-12-07 11:40:59,569 INFO L168 Benchmark]: Toolchain (without parser) took 385414.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 952.4 MB in the beginning and 835.7 MB in the end (delta: 116.7 MB). Peak memory consumption was 285.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:40:59,570 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:40:59,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.81 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:40:59,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:40:59,571 INFO L168 Benchmark]: Boogie Preprocessor took 19.63 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:40:59,571 INFO L168 Benchmark]: RCFGBuilder took 226.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:40:59,572 INFO L168 Benchmark]: TraceAbstraction took 384951.22 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 835.7 MB in the end (delta: 249.4 MB). Peak memory consumption was 298.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:40:59,574 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.81 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 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 57.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.63 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 226.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 384951.22 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 835.7 MB in the end (delta: 249.4 MB). Peak memory consumption was 298.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...