./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label45_true-unreach-call.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_270be4ae-ed4c-4f49-bc4c-b62356649a76/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label45_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/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 70545f5392ebc5e90051a936a28b8141bae29fb0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:57:52,891 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:57:52,892 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:57:52,898 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:57:52,898 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:57:52,899 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:57:52,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:57:52,901 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:57:52,902 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:57:52,902 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:57:52,903 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:57:52,903 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:57:52,904 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:57:52,904 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:57:52,905 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:57:52,905 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:57:52,906 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:57:52,907 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:57:52,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:57:52,909 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:57:52,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:57:52,911 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:57:52,913 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:57:52,913 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:57:52,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:57:52,914 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:57:52,914 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:57:52,915 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:57:52,915 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:57:52,916 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:57:52,916 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:57:52,916 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:57:52,916 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:57:52,916 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:57:52,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:57:52,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:57:52,917 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 09:57:52,927 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:57:52,927 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:57:52,928 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:57:52,928 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 09:57:52,928 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 09:57:52,928 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 09:57:52,929 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 09:57:52,929 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 09:57:52,929 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 09:57:52,929 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 09:57:52,929 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 09:57:52,930 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:57:52,930 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:57:52,930 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:57:52,930 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:57:52,930 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:57:52,930 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:57:52,930 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:57:52,930 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:57:52,931 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:57:52,931 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:57:52,931 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:57:52,931 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:57:52,931 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:57:52,931 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:57:52,931 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 09:57:52,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:57:52,932 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:57:52,932 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:57:52,932 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:57:52,932 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 09:57:52,932 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:57:52,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:57:52,932 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 09:57:52,932 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_270be4ae-ed4c-4f49-bc4c-b62356649a76/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 -> 70545f5392ebc5e90051a936a28b8141bae29fb0 [2018-11-10 09:57:52,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:57:52,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:57:52,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:57:52,968 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:57:52,969 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:57:52,969 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label45_true-unreach-call.c [2018-11-10 09:57:53,011 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/bin-2019/utaipan/data/4d51c029a/b27903a41f854bb8b41bdcb59049788f/FLAG6a7ddeb9d [2018-11-10 09:57:53,475 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:57:53,476 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/sv-benchmarks/c/eca-rers2012/Problem10_label45_true-unreach-call.c [2018-11-10 09:57:53,486 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/bin-2019/utaipan/data/4d51c029a/b27903a41f854bb8b41bdcb59049788f/FLAG6a7ddeb9d [2018-11-10 09:57:53,497 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/bin-2019/utaipan/data/4d51c029a/b27903a41f854bb8b41bdcb59049788f [2018-11-10 09:57:53,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:57:53,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:57:53,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:57:53,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:57:53,504 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:57:53,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:57:53" (1/1) ... [2018-11-10 09:57:53,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372d3e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:53, skipping insertion in model container [2018-11-10 09:57:53,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:57:53" (1/1) ... [2018-11-10 09:57:53,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:57:53,546 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:57:53,780 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:57:53,783 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:57:53,852 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:57:53,862 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:57:53,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:53 WrapperNode [2018-11-10 09:57:53,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:57:53,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:57:53,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:57:53,863 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:57:53,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:53" (1/1) ... [2018-11-10 09:57:53,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:53" (1/1) ... [2018-11-10 09:57:53,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:57:53,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:57:53,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:57:53,980 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:57:53,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:53" (1/1) ... [2018-11-10 09:57:53,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:53" (1/1) ... [2018-11-10 09:57:53,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:53" (1/1) ... [2018-11-10 09:57:53,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:53" (1/1) ... [2018-11-10 09:57:54,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:53" (1/1) ... [2018-11-10 09:57:54,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:53" (1/1) ... [2018-11-10 09:57:54,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:53" (1/1) ... [2018-11-10 09:57:54,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:57:54,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:57:54,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:57:54,031 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:57:54,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:57:54,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 09:57:54,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 09:57:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 09:57:54,074 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 09:57:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:57:54,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:57:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 09:57:54,074 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 09:57:55,097 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:57:55,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:57:55 BoogieIcfgContainer [2018-11-10 09:57:55,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:57:55,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 09:57:55,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 09:57:55,101 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 09:57:55,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:57:53" (1/3) ... [2018-11-10 09:57:55,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45738f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:57:55, skipping insertion in model container [2018-11-10 09:57:55,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:53" (2/3) ... [2018-11-10 09:57:55,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45738f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:57:55, skipping insertion in model container [2018-11-10 09:57:55,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:57:55" (3/3) ... [2018-11-10 09:57:55,103 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label45_true-unreach-call.c [2018-11-10 09:57:55,110 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 09:57:55,115 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 09:57:55,125 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 09:57:55,150 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 09:57:55,150 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 09:57:55,150 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 09:57:55,150 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:57:55,150 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:57:55,150 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 09:57:55,150 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:57:55,150 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 09:57:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-10 09:57:55,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 09:57:55,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:57:55,175 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:57:55,176 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:57:55,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:57:55,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2078467607, now seen corresponding path program 1 times [2018-11-10 09:57:55,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:57:55,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:55,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:57:55,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:55,213 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:57:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:57:55,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:57:55,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:57:55,409 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:57:55,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:57:55,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:57:55,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:57:55,429 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-10 09:57:56,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:57:56,089 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-10 09:57:56,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:57:56,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-10 09:57:56,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:57:56,100 INFO L225 Difference]: With dead ends: 574 [2018-11-10 09:57:56,100 INFO L226 Difference]: Without dead ends: 356 [2018-11-10 09:57:56,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:57:56,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-10 09:57:56,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-10 09:57:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-10 09:57:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 592 transitions. [2018-11-10 09:57:56,160 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 592 transitions. Word has length 45 [2018-11-10 09:57:56,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:57:56,160 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 592 transitions. [2018-11-10 09:57:56,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:57:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 592 transitions. [2018-11-10 09:57:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 09:57:56,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:57:56,165 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:57:56,166 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:57:56,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:57:56,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2123203616, now seen corresponding path program 1 times [2018-11-10 09:57:56,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:57:56,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:56,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:57:56,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:56,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:57:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:57:56,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:57:56,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 09:57:56,330 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:57:56,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 09:57:56,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:57:56,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:57:56,332 INFO L87 Difference]: Start difference. First operand 356 states and 592 transitions. Second operand 6 states. [2018-11-10 09:57:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:57:57,122 INFO L93 Difference]: Finished difference Result 1002 states and 1689 transitions. [2018-11-10 09:57:57,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:57:57,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2018-11-10 09:57:57,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:57:57,127 INFO L225 Difference]: With dead ends: 1002 [2018-11-10 09:57:57,127 INFO L226 Difference]: Without dead ends: 652 [2018-11-10 09:57:57,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:57:57,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-11-10 09:57:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 640. [2018-11-10 09:57:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-10 09:57:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 960 transitions. [2018-11-10 09:57:57,157 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 960 transitions. Word has length 115 [2018-11-10 09:57:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:57:57,158 INFO L481 AbstractCegarLoop]: Abstraction has 640 states and 960 transitions. [2018-11-10 09:57:57,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 09:57:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 960 transitions. [2018-11-10 09:57:57,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 09:57:57,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:57:57,161 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:57:57,161 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:57:57,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:57:57,161 INFO L82 PathProgramCache]: Analyzing trace with hash -597678124, now seen corresponding path program 1 times [2018-11-10 09:57:57,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:57:57,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:57,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:57:57,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:57,163 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:57:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:57:57,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:57:57,382 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:57:57,382 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2018-11-10 09:57:57,383 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [261], [263], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:57:57,427 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:57:57,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:57:58,882 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:58:06,405 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:58:06,406 INFO L272 AbstractInterpreter]: Visited 88 different actions 497 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 09:58:06,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:58:06,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:58:06,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:58:06,415 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:58:06,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:58:06,425 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:58:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:06,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:58:08,601 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-10 09:58:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:58:08,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:58:08,844 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:08,873 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:08,903 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:08,931 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:08,962 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:08,993 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,024 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,052 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,089 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,126 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,167 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,196 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,222 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,268 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,317 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,362 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,401 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,437 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,474 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,552 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,585 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,617 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,642 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,708 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,742 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,770 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,797 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,824 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,851 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,878 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,910 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,938 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:09,974 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,005 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,033 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,060 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,083 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,126 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,160 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,190 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,224 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,248 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,272 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,298 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,345 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,385 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,424 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,461 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,496 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,531 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,580 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,612 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,643 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,714 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,757 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,794 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,826 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,890 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,927 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:10,977 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:11,016 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:11,054 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:11,090 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:11,117 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:11,142 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:11,169 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:11,196 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:11,223 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:11,247 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:11,271 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:11,294 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:11,318 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:58:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:58:11,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:58:11,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2018-11-10 09:58:11,426 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:58:11,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 09:58:11,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:58:11,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:58:11,427 INFO L87 Difference]: Start difference. First operand 640 states and 960 transitions. Second operand 6 states. [2018-11-10 09:58:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:58:19,500 INFO L93 Difference]: Finished difference Result 2276 states and 3519 transitions. [2018-11-10 09:58:19,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 09:58:19,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-11-10 09:58:19,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:58:19,510 INFO L225 Difference]: With dead ends: 2276 [2018-11-10 09:58:19,510 INFO L226 Difference]: Without dead ends: 1642 [2018-11-10 09:58:19,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 174 SyntacticMatches, 73 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:58:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2018-11-10 09:58:19,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1632. [2018-11-10 09:58:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1632 states. [2018-11-10 09:58:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2326 transitions. [2018-11-10 09:58:19,549 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2326 transitions. Word has length 125 [2018-11-10 09:58:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:58:19,550 INFO L481 AbstractCegarLoop]: Abstraction has 1632 states and 2326 transitions. [2018-11-10 09:58:19,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 09:58:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2326 transitions. [2018-11-10 09:58:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 09:58:19,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:58:19,555 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:58:19,556 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:58:19,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:58:19,556 INFO L82 PathProgramCache]: Analyzing trace with hash 786349999, now seen corresponding path program 1 times [2018-11-10 09:58:19,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:58:19,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:58:19,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:58:19,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:58:19,557 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:58:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:58:19,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:58:19,670 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:58:19,670 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-11-10 09:58:19,671 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [261], [263], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [730], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:58:19,677 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:58:19,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:58:20,935 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 09:58:20,935 INFO L272 AbstractInterpreter]: Visited 133 different actions 133 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-10 09:58:20,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:58:20,946 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 09:58:21,671 INFO L227 lantSequenceWeakener]: Weakened 169 states. On average, predicates are now at 73.45% of their original sizes. [2018-11-10 09:58:21,672 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 09:58:21,795 INFO L415 sIntCurrentIteration]: We unified 173 AI predicates to 173 [2018-11-10 09:58:21,795 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 09:58:21,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 09:58:21,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2018-11-10 09:58:21,796 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:58:21,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 09:58:21,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:58:21,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:58:21,797 INFO L87 Difference]: Start difference. First operand 1632 states and 2326 transitions. Second operand 7 states. [2018-11-10 09:58:22,276 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:58:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:58:32,310 INFO L93 Difference]: Finished difference Result 3404 states and 4880 transitions. [2018-11-10 09:58:32,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:58:32,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2018-11-10 09:58:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:58:32,315 INFO L225 Difference]: With dead ends: 3404 [2018-11-10 09:58:32,316 INFO L226 Difference]: Without dead ends: 1778 [2018-11-10 09:58:32,319 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:58:32,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2018-11-10 09:58:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1776. [2018-11-10 09:58:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-11-10 09:58:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2479 transitions. [2018-11-10 09:58:32,349 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2479 transitions. Word has length 174 [2018-11-10 09:58:32,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:58:32,349 INFO L481 AbstractCegarLoop]: Abstraction has 1776 states and 2479 transitions. [2018-11-10 09:58:32,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 09:58:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2479 transitions. [2018-11-10 09:58:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 09:58:32,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:58:32,352 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:58:32,352 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:58:32,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:58:32,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1611504344, now seen corresponding path program 1 times [2018-11-10 09:58:32,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:58:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:58:32,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:58:32,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:58:32,354 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:58:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:58:32,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:58:32,456 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:58:32,456 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-11-10 09:58:32,457 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [261], [263], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [766], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:58:32,460 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:58:32,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:58:34,815 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:58:41,095 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 09:58:41,095 INFO L272 AbstractInterpreter]: Visited 145 different actions 422 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 09:58:41,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:58:41,098 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 09:58:42,726 INFO L227 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 77.62% of their original sizes. [2018-11-10 09:58:42,726 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 09:59:04,769 INFO L415 sIntCurrentIteration]: We unified 182 AI predicates to 182 [2018-11-10 09:59:04,769 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 09:59:04,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 09:59:04,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [4] total 19 [2018-11-10 09:59:04,770 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:59:04,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 09:59:04,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 09:59:04,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-11-10 09:59:04,770 INFO L87 Difference]: Start difference. First operand 1776 states and 2479 transitions. Second operand 17 states. [2018-11-10 10:00:03,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:00:03,150 INFO L93 Difference]: Finished difference Result 3705 states and 5369 transitions. [2018-11-10 10:00:03,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 10:00:03,150 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 183 [2018-11-10 10:00:03,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:00:03,157 INFO L225 Difference]: With dead ends: 3705 [2018-11-10 10:00:03,157 INFO L226 Difference]: Without dead ends: 2079 [2018-11-10 10:00:03,161 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 189 GetRequests, 124 SyntacticMatches, 43 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2018-11-10 10:00:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2018-11-10 10:00:03,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 2072. [2018-11-10 10:00:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-11-10 10:00:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2814 transitions. [2018-11-10 10:00:03,238 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2814 transitions. Word has length 183 [2018-11-10 10:00:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:00:03,239 INFO L481 AbstractCegarLoop]: Abstraction has 2072 states and 2814 transitions. [2018-11-10 10:00:03,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 10:00:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2814 transitions. [2018-11-10 10:00:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 10:00:03,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:00:03,242 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:03,242 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:00:03,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:03,243 INFO L82 PathProgramCache]: Analyzing trace with hash -302493013, now seen corresponding path program 1 times [2018-11-10 10:00:03,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:00:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:03,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:03,244 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:00:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 154 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:03,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:00:03,481 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:00:03,481 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-10 10:00:03,481 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [261], [263], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [558], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 10:00:03,484 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:00:03,484 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:00:04,479 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 10:00:11,957 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:00:11,957 INFO L272 AbstractInterpreter]: Visited 95 different actions 539 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 10:00:11,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:11,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:00:11,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:00:11,966 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:00:11,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:11,972 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:00:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:12,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:00:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 154 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:12,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:00:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 154 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:12,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:00:12,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 15 [2018-11-10 10:00:12,149 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:00:12,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:00:12,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:00:12,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:00:12,150 INFO L87 Difference]: Start difference. First operand 2072 states and 2814 transitions. Second operand 14 states. [2018-11-10 10:00:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:00:14,639 INFO L93 Difference]: Finished difference Result 6692 states and 10199 transitions. [2018-11-10 10:00:14,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 10:00:14,639 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 211 [2018-11-10 10:00:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:00:14,651 INFO L225 Difference]: With dead ends: 6692 [2018-11-10 10:00:14,651 INFO L226 Difference]: Without dead ends: 2591 [2018-11-10 10:00:14,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 431 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=335, Invalid=925, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 10:00:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2018-11-10 10:00:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2367. [2018-11-10 10:00:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2018-11-10 10:00:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2869 transitions. [2018-11-10 10:00:14,806 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2869 transitions. Word has length 211 [2018-11-10 10:00:14,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:00:14,806 INFO L481 AbstractCegarLoop]: Abstraction has 2367 states and 2869 transitions. [2018-11-10 10:00:14,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:00:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2869 transitions. [2018-11-10 10:00:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-10 10:00:14,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:00:14,810 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:14,810 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:00:14,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:14,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1957137347, now seen corresponding path program 1 times [2018-11-10 10:00:14,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:00:14,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:14,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:14,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:14,812 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:00:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-10 10:00:14,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:00:14,920 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:00:14,920 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 246 with the following transitions: [2018-11-10 10:00:14,921 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [261], [263], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [730], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 10:00:14,924 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:00:14,924 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:00:15,682 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 10:00:21,430 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 10:00:21,430 INFO L272 AbstractInterpreter]: Visited 137 different actions 398 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 10:00:21,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:21,454 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 10:00:22,606 INFO L227 lantSequenceWeakener]: Weakened 78 states. On average, predicates are now at 75.15% of their original sizes. [2018-11-10 10:00:22,606 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 10:00:31,674 INFO L415 sIntCurrentIteration]: We unified 244 AI predicates to 244 [2018-11-10 10:00:31,675 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 10:00:31,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:00:31,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [4] total 22 [2018-11-10 10:00:31,675 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:00:31,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 10:00:31,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 10:00:31,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-10 10:00:31,675 INFO L87 Difference]: Start difference. First operand 2367 states and 2869 transitions. Second operand 20 states. [2018-11-10 10:02:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:02:21,464 INFO L93 Difference]: Finished difference Result 4982 states and 6191 transitions. [2018-11-10 10:02:21,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 10:02:21,464 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 245 [2018-11-10 10:02:21,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:02:21,472 INFO L225 Difference]: With dead ends: 4982 [2018-11-10 10:02:21,472 INFO L226 Difference]: Without dead ends: 3057 [2018-11-10 10:02:21,475 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 263 GetRequests, 213 SyntacticMatches, 13 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=271, Invalid=1211, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 10:02:21,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2018-11-10 10:02:21,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2692. [2018-11-10 10:02:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2692 states. [2018-11-10 10:02:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 3239 transitions. [2018-11-10 10:02:21,670 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 3239 transitions. Word has length 245 [2018-11-10 10:02:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:02:21,670 INFO L481 AbstractCegarLoop]: Abstraction has 2692 states and 3239 transitions. [2018-11-10 10:02:21,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 10:02:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 3239 transitions. [2018-11-10 10:02:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-10 10:02:21,675 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:02:21,675 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:02:21,675 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:02:21,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:02:21,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1462292403, now seen corresponding path program 1 times [2018-11-10 10:02:21,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:02:21,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:02:21,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:02:21,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:02:21,677 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:02:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-10 10:02:21,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:02:21,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:02:21,801 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:02:21,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:02:21,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:02:21,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:02:21,802 INFO L87 Difference]: Start difference. First operand 2692 states and 3239 transitions. Second operand 4 states. [2018-11-10 10:02:22,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:02:22,341 INFO L93 Difference]: Finished difference Result 5060 states and 6270 transitions. [2018-11-10 10:02:22,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:02:22,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2018-11-10 10:02:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:02:22,347 INFO L225 Difference]: With dead ends: 5060 [2018-11-10 10:02:22,347 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 10:02:22,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:02:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 10:02:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 10:02:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 10:02:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 10:02:22,353 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 247 [2018-11-10 10:02:22,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:02:22,353 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:02:22,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:02:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:02:22,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 10:02:22,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 10:02:23,661 WARN L179 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 1190 [2018-11-10 10:02:30,959 WARN L179 SmtUtils]: Spent 7.29 s on a formula simplification. DAG size of input: 1829 DAG size of output: 1823 [2018-11-10 10:02:33,374 WARN L179 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 1444 DAG size of output: 1438 [2018-11-10 10:02:40,100 WARN L179 SmtUtils]: Spent 6.71 s on a formula simplification. DAG size of input: 1829 DAG size of output: 1823 [2018-11-10 10:02:41,148 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 1448 DAG size of output: 1441 [2018-11-10 10:02:41,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:02:42,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:02:42,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:02:46,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:02:49,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:02:49,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:02:49,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:02:49,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:02:49,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:02:50,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:02:50,975 WARN L179 SmtUtils]: Spent 9.78 s on a formula simplification. DAG size of input: 2431 DAG size of output: 2179 [2018-11-10 10:02:53,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:02:53,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:03:00,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:03:00,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:03:01,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:03:01,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:03:01,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:03:01,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:03:02,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:03:02,427 WARN L179 SmtUtils]: Spent 11.45 s on a formula simplification. DAG size of input: 2420 DAG size of output: 2355 [2018-11-10 10:03:03,018 WARN L179 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 368 DAG size of output: 44 [2018-11-10 10:03:13,832 WARN L179 SmtUtils]: Spent 10.81 s on a formula simplification. DAG size of input: 928 DAG size of output: 73 [2018-11-10 10:03:56,250 WARN L179 SmtUtils]: Spent 42.37 s on a formula simplification. DAG size of input: 1847 DAG size of output: 215 [2018-11-10 10:04:08,106 WARN L179 SmtUtils]: Spent 11.80 s on a formula simplification. DAG size of input: 1717 DAG size of output: 83 [2018-11-10 10:04:24,055 WARN L179 SmtUtils]: Spent 15.94 s on a formula simplification. DAG size of input: 1839 DAG size of output: 83 [2018-11-10 10:04:24,056 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 10:04:24,056 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (let ((.cse0 (forall ((v_~a1~0_BEFORE_CALL_5 Int)) (or (< |old(~a1~0)| v_~a1~0_BEFORE_CALL_5) (exists ((v_~a1~0_352 Int)) (and (<= (+ (div v_~a1~0_352 5) 331283) 0) (<= v_~a1~0_BEFORE_CALL_5 v_~a1~0_352) (= 0 (mod v_~a1~0_352 5))))))) (.cse1 (div ~a1~0 5))) (and (or .cse0 (< 0 (+ .cse1 331283)) (not (= (mod ~a1~0 5) 0))) (or .cse0 (< 0 (+ .cse1 331284))) (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0))) [2018-11-10 10:04:24,056 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,057 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-10 10:04:24,058 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 118) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-10 10:04:24,059 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-10 10:04:24,060 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-10 10:04:24,060 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-10 10:04:24,060 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-10 10:04:24,060 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-10 10:04:24,060 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-10 10:04:24,060 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-10 10:04:24,060 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-10 10:04:24,060 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-10 10:04:24,060 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-10 10:04:24,060 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,060 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,060 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,061 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,061 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,061 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-10 10:04:24,061 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-10 10:04:24,061 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-10 10:04:24,061 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-10 10:04:24,061 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-10 10:04:24,061 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-10 10:04:24,061 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-10 10:04:24,061 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-10 10:04:24,061 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-10 10:04:24,061 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,061 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,062 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,062 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,062 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,062 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,062 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,062 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-10 10:04:24,062 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-10 10:04:24,062 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-10 10:04:24,062 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-10 10:04:24,062 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-10 10:04:24,062 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-10 10:04:24,062 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-10 10:04:24,062 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-10 10:04:24,062 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-10 10:04:24,063 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-10 10:04:24,063 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-10 10:04:24,063 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-10 10:04:24,063 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-10 10:04:24,063 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,063 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,063 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,063 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,063 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-10 10:04:24,063 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,063 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,063 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-10 10:04:24,063 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-10 10:04:24,064 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-10 10:04:24,064 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-10 10:04:24,064 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-10 10:04:24,064 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-10 10:04:24,064 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-10 10:04:24,064 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-10 10:04:24,064 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 10:04:24,064 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-10 10:04:24,064 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-10 10:04:24,064 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-10 10:04:24,064 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-10 10:04:24,064 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,064 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,065 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,065 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,065 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,065 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,065 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-10 10:04:24,065 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-10 10:04:24,065 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-10 10:04:24,065 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-10 10:04:24,065 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-10 10:04:24,065 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-10 10:04:24,065 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-10 10:04:24,065 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-10 10:04:24,065 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-10 10:04:24,065 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-10 10:04:24,066 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-10 10:04:24,066 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse13 (not (= 14 ~a4~0))) (.cse14 (not (= 0 ~a12~0)))) (let ((.cse16 (and (<= ~a1~0 |old(~a1~0)|) (<= |old(~a1~0)| ~a1~0))) (.cse0 (< (+ |old(~a10~0)| 197) |old(~a1~0)|)) (.cse1 (< |old(~a1~0)| (+ |old(~a10~0)| 23))) (.cse19 (< 10 (* 2 ~inputE~0))) (.cse20 (< 10 (+ ~inputD~0 ~inputF~0))) (.cse21 (< ~inputF~0 (+ ~a12~0 6))) (.cse22 (< (+ |old(~a19~0)| ~inputE~0) 14)) (.cse3 (< 15 (+ ~a4~0 |old(~a10~0)|))) (.cse23 (< (+ |old(~a19~0)| ~inputC~0) 12)) (.cse24 (< (+ ~a12~0 ~inputB~0) 2)) (.cse4 (< (+ |calculate_output_#in~input| 6) |old(~a19~0)|)) (.cse25 (< 11 (+ |old(~a19~0)| ~inputB~0))) (.cse26 (< 28 (* 2 ~a4~0))) (.cse27 (< (+ ~a4~0 ~inputD~0) 18)) (.cse28 (< 5 (+ ~inputB~0 ~inputC~0))) (.cse17 (< 23 (+ |old(~a1~0)| |old(~a10~0)|))) (.cse2 (not (= 9 |old(~a19~0)|))) (.cse18 (+ ~a12~0 |old(~a10~0)|)) (.cse6 (< ~a4~0 (+ |calculate_output_#in~input| 8))) (.cse10 (< (+ |calculate_output_#in~input| ~a12~0) 2)) (.cse31 (or .cse13 .cse14 (= 1 |old(~a10~0)|))) (.cse8 (< (* 2 |old(~a10~0)|) 0)) (.cse15 (<= |old(~a1~0)| 218)) (.cse11 (= ~a19~0 |old(~a19~0)|)) (.cse12 (= |old(~a10~0)| ~a10~0))) (and (or (and (<= (+ ~a10~0 23) ~a1~0) (<= ~a1~0 (+ ~a10~0 197))) (let ((.cse5 (< 9 (+ |old(~a19~0)| ~a12~0))) (.cse7 (< (+ ~a4~0 ~a12~0) 14)) (.cse9 (< 23 (+ |old(~a19~0)| ~a4~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 (< 18 (+ |calculate_output_#in~input| ~a4~0)) .cse5 .cse10 .cse7 .cse8 .cse9)))) (or (and .cse11 .cse12) .cse13 .cse14 .cse15) (or .cse16 (and (or .cse17 (< (+ |old(~a1~0)| |old(~a10~0)| 45479) 0) (= 0 |old(~a1~0)|)) (or (< .cse18 2) (< 0 (+ |old(~a1~0)| |old(~a10~0)| 45478)))) (not (= 0 (mod |old(~a10~0)| 2))) .cse19 .cse20 .cse21 .cse22 .cse23 (< 4 (+ ~inputB~0 |old(~a10~0)|)) .cse24 .cse25 .cse26 .cse27 .cse6 .cse10 (< (+ |old(~a1~0)| 45494) ~inputE~0) .cse28 .cse8) (or (let ((.cse29 (forall ((v_~a1~0_BEFORE_CALL_5 Int)) (or (< |old(~a1~0)| v_~a1~0_BEFORE_CALL_5) (exists ((v_~a1~0_352 Int)) (and (<= (+ (div v_~a1~0_352 5) 331283) 0) (<= v_~a1~0_BEFORE_CALL_5 v_~a1~0_352) (= 0 (mod v_~a1~0_352 5))))))) (.cse30 (div ~a1~0 5))) (and (or .cse29 (< 0 (+ .cse30 331283)) (not (= (mod ~a1~0 5) 0))) (or .cse29 (< 0 (+ .cse30 331284))) .cse11 .cse12)) .cse31) (or .cse16 (and (or .cse0 .cse1 .cse19 .cse20 .cse21 .cse22 .cse3 .cse23 .cse24 .cse25 .cse26 .cse27 .cse10 .cse28 .cse8 (< 7 (+ |calculate_output_#in~input| ~inputC~0))) (or .cse0 .cse1 .cse19 .cse20 .cse21 .cse22 .cse3 .cse23 .cse24 .cse4 .cse25 .cse26 .cse27 .cse6 .cse28 .cse8))) (or (or .cse17 .cse2 (< 2 .cse18) .cse6 .cse10 .cse31 .cse8 (< (+ |old(~a1~0)| |old(~a10~0)| 45487) 0)) (and (<= (+ ~a1~0 ~a10~0) 23) (<= 0 (+ ~a1~0 ~a10~0 45487)))) (or (< 218 ~a1~0) .cse13 .cse14 .cse15) (or (and (forall ((v_~a1~0_352 Int)) (or (not (= 0 (mod v_~a1~0_352 5))) (< v_~a1~0_352 ~a1~0) (< 0 (+ (div v_~a1~0_352 5) 331283)))) .cse11 .cse12) (or (exists ((v_~a1~0_352 Int)) (and (<= |old(~a1~0)| v_~a1~0_352) (<= (+ (div v_~a1~0_352 5) 331283) 0) (= 0 (mod v_~a1~0_352 5)))) .cse13 .cse14) (= 8 |old(~a19~0)|))))) [2018-11-10 10:04:24,066 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-10 10:04:24,066 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-10 10:04:24,066 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-10 10:04:24,067 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,067 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,067 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,067 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,067 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,067 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,067 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-10 10:04:24,067 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-10 10:04:24,067 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-10 10:04:24,067 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-10 10:04:24,067 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-10 10:04:24,067 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-10 10:04:24,067 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-10 10:04:24,067 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-10 10:04:24,068 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-10 10:04:24,068 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-10 10:04:24,068 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-10 10:04:24,068 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-10 10:04:24,068 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-10 10:04:24,068 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,068 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,068 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,068 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,068 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,068 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,068 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-10 10:04:24,068 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-10 10:04:24,068 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-10 10:04:24,069 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-10 10:04:24,069 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-10 10:04:24,069 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-10 10:04:24,069 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-10 10:04:24,069 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-10 10:04:24,069 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-10 10:04:24,069 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-10 10:04:24,069 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-10 10:04:24,069 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-10 10:04:24,069 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,069 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,069 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,069 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,069 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,070 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 10:04:24,070 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-10 10:04:24,070 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-10 10:04:24,070 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-10 10:04:24,070 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-10 10:04:24,070 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-10 10:04:24,070 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-10 10:04:24,070 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-10 10:04:24,070 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-10 10:04:24,070 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 10:04:24,070 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-10 10:04:24,070 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-10 10:04:24,070 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-10 10:04:24,070 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:04:24,071 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~a10~0 14) ~a4~0) (<= (+ ~inputC~0 6) ~a19~0) (<= (+ ~inputB~0 2) ~inputD~0) (<= (+ ~a19~0 ~inputD~0) 13) (<= (+ ~inputF~0 17) ~a1~0) (<= 5 (+ ~a12~0 ~inputE~0)) (<= 2 (+ ~a10~0 ~inputB~0)) (<= (+ ~a12~0 5) ~inputE~0) (<= ~a4~0 (+ ~inputF~0 8)) (<= (+ ~a1~0 ~inputE~0) 28) (<= 6 (+ ~a10~0 ~inputF~0)) (<= (+ ~a10~0 3) ~inputC~0)) [2018-11-10 10:04:24,071 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 10:04:24,071 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 10:04:24,071 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (and (<= (+ ~a12~0 ~a10~0) 0) (<= 9 (+ ~a19~0 ~a10~0)) (= ~a1~0 23) (<= (+ ~a19~0 5) ~a4~0)) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (< (* 2 |old(~a10~0)|) 0)) [2018-11-10 10:04:24,071 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-10 10:04:24,071 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (or (not (= ~a10~0 1)) (< 218 ~a1~0) (and (forall ((v_~a1~0_352 Int)) (or (not (= 0 (mod v_~a1~0_352 5))) (< v_~a1~0_352 ~a1~0) (< 0 (+ (div v_~a1~0_352 5) 331283)))) (not (= 8 ~a19~0))) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (< (* 2 |old(~a10~0)|) 0)) [2018-11-10 10:04:24,071 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-10 10:04:24,071 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-10 10:04:24,071 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-10 10:04:24,072 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (or (not (= ~a10~0 1)) (< 218 ~a1~0) (and (forall ((v_~a1~0_352 Int)) (or (not (= 0 (mod v_~a1~0_352 5))) (< v_~a1~0_352 ~a1~0) (< 0 (+ (div v_~a1~0_352 5) 331283)))) (not (= 8 ~a19~0))) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (< (* 2 |old(~a10~0)|) 0)) [2018-11-10 10:04:24,072 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-10 10:04:24,076 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2018-11-10 10:04:24,077 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2018-11-10 10:04:24,077 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2018-11-10 10:04:24,081 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2018-11-10 10:04:24,081 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2018-11-10 10:04:24,082 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2018-11-10 10:04:24,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:04:24 BoogieIcfgContainer [2018-11-10 10:04:24,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:04:24,084 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:04:24,085 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:04:24,085 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:04:24,085 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:57:55" (3/4) ... [2018-11-10 10:04:24,088 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 10:04:24,093 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 10:04:24,094 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-10 10:04:24,094 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 10:04:24,104 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 10:04:24,105 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 10:04:24,126 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(a10 == 1) || 218 < a1) || ((forall v_~a1~0_352 : int :: (!(0 == v_~a1~0_352 % 5) || v_~a1~0_352 < a1) || 0 < v_~a1~0_352 / 5 + 331283) && !(8 == a19))) || \old(a19) + inputE < 14) || \old(a1) + inputF < 29) || \old(a19) + inputC < 12) || a12 + inputB < 2) || 4 < inputD + \old(a10)) || inputD < a12 + 4) || 11 < \old(a19) + inputB) || a4 + inputD < 18) || 14 < a4 + \old(a10)) || 5 < inputB + inputC) || 28 < \old(a1) + inputE) || 12 < 2 * inputF) || 2 * \old(a10) < 0 [2018-11-10 10:04:24,192 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_270be4ae-ed4c-4f49-bc4c-b62356649a76/bin-2019/utaipan/witness.graphml [2018-11-10 10:04:24,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:04:24,193 INFO L168 Benchmark]: Toolchain (without parser) took 390692.99 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 956.6 MB in the beginning and 582.2 MB in the end (delta: 374.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-11-10 10:04:24,194 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:04:24,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.93 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 927.0 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:04:24,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 927.0 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:04:24,196 INFO L168 Benchmark]: Boogie Preprocessor took 50.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:04:24,196 INFO L168 Benchmark]: RCFGBuilder took 1067.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.2 MB). Peak memory consumption was 102.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:04:24,196 INFO L168 Benchmark]: TraceAbstraction took 388985.58 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 614.5 MB in the end (delta: 395.2 MB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2018-11-10 10:04:24,197 INFO L168 Benchmark]: Witness Printer took 107.76 ms. Allocated memory is still 2.5 GB. Free memory was 614.5 MB in the beginning and 582.2 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-11-10 10:04:24,198 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.93 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 927.0 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 927.0 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1067.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.2 MB). Peak memory consumption was 102.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 388985.58 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 614.5 MB in the end (delta: 395.2 MB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. * Witness Printer took 107.76 ms. Allocated memory is still 2.5 GB. Free memory was 614.5 MB in the beginning and 582.2 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 118]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant [2018-11-10 10:04:24,201 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2018-11-10 10:04:24,202 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2018-11-10 10:04:24,206 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2018-11-10 10:04:24,207 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2018-11-10 10:04:24,207 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] [2018-11-10 10:04:24,207 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_352,QUANTIFIED] Derived loop invariant: ((((((((((((((!(a10 == 1) || 218 < a1) || ((forall v_~a1~0_352 : int :: (!(0 == v_~a1~0_352 % 5) || v_~a1~0_352 < a1) || 0 < v_~a1~0_352 / 5 + 331283) && !(8 == a19))) || \old(a19) + inputE < 14) || \old(a1) + inputF < 29) || \old(a19) + inputC < 12) || a12 + inputB < 2) || 4 < inputD + \old(a10)) || inputD < a12 + 4) || 11 < \old(a19) + inputB) || a4 + inputD < 18) || 14 < a4 + \old(a10)) || 5 < inputB + inputC) || 28 < \old(a1) + inputE) || 12 < 2 * inputF) || 2 * \old(a10) < 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 388.9s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 191.3s AutomataDifference, 0.0s DeadEndRemovalTime, 121.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 935 SDtfs, 8397 SDslu, 1096 SDs, 0 SdLazy, 10537 SolverSat, 2339 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 95.4s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1373 GetRequests, 1117 SyntacticMatches, 134 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 42.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2692occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 33.9s AbstIntTime, 5 AbstIntIterations, 3 AbstIntStrong, 0.9950884324115071 AbsIntWeakeningRatio, 0.11018363939899833 AbsIntAvgWeakeningVarsNumRemoved, 580.2838063439065 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 620 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 89 PreInvPairs, 147 NumberOfFragments, 1168 HoareAnnotationTreeSize, 89 FomulaSimplifications, 157534 FormulaSimplificationTreeSizeReduction, 40.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 98355 FormulaSimplificationTreeSizeReductionInter, 81.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1681 NumberOfCodeBlocks, 1681 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2005 ConstructedInterpolants, 124 QuantifiedInterpolants, 2226872 SizeOfPredicates, 3 NumberOfNonLiveVariables, 651 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 812/1005 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...