./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 604294306b5c2c89672e57997bbce546f96c9935 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:28:18,991 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:28:18,993 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:28:19,003 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:28:19,003 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:28:19,004 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:28:19,006 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:28:19,007 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:28:19,009 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:28:19,010 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:28:19,011 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:28:19,011 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:28:19,012 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:28:19,013 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:28:19,014 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:28:19,015 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:28:19,016 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:28:19,018 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:28:19,020 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:28:19,021 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:28:19,022 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:28:19,023 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:28:19,025 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:28:19,026 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:28:19,026 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:28:19,027 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:28:19,028 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:28:19,029 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:28:19,030 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:28:19,031 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:28:19,031 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:28:19,032 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:28:19,033 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:28:19,033 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:28:19,034 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:28:19,034 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:28:19,035 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 21:28:19,048 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:28:19,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:28:19,049 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:28:19,049 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 21:28:19,050 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 21:28:19,050 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 21:28:19,050 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 21:28:19,050 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 21:28:19,050 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 21:28:19,051 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 21:28:19,051 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 21:28:19,051 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:28:19,053 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:28:19,053 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:28:19,053 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:28:19,053 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:28:19,053 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:28:19,053 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:28:19,054 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:28:19,054 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:28:19,054 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:28:19,054 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:28:19,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:28:19,054 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:28:19,055 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:28:19,055 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:28:19,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:28:19,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:28:19,055 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:28:19,055 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:28:19,056 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 21:28:19,056 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:28:19,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:28:19,056 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:28:19,056 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 604294306b5c2c89672e57997bbce546f96c9935 [2018-10-26 21:28:19,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:28:19,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:28:19,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:28:19,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:28:19,104 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:28:19,105 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-10-26 21:28:19,156 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/data/38c35f8b8/d748ef63aa84499192f02a5be86870e3/FLAG06d266875 [2018-10-26 21:28:19,532 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:28:19,533 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-10-26 21:28:19,540 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/data/38c35f8b8/d748ef63aa84499192f02a5be86870e3/FLAG06d266875 [2018-10-26 21:28:19,554 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/data/38c35f8b8/d748ef63aa84499192f02a5be86870e3 [2018-10-26 21:28:19,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:28:19,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:28:19,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:28:19,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:28:19,569 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:28:19,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:28:19" (1/1) ... [2018-10-26 21:28:19,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f0132f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:19, skipping insertion in model container [2018-10-26 21:28:19,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:28:19" (1/1) ... [2018-10-26 21:28:19,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:28:19,604 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:28:19,756 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:28:19,761 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:28:19,789 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:28:19,808 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:28:19,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:19 WrapperNode [2018-10-26 21:28:19,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:28:19,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:28:19,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:28:19,810 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:28:19,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:19" (1/1) ... [2018-10-26 21:28:19,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:19" (1/1) ... [2018-10-26 21:28:19,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:28:19,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:28:19,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:28:19,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:28:19,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:19" (1/1) ... [2018-10-26 21:28:19,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:19" (1/1) ... [2018-10-26 21:28:19,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:19" (1/1) ... [2018-10-26 21:28:19,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:19" (1/1) ... [2018-10-26 21:28:19,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:19" (1/1) ... [2018-10-26 21:28:19,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:19" (1/1) ... [2018-10-26 21:28:19,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:19" (1/1) ... [2018-10-26 21:28:19,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:28:19,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:28:19,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:28:19,878 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:28:19,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:28:20,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:28:20,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:28:20,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:28:20,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:28:20,010 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:28:20,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:28:20,541 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:28:20,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:28:20 BoogieIcfgContainer [2018-10-26 21:28:20,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:28:20,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:28:20,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:28:20,546 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:28:20,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:28:19" (1/3) ... [2018-10-26 21:28:20,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762d2f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:28:20, skipping insertion in model container [2018-10-26 21:28:20,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:19" (2/3) ... [2018-10-26 21:28:20,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762d2f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:28:20, skipping insertion in model container [2018-10-26 21:28:20,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:28:20" (3/3) ... [2018-10-26 21:28:20,549 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-10-26 21:28:20,559 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:28:20,568 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-10-26 21:28:20,588 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-10-26 21:28:20,620 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:28:20,620 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:28:20,620 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:28:20,620 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:28:20,620 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:28:20,620 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:28:20,620 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:28:20,621 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:28:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-10-26 21:28:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 21:28:20,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:20,645 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:20,648 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:20,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:20,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1395858257, now seen corresponding path program 1 times [2018-10-26 21:28:20,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:20,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:20,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:20,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:20,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:20,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:20,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:28:20,922 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:28:20,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:28:20,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:28:20,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:28:20,943 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-10-26 21:28:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:21,002 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2018-10-26 21:28:21,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:28:21,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-26 21:28:21,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:21,012 INFO L225 Difference]: With dead ends: 51 [2018-10-26 21:28:21,013 INFO L226 Difference]: Without dead ends: 33 [2018-10-26 21:28:21,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:28:21,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-26 21:28:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-26 21:28:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-26 21:28:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-10-26 21:28:21,050 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2018-10-26 21:28:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:21,050 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-10-26 21:28:21,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:28:21,051 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-10-26 21:28:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 21:28:21,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:21,051 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:21,052 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:21,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:21,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1868760050, now seen corresponding path program 1 times [2018-10-26 21:28:21,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:21,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:21,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:21,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:21,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:21,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:21,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:28:21,133 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:28:21,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:28:21,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:28:21,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:28:21,135 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2018-10-26 21:28:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:21,231 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-10-26 21:28:21,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:28:21,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-26 21:28:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:21,237 INFO L225 Difference]: With dead ends: 51 [2018-10-26 21:28:21,237 INFO L226 Difference]: Without dead ends: 49 [2018-10-26 21:28:21,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:28:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-26 21:28:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-10-26 21:28:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-26 21:28:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-10-26 21:28:21,245 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2018-10-26 21:28:21,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:21,245 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-10-26 21:28:21,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:28:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-10-26 21:28:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 21:28:21,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:21,246 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:21,247 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:21,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:21,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1932482999, now seen corresponding path program 1 times [2018-10-26 21:28:21,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:21,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:21,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:21,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:21,250 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:21,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:21,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:28:21,334 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:28:21,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:28:21,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:28:21,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:28:21,335 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2018-10-26 21:28:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:21,416 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-10-26 21:28:21,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:28:21,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-26 21:28:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:21,419 INFO L225 Difference]: With dead ends: 60 [2018-10-26 21:28:21,419 INFO L226 Difference]: Without dead ends: 40 [2018-10-26 21:28:21,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:28:21,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-26 21:28:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2018-10-26 21:28:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-26 21:28:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-10-26 21:28:21,425 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2018-10-26 21:28:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:21,425 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-10-26 21:28:21,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:28:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-10-26 21:28:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 21:28:21,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:21,426 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:21,426 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:21,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784762, now seen corresponding path program 1 times [2018-10-26 21:28:21,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:21,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:21,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:21,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:21,428 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:21,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:21,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:28:21,508 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:28:21,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:28:21,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:28:21,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:28:21,509 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-10-26 21:28:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:21,656 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-10-26 21:28:21,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:28:21,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-26 21:28:21,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:21,658 INFO L225 Difference]: With dead ends: 54 [2018-10-26 21:28:21,658 INFO L226 Difference]: Without dead ends: 34 [2018-10-26 21:28:21,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:28:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-26 21:28:21,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-10-26 21:28:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-26 21:28:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-10-26 21:28:21,662 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2018-10-26 21:28:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:21,663 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-10-26 21:28:21,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:28:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-10-26 21:28:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 21:28:21,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:21,665 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:21,666 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:21,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:21,666 INFO L82 PathProgramCache]: Analyzing trace with hash 341027121, now seen corresponding path program 1 times [2018-10-26 21:28:21,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:21,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:21,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:21,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:21,668 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:22,307 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-10-26 21:28:22,528 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 33 [2018-10-26 21:28:35,128 WARN L179 SmtUtils]: Spent 10.53 s on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2018-10-26 21:28:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:37,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:37,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-26 21:28:37,884 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:28:37,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 21:28:37,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 21:28:37,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=73, Unknown=2, NotChecked=0, Total=110 [2018-10-26 21:28:37,885 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 11 states. [2018-10-26 21:28:52,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:52,921 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-10-26 21:28:52,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:28:52,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-26 21:28:52,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:52,923 INFO L225 Difference]: With dead ends: 50 [2018-10-26 21:28:52,923 INFO L226 Difference]: Without dead ends: 48 [2018-10-26 21:28:52,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=54, Invalid=126, Unknown=2, NotChecked=0, Total=182 [2018-10-26 21:28:52,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-26 21:28:52,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-10-26 21:28:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-26 21:28:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-10-26 21:28:52,933 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 20 [2018-10-26 21:28:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:52,934 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-10-26 21:28:52,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 21:28:52,934 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-10-26 21:28:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 21:28:52,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:52,935 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:52,935 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:52,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:52,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1330084180, now seen corresponding path program 1 times [2018-10-26 21:28:52,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:52,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:52,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:52,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:52,938 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:53,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:53,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:28:53,354 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:28:53,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:28:53,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:28:53,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:28:53,355 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2018-10-26 21:28:53,640 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 21:28:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:53,714 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-10-26 21:28:53,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:28:53,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-10-26 21:28:53,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:53,716 INFO L225 Difference]: With dead ends: 55 [2018-10-26 21:28:53,716 INFO L226 Difference]: Without dead ends: 53 [2018-10-26 21:28:53,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:28:53,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-26 21:28:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2018-10-26 21:28:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-26 21:28:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-10-26 21:28:53,725 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 21 [2018-10-26 21:28:53,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:53,725 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-10-26 21:28:53,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:28:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-10-26 21:28:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 21:28:53,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:53,726 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:53,727 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:53,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:53,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1346141529, now seen corresponding path program 1 times [2018-10-26 21:28:53,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:53,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:53,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:53,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:53,731 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:54,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:54,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:28:54,223 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:28:54,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:28:54,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:28:54,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:28:54,224 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2018-10-26 21:28:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:54,613 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-10-26 21:28:54,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:28:54,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-10-26 21:28:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:54,617 INFO L225 Difference]: With dead ends: 79 [2018-10-26 21:28:54,617 INFO L226 Difference]: Without dead ends: 62 [2018-10-26 21:28:54,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:28:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-26 21:28:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 37. [2018-10-26 21:28:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-26 21:28:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-10-26 21:28:54,626 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2018-10-26 21:28:54,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:54,626 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-10-26 21:28:54,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:28:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-10-26 21:28:54,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 21:28:54,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:54,627 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:54,628 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:54,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:54,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1707533126, now seen corresponding path program 1 times [2018-10-26 21:28:54,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:54,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:54,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:54,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:54,629 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:54,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:54,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:28:54,918 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:28:54,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:28:54,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:28:54,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:28:54,919 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-10-26 21:28:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:55,060 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-10-26 21:28:55,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:28:55,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-10-26 21:28:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:55,061 INFO L225 Difference]: With dead ends: 62 [2018-10-26 21:28:55,061 INFO L226 Difference]: Without dead ends: 45 [2018-10-26 21:28:55,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:28:55,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-26 21:28:55,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2018-10-26 21:28:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-26 21:28:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-10-26 21:28:55,069 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 22 [2018-10-26 21:28:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:55,070 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-10-26 21:28:55,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:28:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-10-26 21:28:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 21:28:55,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:55,071 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:55,071 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:55,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:55,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1309636523, now seen corresponding path program 1 times [2018-10-26 21:28:55,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:55,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:55,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:55,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:55,073 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:55,260 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-10-26 21:28:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:55,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:28:55,337 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:28:55,338 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-10-26 21:28:55,339 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [58], [62], [66], [69], [70], [72], [91], [92], [93] [2018-10-26 21:28:55,386 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:28:55,386 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:28:55,573 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 21:28:57,917 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 21:28:57,918 INFO L272 AbstractInterpreter]: Visited 21 different actions 81 times. Merged at 4 different actions 60 times. Widened at 1 different actions 11 times. Found 1 fixpoints after 1 different actions. Largest state had 45 variables. [2018-10-26 21:28:57,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:57,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 21:28:57,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:28:57,933 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:28:57,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:57,948 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 21:28:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:58,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:28:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:58,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:28:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:58,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:28:58,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2018-10-26 21:28:58,312 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:28:58,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:28:58,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:28:58,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:28:58,313 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 8 states. [2018-10-26 21:28:58,617 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 21:29:04,593 WARN L179 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-10-26 21:29:15,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:29:15,693 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-10-26 21:29:15,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 21:29:15,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-10-26 21:29:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:29:15,694 INFO L225 Difference]: With dead ends: 64 [2018-10-26 21:29:15,695 INFO L226 Difference]: Without dead ends: 55 [2018-10-26 21:29:15,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=73, Invalid=136, Unknown=1, NotChecked=0, Total=210 [2018-10-26 21:29:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-26 21:29:15,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-26 21:29:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-26 21:29:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-10-26 21:29:15,703 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 22 [2018-10-26 21:29:15,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:29:15,704 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-10-26 21:29:15,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:29:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-10-26 21:29:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:29:15,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:29:15,705 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:29:15,705 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:29:15,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:29:15,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1722152317, now seen corresponding path program 1 times [2018-10-26 21:29:15,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:29:15,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:15,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:29:15,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:29:15,707 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:29:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:29:16,624 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-10-26 21:29:16,824 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 15 [2018-10-26 21:29:18,934 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_main_~main__index1~0 (- 1))) (.cse5 (div (+ c_main_~main__index2~0 4294867297) 4294967296))) (let ((.cse0 (* 4294967296 .cse5)) (.cse1 (- c_main_~main__index2~0)) (.cse2 (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ (* (- 4294967296) (div (+ (* (- 4294967296) .cse5) .cse3) 4294967296)) (+ c_main_~main__index1~0 4294867295)) 4294967296)) .cse3) 4294967296)) 1)))) (and (<= (+ (* 4294967296 (div (+ .cse0 (+ c_main_~main__index1~0 (+ .cse1 4294917295))) 4294967296)) 1) c_main_~main__index1~0) (or (and .cse2 (or (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ c_main_~main__index2~0 8589834590) 4294967296)) .cse3) 4294967296)) c_main_~main__index2~0 1)) (let ((.cse4 (div (+ c_main_~main__index2~0 4294867294) 4294967296))) (and (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) .cse4) .cse3) 4294967296)) 1)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* 4294967296 .cse4) (+ c_main_~main__index1~0 (+ .cse1 1))) 4294967296)) 100000)))))) (<= (+ .cse0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse1 4294967297)) 4294967296)) 1) c_main_~main__index1~0)) (<= (+ .cse0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse1 4294967294)) 4294967296)) 1) c_main_~main__index1~0) .cse2))) is different from false [2018-10-26 21:29:21,034 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse8 (div (+ c_main_~main__index2~0 4294867297) 4294967296)) (.cse5 (+ c_main_~main__index1~0 (- 1)))) (let ((.cse7 (div (+ (* (- 4294967296) .cse8) .cse5) 4294967296)) (.cse6 (div c_main_~main__index1~0 4294967296))) (let ((.cse2 (* 4294967296 .cse8)) (.cse0 (* 4294967296 .cse6)) (.cse1 (- c_main_~main__index1~0)) (.cse4 (* (- 4294967296) .cse7)) (.cse3 (- c_main_~main__index2~0))) (and (or (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ .cse0 (+ .cse1 (+ (* 2 c_main_~main__index2~0) 100001))) 8589934592)) 99998)) (<= (+ .cse0 4294967297) c_main_~main__index1~0)) (<= (+ .cse2 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse3 4294967294)) 4294967296)) 1) c_main_~main__index1~0) (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse4 (+ c_main_~main__index1~0 4294867295)) 4294967296)) .cse5) 4294967296)) 1)) (or (<= (+ .cse2 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse3 4294967297)) 4294967296)) 1) c_main_~main__index1~0) (and (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse0 (+ .cse1 (+ c_main_~main__index2~0 4294967294))) 4294967296)) .cse5) 4294967296)) c_main_~main__index2~0 1)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ (* 4294967296 (div c_main_~main__index2~0 4294967296)) (+ .cse4 (+ c_main_~main__index1~0 (+ .cse3 4294967296)))) 4294967296)) .cse5) 4294967296)) c_main_~main__index2~0 1)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (+ .cse6 (- .cse7))) .cse5) 4294967296)) c_main_~main__index2~0 1)))))))) is different from false [2018-10-26 21:29:23,075 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (div (+ c_main_~main__index2~0 4294867297) 4294967296)) (.cse5 (+ c_main_~main__index1~0 (- 1)))) (let ((.cse7 (div (+ (* (- 4294967296) .cse8) .cse5) 4294967296)) (.cse6 (div c_main_~main__index1~0 4294967296))) (let ((.cse2 (* 4294967296 .cse8)) (.cse0 (* 4294967296 .cse6)) (.cse1 (- c_main_~main__index1~0)) (.cse4 (* (- 4294967296) .cse7)) (.cse3 (- c_main_~main__index2~0))) (and (or (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ .cse0 (+ .cse1 (+ (* 2 c_main_~main__index2~0) 100001))) 8589934592)) 99998)) (<= (+ .cse0 4294967297) c_main_~main__index1~0)) (<= (+ .cse2 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse3 4294967294)) 4294967296)) 1) c_main_~main__index1~0) (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse4 (+ c_main_~main__index1~0 4294867295)) 4294967296)) .cse5) 4294967296)) 1)) (or (<= (+ .cse2 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse3 4294967297)) 4294967296)) 1) c_main_~main__index1~0) (and (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse0 (+ .cse1 (+ c_main_~main__index2~0 4294967294))) 4294967296)) .cse5) 4294967296)) c_main_~main__index2~0 1)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ (* 4294967296 (div c_main_~main__index2~0 4294967296)) (+ .cse4 (+ c_main_~main__index1~0 (+ .cse3 4294967296)))) 4294967296)) .cse5) 4294967296)) c_main_~main__index2~0 1)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (+ .cse6 (- .cse7))) .cse5) 4294967296)) c_main_~main__index2~0 1)))))))) is different from true [2018-10-26 21:29:25,312 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse8 (div (+ c_main_~main__index2~0 4294867297) 4294967296)) (.cse5 (+ c_main_~main__index1~0 (- 1)))) (let ((.cse7 (div (+ (* (- 4294967296) .cse8) .cse5) 4294967296)) (.cse6 (div c_main_~main__index1~0 4294967296))) (let ((.cse2 (* 4294967296 .cse8)) (.cse0 (* 4294967296 .cse6)) (.cse1 (- c_main_~main__index1~0)) (.cse4 (* (- 4294967296) .cse7)) (.cse3 (- c_main_~main__index2~0))) (and (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ .cse0 (+ .cse1 (+ (* 2 c_main_~main__index2~0) 100001))) 8589934592)) 99998)) (<= (+ .cse2 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse3 4294967294)) 4294967296)) 1) c_main_~main__index1~0) (<= c_main_~main__index1~0 (+ .cse0 99999)) (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse4 (+ c_main_~main__index1~0 4294867295)) 4294967296)) .cse5) 4294967296)) 1)) (or (<= (+ .cse2 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse3 4294967297)) 4294967296)) 1) c_main_~main__index1~0) (and (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse0 (+ .cse1 (+ c_main_~main__index2~0 4294967294))) 4294967296)) .cse5) 4294967296)) c_main_~main__index2~0 1)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ (* 4294967296 (div c_main_~main__index2~0 4294967296)) (+ .cse4 (+ c_main_~main__index1~0 (+ .cse3 4294967296)))) 4294967296)) .cse5) 4294967296)) c_main_~main__index2~0 1)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (+ .cse6 (- .cse7))) .cse5) 4294967296)) c_main_~main__index2~0 1)))))))) is different from false [2018-10-26 21:29:27,394 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse9 (div (+ c_main_~main__index2~0 4294867297) 4294967296)) (.cse6 (+ c_main_~main__index1~0 (- 1)))) (let ((.cse8 (div (+ (* (- 4294967296) .cse9) .cse6) 4294967296)) (.cse7 (div c_main_~main__index1~0 4294967296))) (let ((.cse3 (* 4294967296 .cse9)) (.cse1 (* 4294967296 .cse7)) (.cse2 (- c_main_~main__index1~0)) (.cse0 (* 4294967296 (div c_main_~main__index2~0 4294967296))) (.cse5 (* (- 4294967296) .cse8)) (.cse4 (- c_main_~main__index2~0))) (and (<= c_main_~main__index2~0 (+ .cse0 99999)) (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ .cse1 (+ .cse0 (+ .cse2 (+ c_main_~main__index2~0 200000)))) 8589934592)) 99998)) (<= (+ .cse3 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse4 4294967294)) 4294967296)) 1) c_main_~main__index1~0) (<= c_main_~main__index1~0 (+ .cse1 99999)) (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse5 (+ c_main_~main__index1~0 4294867295)) 4294967296)) .cse6) 4294967296)) 1)) (or (<= (+ .cse3 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse4 4294967297)) 4294967296)) 1) c_main_~main__index1~0) (and (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse1 (+ .cse2 (+ c_main_~main__index2~0 4294967294))) 4294967296)) .cse6) 4294967296)) c_main_~main__index2~0 1)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse0 (+ .cse5 (+ c_main_~main__index1~0 (+ .cse4 4294967296)))) 4294967296)) .cse6) 4294967296)) c_main_~main__index2~0 1)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (+ .cse7 (- .cse8))) .cse6) 4294967296)) c_main_~main__index2~0 1)))))))) is different from false [2018-10-26 21:29:29,558 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse20 (+ c_main_~main__index1~0 (- 1))) (.cse21 (div (+ c_main_~main__index2~0 4294867297) 4294967296)) (.cse10 (div c_main_~main__index2~0 4294967296)) (.cse15 (div c_main_~main__index1~0 4294967296))) (let ((.cse16 (* 4294967296 .cse15)) (.cse4 (* 4294967296 .cse10)) (.cse0 (* 4294967296 .cse21)) (.cse1 (- c_main_~main__index2~0)) (.cse3 (* (- 4294967296) (div (+ (* (- 4294967296) .cse21) .cse20) 4294967296)))) (and (or (<= (+ .cse0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse1 4294967297)) 4294967296)) 1) c_main_~main__index1~0) (let ((.cse18 (+ .cse16 2147483647)) (.cse19 (+ .cse4 2147483647))) (let ((.cse2 (* (- 1) c_main_~main__index2~0)) (.cse7 (select |c_#memory_int| |c_main_~#main__array~0.base|)) (.cse5 (< .cse19 c_main_~main__index2~0)) (.cse6 (<= c_main_~main__index2~0 .cse19)) (.cse12 (<= c_main_~main__index1~0 .cse18)) (.cse11 (< .cse18 c_main_~main__index1~0))) (and (or (and (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (* (- 4294967296) (div (+ c_main_~main__index1~0 .cse2 .cse3 .cse4 8589934592) 4294967296)) (- 1)) 4294967296)) 1)) .cse5) (and .cse6 (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (* (- 4294967296) (div (+ c_main_~main__index1~0 .cse2 .cse3 .cse4 4294967296) 4294967296)) (- 1)) 4294967296)) 1)))) (let ((.cse8 (* 4 c_main_~main__index2~0)) (.cse9 (* (- 17179869184) .cse10))) (or (and .cse6 (= |c_main_#t~mem4| (select .cse7 (+ .cse8 |c_main_~#main__array~0.offset| .cse9)))) (and (= |c_main_#t~mem4| (select .cse7 (+ .cse8 |c_main_~#main__array~0.offset| .cse9 (- 17179869184)))) .cse5))) (or (and (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (* (- 4294967296) (div (+ c_main_~main__index1~0 .cse3 .cse2 .cse4) 4294967296)) (- 1)) 4294967296)) 1)) .cse11) (and .cse12 (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ c_main_~main__index1~0 .cse3 .cse2 .cse4 4294967296) 4294967296)) c_main_~main__index1~0 (- 1)) 4294967296)) 1)))) (let ((.cse13 (* (- 17179869184) .cse15)) (.cse14 (* 4 c_main_~main__index1~0))) (or (and (= (select .cse7 (+ .cse13 .cse14 |c_main_~#main__array~0.offset| (- 17179869184))) |c_main_#t~mem3|) .cse11) (and .cse12 (= (select .cse7 (+ .cse13 .cse14 |c_main_~#main__array~0.offset|)) |c_main_#t~mem3|)))) (let ((.cse17 (* (- 1) c_main_~main__index1~0))) (or (and (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse16 .cse17 c_main_~main__index2~0 (- 2)) 4294967296)) c_main_~main__index1~0 (- 1)) 4294967296)) 1)) .cse5) (and .cse6 (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse16 .cse17 c_main_~main__index2~0 4294967294) 4294967296)) c_main_~main__index1~0 (- 1)) 4294967296)) 1))))) (or (and .cse12 (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse16 .cse3 4294967295) 4294967296)) c_main_~main__index1~0 (- 1)) 4294967296)) 1))) (and .cse11 (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ c_main_~main__index1~0 (* (- 4294967296) (div (+ .cse16 .cse3 8589934591) 4294967296)) (- 1)) 4294967296)) c_main_~main__index2~0 1)))))))) (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ .cse16 (+ .cse4 (+ (- c_main_~main__index1~0) (+ c_main_~main__index2~0 200000)))) 8589934592)) 99998)) (<= (+ .cse0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse1 4294967294)) 4294967296)) 1) c_main_~main__index1~0) (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse3 (+ c_main_~main__index1~0 4294867295)) 4294967296)) .cse20) 4294967296)) 1))))) is different from false [2018-10-26 21:29:31,590 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse16 (div (+ c_main_~main__index2~0 4294867298) 4294967296))) (let ((.cse14 (div (+ c_main_~main__index1~0 (+ (* (- 4294967296) .cse16) (- 2))) 4294967296))) (let ((.cse0 (* (- 4294967296) .cse14)) (.cse2 (- c_main_~main__index2~0)) (.cse1 (* 4294967296 .cse16))) (and (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ (* (- 4294967296) (div (+ c_main_~main__index1~0 (+ .cse0 4294867294)) 4294967296)) (- 2))) 4294967296)) 3)) (<= (+ .cse1 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse2 4294967292)) 4294967296)) 2) c_main_~main__index1~0) (let ((.cse3 (* 8589934592 .cse16))) (or (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ (* (- 4294967296) (div (+ c_main_~main__index1~0 (+ .cse3 (+ .cse0 (+ .cse2 17179669181)))) 8589934592)) (- 2))) 4294967296)) 3)) (let ((.cse4 (div (+ c_main_~main__index1~0 (+ .cse3 (+ .cse0 (+ .cse2 8589734589)))) 8589934592)) (.cse15 (div (+ c_main_~main__index1~0 (+ .cse3 (+ .cse2 4294767293))) 4294967296))) (let ((.cse5 (* 4294967296 .cse15)) (.cse6 (+ (* 8589934592 .cse4) (* 4294967296 .cse14)))) (and (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ (* (- 4294967296) .cse4) (- 2))) 4294967296)) 3)) (or (<= (+ .cse5 1) .cse6) (let ((.cse7 (+ (* 17179869184 .cse15) (* 4 c_main_~main__index1~0))) (.cse8 (* 4 c_main_~main__index2~0)) (.cse9 (* 34359738368 .cse4)) (.cse10 (* 34359738368 .cse14))) (and (or (<= .cse7 (+ .cse8 .cse9 .cse10 3)) (let ((.cse13 (select |c_#memory_int| |c_main_~#main__array~0.base|))) (let ((.cse11 (select .cse13 (+ |c_main_~#main__array~0.offset| (* 4 (+ c_main_~main__index1~0 (+ (* 4294967296 .cse4) (* (- 4294967296) .cse15)))))))) (<= .cse11 (let ((.cse12 (select .cse13 (+ |c_main_~#main__array~0.offset| (+ (* 17179869184 .cse14) (+ (* 17179869184 .cse4) (+ (* (- 17179869184) .cse15) .cse8))))))) (+ (* 4294967296 (div (+ (- .cse12) .cse11) 4294967296)) .cse12)))))) (<= .cse7 (+ .cse8 .cse9 .cse10 4))))) (<= .cse5 .cse6)))) (<= (+ (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse2 4294967295)) 4294967296)) .cse1 2) c_main_~main__index1~0))))))) is different from false [2018-10-26 21:29:33,632 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (div (+ c_main_~main__index2~0 4294867298) 4294967296))) (let ((.cse14 (div (+ c_main_~main__index1~0 (+ (* (- 4294967296) .cse16) (- 2))) 4294967296))) (let ((.cse0 (* (- 4294967296) .cse14)) (.cse2 (- c_main_~main__index2~0)) (.cse1 (* 4294967296 .cse16))) (and (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ (* (- 4294967296) (div (+ c_main_~main__index1~0 (+ .cse0 4294867294)) 4294967296)) (- 2))) 4294967296)) 3)) (<= (+ .cse1 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse2 4294967292)) 4294967296)) 2) c_main_~main__index1~0) (let ((.cse3 (* 8589934592 .cse16))) (or (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ (* (- 4294967296) (div (+ c_main_~main__index1~0 (+ .cse3 (+ .cse0 (+ .cse2 17179669181)))) 8589934592)) (- 2))) 4294967296)) 3)) (let ((.cse4 (div (+ c_main_~main__index1~0 (+ .cse3 (+ .cse0 (+ .cse2 8589734589)))) 8589934592)) (.cse15 (div (+ c_main_~main__index1~0 (+ .cse3 (+ .cse2 4294767293))) 4294967296))) (let ((.cse5 (* 4294967296 .cse15)) (.cse6 (+ (* 8589934592 .cse4) (* 4294967296 .cse14)))) (and (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ (* (- 4294967296) .cse4) (- 2))) 4294967296)) 3)) (or (<= (+ .cse5 1) .cse6) (let ((.cse7 (+ (* 17179869184 .cse15) (* 4 c_main_~main__index1~0))) (.cse8 (* 4 c_main_~main__index2~0)) (.cse9 (* 34359738368 .cse4)) (.cse10 (* 34359738368 .cse14))) (and (or (<= .cse7 (+ .cse8 .cse9 .cse10 3)) (let ((.cse13 (select |c_#memory_int| |c_main_~#main__array~0.base|))) (let ((.cse11 (select .cse13 (+ |c_main_~#main__array~0.offset| (* 4 (+ c_main_~main__index1~0 (+ (* 4294967296 .cse4) (* (- 4294967296) .cse15)))))))) (<= .cse11 (let ((.cse12 (select .cse13 (+ |c_main_~#main__array~0.offset| (+ (* 17179869184 .cse14) (+ (* 17179869184 .cse4) (+ (* (- 17179869184) .cse15) .cse8))))))) (+ (* 4294967296 (div (+ (- .cse12) .cse11) 4294967296)) .cse12)))))) (<= .cse7 (+ .cse8 .cse9 .cse10 4))))) (<= .cse5 .cse6)))) (<= (+ (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse2 4294967295)) 4294967296)) .cse1 2) c_main_~main__index1~0))))))) is different from true [2018-10-26 21:29:33,854 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2018-10-26 21:29:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-10-26 21:29:33,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:29:33,869 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:29:33,869 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-26 21:29:33,869 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [36], [39], [42], [44], [50], [58], [62], [66], [69], [70], [91], [92], [93] [2018-10-26 21:29:33,871 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:29:33,871 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:29:33,888 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 21:29:34,372 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 21:29:34,372 INFO L272 AbstractInterpreter]: Visited 25 different actions 27 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 46 variables. [2018-10-26 21:29:34,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:29:34,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 21:29:34,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:29:34,377 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:29:34,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:29:34,384 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 21:29:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:29:34,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:29:37,186 WARN L179 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2018-10-26 21:29:47,766 WARN L179 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 40 [2018-10-26 21:29:55,955 WARN L179 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-26 21:29:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:29:56,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:29:58,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 89 [2018-10-26 21:29:58,888 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:58,897 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:58,898 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:58,899 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:58,902 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:58,910 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:58,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 126 [2018-10-26 21:29:58,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 21:29:58,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:58,982 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 21:29:58,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:58,984 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 21:29:58,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:59,010 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 21:29:59,010 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:59,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2018-10-26 21:29:59,232 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,241 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,256 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,265 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,278 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,292 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,293 INFO L303 Elim1Store]: Index analysis took 148 ms [2018-10-26 21:29:59,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 138 [2018-10-26 21:29:59,304 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-26 21:29:59,343 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:59,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2018-10-26 21:29:59,429 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,430 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,430 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,431 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,431 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,432 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,437 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 127 [2018-10-26 21:29:59,446 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:59,471 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:59,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-10-26 21:29:59,478 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,479 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,479 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,481 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,482 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,486 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 135 [2018-10-26 21:29:59,502 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-10-26 21:29:59,528 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:59,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 79 [2018-10-26 21:29:59,535 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,536 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,537 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,539 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,540 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,545 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:59,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 129 [2018-10-26 21:29:59,571 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-10-26 21:29:59,598 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:59,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:29:59,634 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:1149, output treesize:74 [2018-10-26 21:30:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:00,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:30:00,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [15, 13] total 28 [2018-10-26 21:30:00,292 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:30:00,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:30:00,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:30:00,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=348, Unknown=15, NotChecked=270, Total=756 [2018-10-26 21:30:00,293 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 8 states. [2018-10-26 21:30:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:30:00,642 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-10-26 21:30:00,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:30:00,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-10-26 21:30:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:30:00,643 INFO L225 Difference]: With dead ends: 34 [2018-10-26 21:30:00,643 INFO L226 Difference]: Without dead ends: 29 [2018-10-26 21:30:00,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 42.1s TimeCoverageRelationStatistics Valid=149, Invalid=460, Unknown=15, NotChecked=306, Total=930 [2018-10-26 21:30:00,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-26 21:30:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-26 21:30:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-26 21:30:00,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-10-26 21:30:00,651 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2018-10-26 21:30:00,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:30:00,651 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-10-26 21:30:00,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:30:00,652 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-10-26 21:30:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:30:00,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:30:00,652 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:30:00,653 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:30:00,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:30:00,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1211349645, now seen corresponding path program 1 times [2018-10-26 21:30:00,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:30:00,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:00,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:30:00,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:30:00,654 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:30:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:01,041 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-26 21:30:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:01,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:30:01,778 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:30:01,779 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-26 21:30:01,779 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [36], [39], [42], [44], [47], [48], [50], [54], [56], [91], [92], [93] [2018-10-26 21:30:01,780 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:30:01,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:30:01,798 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 21:30:02,069 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 21:30:02,069 INFO L272 AbstractInterpreter]: Visited 24 different actions 29 times. Merged at 4 different actions 4 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-26 21:30:02,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:30:02,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 21:30:02,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:30:02,071 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:30:02,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:30:02,078 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 21:30:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:30:02,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:30:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:21,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:30:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:30:25,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:30:25,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 14 [2018-10-26 21:30:25,983 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:30:25,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:30:25,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:30:25,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=125, Unknown=10, NotChecked=0, Total=182 [2018-10-26 21:30:25,984 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 12 states. [2018-10-26 21:30:49,098 WARN L179 SmtUtils]: Spent 15.04 s on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-10-26 21:31:06,236 WARN L179 SmtUtils]: Spent 12.75 s on a formula simplification. DAG size of input: 48 DAG size of output: 29 [2018-10-26 21:31:24,892 WARN L179 SmtUtils]: Spent 15.31 s on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2018-10-26 21:31:42,793 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-26 21:32:14,516 WARN L179 SmtUtils]: Spent 18.66 s on a formula simplification that was a NOOP. DAG size: 49 [2018-10-26 21:32:16,988 WARN L832 $PredicateComparison]: unable to prove that (and (<= (+ (* 4294967296 (div (+ (* 4294967296 (div (+ c_main_~main__index1~0 4294867295) 4294967296)) (+ (* (- 4294967296) (div (+ c_main_~main__index2~0 1) 4294967296)) (+ c_main_~main__index2~0 4294867297))) 4294967296)) 1) c_main_~main__index1~0) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ c_main_~main__index1~0 (- 1)) 4294967296)) 100000)) (or (<= (+ (* 4294967296 (div c_main_~main__index2~0 4294967296)) 4294967295) c_main_~main__index2~0) (<= (+ (* 4294967296 (div (+ c_main_~main__index1~0 4294867298) 4294967296)) 1) c_main_~main__index1~0)) (< (mod c_main_~main__index1~0 4294967296) (mod c_main_~main__index2~0 4294967296)) (exists ((main_~main__index2~0 Int)) (let ((.cse0 (mod main_~main__index2~0 4294967296))) (and (< (mod c_main_~main__index1~0 4294967296) .cse0) (< .cse0 100000)))) (<= (+ (* 4294967296 (div (+ c_main_~main__index1~0 4294867297) 4294967296)) 2) c_main_~main__index1~0)) is different from false [2018-10-26 21:32:28,044 WARN L179 SmtUtils]: Spent 4.12 s on a formula simplification that was a NOOP. DAG size: 21 [2018-10-26 21:32:57,673 WARN L179 SmtUtils]: Spent 16.24 s on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-10-26 21:33:04,430 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4294967296 (div c_main_~main__index2~0 4294967296)))) (and (<= (+ (* 4294967296 (div (+ (* 4294967296 (div (+ c_main_~main__index1~0 4294867295) 4294967296)) (+ (* (- 4294967296) (div (+ c_main_~main__index2~0 1) 4294967296)) (+ c_main_~main__index2~0 4294867297))) 4294967296)) 1) c_main_~main__index1~0) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ c_main_~main__index1~0 (- 1)) 4294967296)) 100000)) (or (<= (+ .cse0 4294967295) c_main_~main__index2~0) (<= (+ (* 4294967296 (div (+ c_main_~main__index1~0 4294867298) 4294967296)) 1) c_main_~main__index1~0)) (<= c_main_~main__index2~0 (+ .cse0 99999)) (< (mod c_main_~main__index1~0 4294967296) (mod c_main_~main__index2~0 4294967296)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div c_main_~main__index1~0 4294967296)) 99999)) (<= (+ (* 4294967296 (div (+ c_main_~main__index1~0 4294867297) 4294967296)) 2) c_main_~main__index1~0))) is different from false [2018-10-26 21:33:15,266 WARN L179 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 19 [2018-10-26 21:33:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:17,306 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-10-26 21:33:17,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 21:33:17,391 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-26 21:33:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:17,392 INFO L225 Difference]: With dead ends: 55 [2018-10-26 21:33:17,392 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 21:33:17,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 155.4s TimeCoverageRelationStatistics Valid=155, Invalid=384, Unknown=21, NotChecked=90, Total=650 [2018-10-26 21:33:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 21:33:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 21:33:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 21:33:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 21:33:17,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-10-26 21:33:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:17,393 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 21:33:17,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:33:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 21:33:17,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 21:33:17,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 21:33:24,353 WARN L179 SmtUtils]: Spent 6.85 s on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2018-10-26 21:33:26,593 WARN L179 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 115 DAG size of output: 53 [2018-10-26 21:33:27,744 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 137 DAG size of output: 28 [2018-10-26 21:33:53,256 WARN L179 SmtUtils]: Spent 25.49 s on a formula simplification. DAG size of input: 139 DAG size of output: 37 [2018-10-26 21:33:53,258 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:33:53,258 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-26 21:33:53,259 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:33:53,259 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:33:53,259 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 21:33:53,259 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 21:33:53,259 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:33:53,259 INFO L428 ceAbstractionStarter]: At program point L126(lines 93 127) the Hoare annotation is: true [2018-10-26 21:33:53,259 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 163) no Hoare annotation was computed. [2018-10-26 21:33:53,259 INFO L421 ceAbstractionStarter]: At program point L151(lines 21 152) the Hoare annotation is: (or (= main_~main__loop_entered~0 0) (let ((.cse5 (div main_~main__index2~0 4294967296))) (let ((.cse6 (* 4294967296 .cse5))) (let ((.cse0 (+ main_~main__index1~0 .cse6)) (.cse1 (* 4294967296 (div main_~main__index1~0 4294967296)))) (and (= main_~__VERIFIER_assert__cond~0 1) (<= .cse0 (+ .cse1 main_~main__index2~0 1)) (or (<= .cse0 (+ .cse1 main_~main__index2~0)) (let ((.cse4 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse2 (select .cse4 (+ |main_~#main__array~0.offset| (* 4 (+ (* (- 4294967296) .cse5) (+ main_~main__index2~0 1))))))) (<= .cse2 (let ((.cse3 (select .cse4 (+ |main_~#main__array~0.offset| (+ (* (- 17179869184) .cse5) (* 4 main_~main__index2~0)))))) (+ .cse3 (* 4294967296 (div (+ .cse2 (- .cse3)) 4294967296)))))))) (<= main_~main__index2~0 (+ .cse6 99998)) (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) 99999))))))) [2018-10-26 21:33:53,259 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2018-10-26 21:33:53,259 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 157) no Hoare annotation was computed. [2018-10-26 21:33:53,260 INFO L421 ceAbstractionStarter]: At program point L114(lines 94 123) the Hoare annotation is: (let ((.cse2 (= main_~__VERIFIER_assert__cond~0 1)) (.cse1 (mod main_~main__index2~0 4294967296)) (.cse0 (mod main_~main__index1~0 4294967296))) (or (and (< .cse0 .cse1) .cse2) (and (and .cse2 (< (mod (+ main_~main__index1~0 4294967295) 4294967296) (mod (+ main_~main__index2~0 1) 4294967296))) (let ((.cse5 (select |#memory_int| |main_~#main__array~0.base|)) (.cse6 (* 4 .cse0))) (let ((.cse4 (mod (select .cse5 (+ |main_~#main__array~0.offset| .cse6 (- 17179869184))) 4294967296)) (.cse7 (* 4 .cse1))) (and (or (< 2147483647 .cse1) (let ((.cse3 (mod (select .cse5 (+ |main_~#main__array~0.offset| .cse7)) 4294967296))) (and (or (<= .cse0 2147483647) (= .cse3 .cse4)) (or (< 2147483647 .cse0) (= .cse3 (mod (select .cse5 (+ |main_~#main__array~0.offset| .cse6)) 4294967296)))))) (or (<= .cse1 2147483647) (= .cse4 (mod (select .cse5 (+ |main_~#main__array~0.offset| .cse7 (- 17179869184))) 4294967296))))))))) [2018-10-26 21:33:53,260 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2018-10-26 21:33:53,260 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-10-26 21:33:53,260 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-10-26 21:33:53,260 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2018-10-26 21:33:53,260 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2018-10-26 21:33:53,260 INFO L421 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (< (mod (+ main_~main__index1~0 4294967295) 4294967296) (mod (+ main_~main__index2~0 1) 4294967296)) (<= main_~main__index2~0 (+ .cse0 99998)) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-10-26 21:33:53,261 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 162) no Hoare annotation was computed. [2018-10-26 21:33:53,261 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2018-10-26 21:33:53,261 INFO L421 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (or (and (= main_~main____CPAchecker_TMP_0~0 1) (<= main_~main__index2~0 (+ .cse0 99999)) .cse1 (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))) (and (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) .cse1 (< (mod (+ main_~main__index1~0 4294967295) 4294967296) (mod (+ main_~main__index2~0 1) 4294967296)) (<= main_~main__index2~0 (+ .cse0 99998)) (not (= 0 main_~__VERIFIER_assert__cond~1))))) [2018-10-26 21:33:53,261 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 115) no Hoare annotation was computed. [2018-10-26 21:33:53,261 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-26 21:33:53,261 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2018-10-26 21:33:53,261 INFO L421 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2018-10-26 21:33:53,261 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 152) no Hoare annotation was computed. [2018-10-26 21:33:53,261 INFO L421 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= main_~main____CPAchecker_TMP_0~0 1) (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-10-26 21:33:53,261 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 163) no Hoare annotation was computed. [2018-10-26 21:33:53,261 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 163) the Hoare annotation is: true [2018-10-26 21:33:53,261 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2018-10-26 21:33:53,262 INFO L425 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2018-10-26 21:33:53,262 INFO L421 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2018-10-26 21:33:53,262 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-10-26 21:33:53,262 INFO L425 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-10-26 21:33:53,262 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2018-10-26 21:33:53,268 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,269 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,269 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,270 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,276 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,276 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,276 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,277 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,280 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,280 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,281 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,281 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,281 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,281 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:33:53 BoogieIcfgContainer [2018-10-26 21:33:53,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:33:53,286 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:33:53,286 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:33:53,286 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:33:53,287 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:28:20" (3/4) ... [2018-10-26 21:33:53,290 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 21:33:53,295 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 21:33:53,296 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 21:33:53,300 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2018-10-26 21:33:53,301 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-10-26 21:33:53,301 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-10-26 21:33:53,353 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_29054b71-ec22-49c7-b373-41d28731e51b/bin-2019/utaipan/witness.graphml [2018-10-26 21:33:53,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:33:53,353 INFO L168 Benchmark]: Toolchain (without parser) took 333795.20 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 760.2 MB). Free memory was 959.8 MB in the beginning and 1.6 GB in the end (delta: -598.2 MB). Peak memory consumption was 162.0 MB. Max. memory is 11.5 GB. [2018-10-26 21:33:53,354 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:33:53,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.45 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 947.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-10-26 21:33:53,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.92 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:33:53,355 INFO L168 Benchmark]: Boogie Preprocessor took 23.77 ms. Allocated memory is still 1.0 GB. Free memory was 945.1 MB in the beginning and 942.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:33:53,355 INFO L168 Benchmark]: RCFGBuilder took 663.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-10-26 21:33:53,355 INFO L168 Benchmark]: TraceAbstraction took 332743.07 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 606.6 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -449.3 MB). Peak memory consumption was 157.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:33:53,358 INFO L168 Benchmark]: Witness Printer took 66.95 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-10-26 21:33:53,360 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.45 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 947.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.92 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.77 ms. Allocated memory is still 1.0 GB. Free memory was 945.1 MB in the beginning and 942.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 663.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 332743.07 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 606.6 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -449.3 MB). Peak memory consumption was 157.3 MB. Max. memory is 11.5 GB. * Witness Printer took 66.95 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant [2018-10-26 21:33:53,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,369 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,369 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: main__loop_entered == 0 || ((((__VERIFIER_assert__cond == 1 && main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2 + 1) && (main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2 || unknown-#memory_int-unknown[main__array][main__array + 4 * (-4294967296 * (main__index2 / 4294967296) + (main__index2 + 1))] <= unknown-#memory_int-unknown[main__array][main__array + (-17179869184 * (main__index2 / 4294967296) + 4 * main__index2)] + 4294967296 * ((unknown-#memory_int-unknown[main__array][main__array + 4 * (-4294967296 * (main__index2 / 4294967296) + (main__index2 + 1))] + -unknown-#memory_int-unknown[main__array][main__array + (-17179869184 * (main__index2 / 4294967296) + 4 * main__index2)]) / 4294967296))) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99998) && main__index1 <= 4294967296 * ((main__index1 + -1) / 4294967296) + 99999) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 94]: Loop Invariant [2018-10-26 21:33:53,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:33:53,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (main__index1 % 4294967296 < main__index2 % 4294967296 && __VERIFIER_assert__cond == 1) || ((__VERIFIER_assert__cond == 1 && (main__index1 + 4294967295) % 4294967296 < (main__index2 + 1) % 4294967296) && (2147483647 < main__index2 % 4294967296 || ((main__index1 % 4294967296 <= 2147483647 || unknown-#memory_int-unknown[main__array][main__array + 4 * (main__index2 % 4294967296)] % 4294967296 == unknown-#memory_int-unknown[main__array][main__array + 4 * (main__index1 % 4294967296) + -17179869184] % 4294967296) && (2147483647 < main__index1 % 4294967296 || unknown-#memory_int-unknown[main__array][main__array + 4 * (main__index2 % 4294967296)] % 4294967296 == unknown-#memory_int-unknown[main__array][main__array + 4 * (main__index1 % 4294967296)] % 4294967296))) && (main__index2 % 4294967296 <= 2147483647 || unknown-#memory_int-unknown[main__array][main__array + 4 * (main__index1 % 4294967296) + -17179869184] % 4294967296 == unknown-#memory_int-unknown[main__array][main__array + 4 * (main__index2 % 4294967296) + -17179869184] % 4294967296)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((__VERIFIER_assert__cond == 1 && !(0 == main____CPAchecker_TMP_0)) && (main__index1 + 4294967295) % 4294967296 < (main__index2 + 1) % 4294967296) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99998) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((main____CPAchecker_TMP_0 == 1 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((main____CPAchecker_TMP_0 == 1 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || ((((main__index1 % 4294967296 < main__index2 % 4294967296 && __VERIFIER_assert__cond == 1) && (main__index1 + 4294967295) % 4294967296 < (main__index2 + 1) % 4294967296) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99998) && !(0 == __VERIFIER_assert__cond)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 3 error locations. SAFE Result, 332.6s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 205.5s AutomataDifference, 0.0s DeadEndRemovalTime, 35.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 294 SDtfs, 452 SDslu, 506 SDs, 0 SdLazy, 389 SolverSat, 52 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 62.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 144 SyntacticMatches, 19 SemanticMatches, 104 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 225.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.3s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 116 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 31 NumberOfFragments, 422 HoareAnnotationTreeSize, 12 FomulaSimplifications, 3205 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 4173 FormulaSimplificationTreeSizeReductionInter, 35.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 86.5s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 354 ConstructedInterpolants, 6 QuantifiedInterpolants, 172070 SizeOfPredicates, 25 NumberOfNonLiveVariables, 469 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 19/33 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...