./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/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 967c72bd82820b824aa390b27f8a26458e2fde4d ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:10:55,346 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:10:55,348 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:10:55,356 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:10:55,357 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:10:55,357 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:10:55,358 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:10:55,359 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:10:55,360 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:10:55,361 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:10:55,362 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:10:55,362 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:10:55,363 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:10:55,363 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:10:55,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:10:55,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:10:55,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:10:55,367 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:10:55,368 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:10:55,369 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:10:55,370 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:10:55,370 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:10:55,372 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:10:55,372 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:10:55,372 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:10:55,373 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:10:55,374 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:10:55,374 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:10:55,375 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:10:55,375 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:10:55,375 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:10:55,376 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:10:55,376 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:10:55,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:10:55,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:10:55,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:10:55,378 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 15:10:55,388 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:10:55,388 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:10:55,389 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:10:55,389 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 15:10:55,389 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 15:10:55,389 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 15:10:55,389 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 15:10:55,389 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 15:10:55,390 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 15:10:55,390 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 15:10:55,390 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 15:10:55,390 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 15:10:55,390 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 15:10:55,390 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:10:55,391 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:10:55,391 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:10:55,391 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:10:55,391 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:10:55,391 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:10:55,391 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:10:55,391 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:10:55,391 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:10:55,392 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:10:55,392 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:10:55,392 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:10:55,392 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:10:55,392 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:10:55,392 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:10:55,392 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:10:55,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:10:55,393 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:10:55,393 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:10:55,393 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:10:55,393 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 15:10:55,393 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:10:55,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:10:55,393 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 15:10:55,394 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_0ae0e74a-c6bd-43e8-94ad-0722481399dc/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 -> 967c72bd82820b824aa390b27f8a26458e2fde4d [2018-11-18 15:10:55,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:10:55,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:10:55,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:10:55,428 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:10:55,428 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:10:55,429 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c [2018-11-18 15:10:55,464 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/bin-2019/utaipan/data/a19eb7b18/65e4d77f91944696ac11d568e89c467f/FLAG520579329 [2018-11-18 15:10:55,899 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:10:55,899 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/sv-benchmarks/c/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c [2018-11-18 15:10:55,908 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/bin-2019/utaipan/data/a19eb7b18/65e4d77f91944696ac11d568e89c467f/FLAG520579329 [2018-11-18 15:10:55,919 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/bin-2019/utaipan/data/a19eb7b18/65e4d77f91944696ac11d568e89c467f [2018-11-18 15:10:55,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:10:55,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:10:55,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:10:55,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:10:55,927 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:10:55,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:10:55" (1/1) ... [2018-11-18 15:10:55,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3275144b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:55, skipping insertion in model container [2018-11-18 15:10:55,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:10:55" (1/1) ... [2018-11-18 15:10:55,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:10:55,971 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:10:56,208 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:10:56,212 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:10:56,278 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:10:56,290 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:10:56,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:56 WrapperNode [2018-11-18 15:10:56,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:10:56,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:10:56,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:10:56,292 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:10:56,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:56" (1/1) ... [2018-11-18 15:10:56,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:56" (1/1) ... [2018-11-18 15:10:56,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:10:56,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:10:56,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:10:56,366 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:10:56,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:56" (1/1) ... [2018-11-18 15:10:56,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:56" (1/1) ... [2018-11-18 15:10:56,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:56" (1/1) ... [2018-11-18 15:10:56,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:56" (1/1) ... [2018-11-18 15:10:56,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:56" (1/1) ... [2018-11-18 15:10:56,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:56" (1/1) ... [2018-11-18 15:10:56,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:56" (1/1) ... [2018-11-18 15:10:56,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:10:56,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:10:56,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:10:56,416 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:10:56,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/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-18 15:10:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 15:10:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:10:56,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:10:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-18 15:10:56,459 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-18 15:10:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:10:56,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:10:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:10:56,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:10:57,232 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:10:57,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:10:57 BoogieIcfgContainer [2018-11-18 15:10:57,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:10:57,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:10:57,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:10:57,239 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:10:57,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:10:55" (1/3) ... [2018-11-18 15:10:57,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b5a15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:10:57, skipping insertion in model container [2018-11-18 15:10:57,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:56" (2/3) ... [2018-11-18 15:10:57,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b5a15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:10:57, skipping insertion in model container [2018-11-18 15:10:57,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:10:57" (3/3) ... [2018-11-18 15:10:57,242 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label34_true-unreach-call_false-termination.c [2018-11-18 15:10:57,247 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:10:57,256 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:10:57,265 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:10:57,287 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:10:57,287 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:10:57,287 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:10:57,288 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:10:57,288 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:10:57,288 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:10:57,288 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:10:57,288 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:10:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-18 15:10:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 15:10:57,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:57,312 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:10:57,314 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:57,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:57,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2048669081, now seen corresponding path program 1 times [2018-11-18 15:10:57,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:57,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:57,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:57,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:57,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:10:57,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:10:57,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:10:57,660 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:10:57,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:10:57,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:10:57,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:10:57,673 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-18 15:10:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:10:58,233 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-11-18 15:10:58,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:10:58,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-11-18 15:10:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:10:58,244 INFO L225 Difference]: With dead ends: 618 [2018-11-18 15:10:58,244 INFO L226 Difference]: Without dead ends: 379 [2018-11-18 15:10:58,248 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:10:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-18 15:10:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-18 15:10:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-18 15:10:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-11-18 15:10:58,290 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 105 [2018-11-18 15:10:58,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:10:58,290 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-11-18 15:10:58,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:10:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-11-18 15:10:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 15:10:58,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:58,293 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:10:58,294 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:58,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:58,294 INFO L82 PathProgramCache]: Analyzing trace with hash -926147150, now seen corresponding path program 1 times [2018-11-18 15:10:58,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:58,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:58,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:58,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:58,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:10:58,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:10:58,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:10:58,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:10:58,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:10:58,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:10:58,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:10:58,412 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-11-18 15:10:59,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:10:59,037 INFO L93 Difference]: Finished difference Result 1231 states and 2094 transitions. [2018-11-18 15:10:59,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:10:59,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-11-18 15:10:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:10:59,043 INFO L225 Difference]: With dead ends: 1231 [2018-11-18 15:10:59,043 INFO L226 Difference]: Without dead ends: 858 [2018-11-18 15:10:59,046 INFO L604 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-18 15:10:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-11-18 15:10:59,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 821. [2018-11-18 15:10:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-11-18 15:10:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1290 transitions. [2018-11-18 15:10:59,076 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1290 transitions. Word has length 121 [2018-11-18 15:10:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:10:59,077 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1290 transitions. [2018-11-18 15:10:59,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:10:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1290 transitions. [2018-11-18 15:10:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-18 15:10:59,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:59,080 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:10:59,081 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:59,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:59,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1688257955, now seen corresponding path program 1 times [2018-11-18 15:10:59,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:59,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:59,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:59,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:59,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:10:59,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:10:59,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:10:59,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:10:59,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:10:59,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:10:59,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:10:59,167 INFO L87 Difference]: Start difference. First operand 821 states and 1290 transitions. Second operand 6 states. [2018-11-18 15:11:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:11:00,029 INFO L93 Difference]: Finished difference Result 2553 states and 4218 transitions. [2018-11-18 15:11:00,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:11:00,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-11-18 15:11:00,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:11:00,038 INFO L225 Difference]: With dead ends: 2553 [2018-11-18 15:11:00,038 INFO L226 Difference]: Without dead ends: 1738 [2018-11-18 15:11:00,042 INFO L604 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-18 15:11:00,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-18 15:11:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1680. [2018-11-18 15:11:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-11-18 15:11:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2538 transitions. [2018-11-18 15:11:00,086 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2538 transitions. Word has length 128 [2018-11-18 15:11:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:11:00,086 INFO L480 AbstractCegarLoop]: Abstraction has 1680 states and 2538 transitions. [2018-11-18 15:11:00,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:11:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2538 transitions. [2018-11-18 15:11:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 15:11:00,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:11:00,090 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:11:00,090 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:11:00,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:00,090 INFO L82 PathProgramCache]: Analyzing trace with hash -690130107, now seen corresponding path program 1 times [2018-11-18 15:11:00,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:11:00,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:00,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:00,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:00,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:11:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 15:11:00,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:11:00,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:11:00,178 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2018-11-18 15:11:00,180 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 15:11:00,213 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:11:00,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:11:00,539 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:11:00,540 INFO L272 AbstractInterpreter]: Visited 106 different actions 106 times. Never merged. Never widened. Performed 1196 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1196 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 38 variables. [2018-11-18 15:11:00,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:00,558 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:11:00,802 INFO L227 lantSequenceWeakener]: Weakened 121 states. On average, predicates are now at 80.75% of their original sizes. [2018-11-18 15:11:00,802 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:11:00,833 INFO L415 sIntCurrentIteration]: We unified 129 AI predicates to 129 [2018-11-18 15:11:00,833 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:11:00,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:11:00,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-18 15:11:00,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:11:00,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:11:00,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:11:00,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:11:00,835 INFO L87 Difference]: Start difference. First operand 1680 states and 2538 transitions. Second operand 6 states. [2018-11-18 15:11:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:11:03,211 INFO L93 Difference]: Finished difference Result 3502 states and 5277 transitions. [2018-11-18 15:11:03,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:11:03,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-11-18 15:11:03,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:11:03,220 INFO L225 Difference]: With dead ends: 3502 [2018-11-18 15:11:03,220 INFO L226 Difference]: Without dead ends: 1828 [2018-11-18 15:11:03,224 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:11:03,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2018-11-18 15:11:03,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1825. [2018-11-18 15:11:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1825 states. [2018-11-18 15:11:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2690 transitions. [2018-11-18 15:11:03,264 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2690 transitions. Word has length 130 [2018-11-18 15:11:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:11:03,265 INFO L480 AbstractCegarLoop]: Abstraction has 1825 states and 2690 transitions. [2018-11-18 15:11:03,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:11:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2690 transitions. [2018-11-18 15:11:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-18 15:11:03,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:11:03,268 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:11:03,269 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:11:03,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:03,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1874144486, now seen corresponding path program 1 times [2018-11-18 15:11:03,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:11:03,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:03,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:03,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:03,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:11:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 15:11:03,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:11:03,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:11:03,384 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-11-18 15:11:03,384 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 15:11:03,388 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:11:03,388 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:11:03,695 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:11:03,695 INFO L272 AbstractInterpreter]: Visited 110 different actions 323 times. Merged at 7 different actions 15 times. Never widened. Performed 3703 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3703 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-18 15:11:03,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:03,699 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:11:03,882 INFO L227 lantSequenceWeakener]: Weakened 137 states. On average, predicates are now at 84.13% of their original sizes. [2018-11-18 15:11:03,882 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:11:03,943 INFO L415 sIntCurrentIteration]: We unified 139 AI predicates to 139 [2018-11-18 15:11:03,944 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:11:03,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:11:03,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2018-11-18 15:11:03,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:11:03,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:11:03,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:11:03,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:11:03,945 INFO L87 Difference]: Start difference. First operand 1825 states and 2690 transitions. Second operand 9 states. [2018-11-18 15:11:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:11:07,496 INFO L93 Difference]: Finished difference Result 4527 states and 6707 transitions. [2018-11-18 15:11:07,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 15:11:07,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 140 [2018-11-18 15:11:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:11:07,505 INFO L225 Difference]: With dead ends: 4527 [2018-11-18 15:11:07,505 INFO L226 Difference]: Without dead ends: 2708 [2018-11-18 15:11:07,509 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 147 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-18 15:11:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2018-11-18 15:11:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2631. [2018-11-18 15:11:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2631 states. [2018-11-18 15:11:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3698 transitions. [2018-11-18 15:11:07,564 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3698 transitions. Word has length 140 [2018-11-18 15:11:07,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:11:07,564 INFO L480 AbstractCegarLoop]: Abstraction has 2631 states and 3698 transitions. [2018-11-18 15:11:07,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:11:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3698 transitions. [2018-11-18 15:11:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-18 15:11:07,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:11:07,569 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 15:11:07,569 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:11:07,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:07,569 INFO L82 PathProgramCache]: Analyzing trace with hash 506322742, now seen corresponding path program 1 times [2018-11-18 15:11:07,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:11:07,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:07,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:07,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:07,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:11:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 15:11:07,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:11:07,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:11:07,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:11:07,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:11:07,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:11:07,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:11:07,650 INFO L87 Difference]: Start difference. First operand 2631 states and 3698 transitions. Second operand 3 states. [2018-11-18 15:11:07,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:11:07,968 INFO L93 Difference]: Finished difference Result 6470 states and 9537 transitions. [2018-11-18 15:11:07,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:11:07,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2018-11-18 15:11:07,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:11:07,974 INFO L225 Difference]: With dead ends: 6470 [2018-11-18 15:11:07,974 INFO L226 Difference]: Without dead ends: 2633 [2018-11-18 15:11:07,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:11:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2018-11-18 15:11:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2572. [2018-11-18 15:11:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2572 states. [2018-11-18 15:11:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 3335 transitions. [2018-11-18 15:11:08,009 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 3335 transitions. Word has length 142 [2018-11-18 15:11:08,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:11:08,009 INFO L480 AbstractCegarLoop]: Abstraction has 2572 states and 3335 transitions. [2018-11-18 15:11:08,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:11:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 3335 transitions. [2018-11-18 15:11:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-18 15:11:08,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:11:08,012 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:11:08,012 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:11:08,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:08,013 INFO L82 PathProgramCache]: Analyzing trace with hash -919197045, now seen corresponding path program 1 times [2018-11-18 15:11:08,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:11:08,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:08,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:08,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:08,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:11:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 66 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 15:11:08,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:11:08,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:11:08,085 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-11-18 15:11:08,085 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 15:11:08,088 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:11:08,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:11:08,235 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:11:08,235 INFO L272 AbstractInterpreter]: Visited 110 different actions 328 times. Merged at 8 different actions 20 times. Never widened. Performed 3818 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3818 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-18 15:11:08,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:08,244 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:11:08,432 INFO L227 lantSequenceWeakener]: Weakened 164 states. On average, predicates are now at 84.26% of their original sizes. [2018-11-18 15:11:08,432 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:11:08,459 INFO L415 sIntCurrentIteration]: We unified 166 AI predicates to 166 [2018-11-18 15:11:08,459 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:11:08,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:11:08,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-18 15:11:08,459 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:11:08,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:11:08,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:11:08,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:11:08,460 INFO L87 Difference]: Start difference. First operand 2572 states and 3335 transitions. Second operand 9 states. [2018-11-18 15:11:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:11:10,642 INFO L93 Difference]: Finished difference Result 5303 states and 6767 transitions. [2018-11-18 15:11:10,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 15:11:10,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2018-11-18 15:11:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:11:10,650 INFO L225 Difference]: With dead ends: 5303 [2018-11-18 15:11:10,650 INFO L226 Difference]: Without dead ends: 2737 [2018-11-18 15:11:10,654 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 177 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-11-18 15:11:10,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2018-11-18 15:11:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 2696. [2018-11-18 15:11:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-11-18 15:11:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 3276 transitions. [2018-11-18 15:11:10,695 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 3276 transitions. Word has length 167 [2018-11-18 15:11:10,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:11:10,696 INFO L480 AbstractCegarLoop]: Abstraction has 2696 states and 3276 transitions. [2018-11-18 15:11:10,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:11:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3276 transitions. [2018-11-18 15:11:10,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-18 15:11:10,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:11:10,702 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:11:10,702 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:11:10,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:10,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1394719238, now seen corresponding path program 1 times [2018-11-18 15:11:10,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:11:10,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:10,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:10,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:10,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:11:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 107 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 15:11:10,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:11:10,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:11:10,794 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-11-18 15:11:10,795 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 15:11:10,798 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:11:10,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:11:11,044 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:11:11,044 INFO L272 AbstractInterpreter]: Visited 113 different actions 441 times. Merged at 8 different actions 29 times. Never widened. Performed 5337 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5337 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-18 15:11:11,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:11,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:11:11,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:11:11,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/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-18 15:11:11,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:11,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:11:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:11,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:11:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 15:11:11,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:11:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 107 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 15:11:11,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:11:11,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-18 15:11:11,404 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:11:11,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:11:11,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:11:11,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:11:11,405 INFO L87 Difference]: Start difference. First operand 2696 states and 3276 transitions. Second operand 9 states. [2018-11-18 15:11:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:11:12,007 INFO L93 Difference]: Finished difference Result 6420 states and 7932 transitions. [2018-11-18 15:11:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:11:12,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 210 [2018-11-18 15:11:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:11:12,017 INFO L225 Difference]: With dead ends: 6420 [2018-11-18 15:11:12,017 INFO L226 Difference]: Without dead ends: 3730 [2018-11-18 15:11:12,021 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:11:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2018-11-18 15:11:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 3683. [2018-11-18 15:11:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3683 states. [2018-11-18 15:11:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4477 transitions. [2018-11-18 15:11:12,081 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4477 transitions. Word has length 210 [2018-11-18 15:11:12,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:11:12,081 INFO L480 AbstractCegarLoop]: Abstraction has 3683 states and 4477 transitions. [2018-11-18 15:11:12,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:11:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4477 transitions. [2018-11-18 15:11:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-18 15:11:12,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:11:12,089 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:11:12,089 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:11:12,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:12,089 INFO L82 PathProgramCache]: Analyzing trace with hash -735902478, now seen corresponding path program 1 times [2018-11-18 15:11:12,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:11:12,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:12,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:12,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:12,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:11:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 115 proven. 35 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 15:11:12,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:11:12,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:11:12,211 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-11-18 15:11:12,212 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 15:11:12,214 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:11:12,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:11:12,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:11:12,421 INFO L272 AbstractInterpreter]: Visited 113 different actions 441 times. Merged at 8 different actions 29 times. Never widened. Performed 5406 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5406 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-18 15:11:12,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:12,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:11:12,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:11:12,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/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-18 15:11:12,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:12,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:11:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:12,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:11:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 15:11:12,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:11:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 15:11:12,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:11:12,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-18 15:11:12,608 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:11:12,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:11:12,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:11:12,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:11:12,609 INFO L87 Difference]: Start difference. First operand 3683 states and 4477 transitions. Second operand 9 states. [2018-11-18 15:11:14,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:11:14,201 INFO L93 Difference]: Finished difference Result 8089 states and 9990 transitions. [2018-11-18 15:11:14,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 15:11:14,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 214 [2018-11-18 15:11:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:11:14,205 INFO L225 Difference]: With dead ends: 8089 [2018-11-18 15:11:14,205 INFO L226 Difference]: Without dead ends: 2568 [2018-11-18 15:11:14,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 446 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 15:11:14,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2018-11-18 15:11:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2475. [2018-11-18 15:11:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2018-11-18 15:11:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2841 transitions. [2018-11-18 15:11:14,255 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2841 transitions. Word has length 214 [2018-11-18 15:11:14,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:11:14,255 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 2841 transitions. [2018-11-18 15:11:14,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:11:14,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2841 transitions. [2018-11-18 15:11:14,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-18 15:11:14,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:11:14,261 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:11:14,261 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:11:14,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:14,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1941426456, now seen corresponding path program 1 times [2018-11-18 15:11:14,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:11:14,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:14,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:14,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:14,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:11:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 105 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 15:11:14,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:11:14,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:11:14,385 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-11-18 15:11:14,386 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 15:11:14,387 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:11:14,388 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:11:14,551 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:11:14,551 INFO L272 AbstractInterpreter]: Visited 110 different actions 322 times. Merged at 7 different actions 14 times. Never widened. Performed 3740 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3740 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-18 15:11:14,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:14,552 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:11:14,696 INFO L227 lantSequenceWeakener]: Weakened 210 states. On average, predicates are now at 84.39% of their original sizes. [2018-11-18 15:11:14,696 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:11:14,741 INFO L415 sIntCurrentIteration]: We unified 214 AI predicates to 214 [2018-11-18 15:11:14,742 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:11:14,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:11:14,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2018-11-18 15:11:14,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:11:14,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:11:14,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:11:14,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:11:14,742 INFO L87 Difference]: Start difference. First operand 2475 states and 2841 transitions. Second operand 9 states. [2018-11-18 15:11:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:11:16,413 INFO L93 Difference]: Finished difference Result 5495 states and 6302 transitions. [2018-11-18 15:11:16,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 15:11:16,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 215 [2018-11-18 15:11:16,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:11:16,421 INFO L225 Difference]: With dead ends: 5495 [2018-11-18 15:11:16,421 INFO L226 Difference]: Without dead ends: 3334 [2018-11-18 15:11:16,424 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 221 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-11-18 15:11:16,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2018-11-18 15:11:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3300. [2018-11-18 15:11:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3300 states. [2018-11-18 15:11:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 3757 transitions. [2018-11-18 15:11:16,472 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 3757 transitions. Word has length 215 [2018-11-18 15:11:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:11:16,473 INFO L480 AbstractCegarLoop]: Abstraction has 3300 states and 3757 transitions. [2018-11-18 15:11:16,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:11:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 3757 transitions. [2018-11-18 15:11:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-18 15:11:16,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:11:16,479 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 15:11:16,479 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:11:16,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1479282081, now seen corresponding path program 1 times [2018-11-18 15:11:16,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:11:16,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:16,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:11:16,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:11:16,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:11:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:11:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 160 proven. 95 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 15:11:16,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:11:16,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:11:16,624 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 271 with the following transitions: [2018-11-18 15:11:16,625 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 15:11:16,628 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:11:16,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:11:16,830 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:11:16,830 INFO L272 AbstractInterpreter]: Visited 113 different actions 442 times. Merged at 8 different actions 27 times. Never widened. Performed 5245 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5245 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-18 15:11:16,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:11:16,837 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:11:17,006 INFO L227 lantSequenceWeakener]: Weakened 265 states. On average, predicates are now at 86.73% of their original sizes. [2018-11-18 15:11:17,006 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:11:17,036 INFO L415 sIntCurrentIteration]: We unified 269 AI predicates to 269 [2018-11-18 15:11:17,036 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:11:17,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:11:17,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2018-11-18 15:11:17,036 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:11:17,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:11:17,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:11:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:11:17,037 INFO L87 Difference]: Start difference. First operand 3300 states and 3757 transitions. Second operand 11 states. [2018-11-18 15:11:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:11:18,935 INFO L93 Difference]: Finished difference Result 4428 states and 5020 transitions. [2018-11-18 15:11:18,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 15:11:18,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 270 [2018-11-18 15:11:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:11:18,936 INFO L225 Difference]: With dead ends: 4428 [2018-11-18 15:11:18,936 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 15:11:18,942 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 280 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-11-18 15:11:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 15:11:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 15:11:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 15:11:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 15:11:18,943 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 270 [2018-11-18 15:11:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:11:18,943 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:11:18,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:11:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:11:18,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 15:11:18,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 15:11:19,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:11:19,918 WARN L180 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 75 [2018-11-18 15:11:20,035 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2018-11-18 15:11:20,278 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 59 [2018-11-18 15:11:20,279 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-18 15:11:20,280 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-18 15:11:20,281 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-18 15:11:20,282 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 466) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-18 15:11:20,283 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-18 15:11:20,284 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-18 15:11:20,285 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-18 15:11:20,285 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-18 15:11:20,285 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-18 15:11:20,285 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-18 15:11:20,285 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-18 15:11:20,285 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-18 15:11:20,285 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-18 15:11:20,285 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-18 15:11:20,285 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-18 15:11:20,285 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,285 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,285 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,285 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,285 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,286 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-18 15:11:20,287 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-18 15:11:20,288 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-18 15:11:20,288 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,288 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,288 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,288 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse2 (<= ~a17~0 |old(~a17~0)|)) (.cse3 (= |old(~a28~0)| ~a28~0)) (.cse13 (= ~a19~0 1)) (.cse14 (not (= ~a17~0 0))) (.cse6 (= ~a25~0 |old(~a25~0)|)) (.cse8 (= 1 |old(~a25~0)|))) (let ((.cse0 (< 10 |old(~a28~0)|)) (.cse22 (not (= 0 |old(~a11~0)|))) (.cse21 (= ~a11~0 0)) (.cse16 (= ~a17~0 8)) (.cse18 (not (= 8 |old(~a17~0)|))) (.cse4 (= |old(~a19~0)| ~a19~0)) (.cse5 (= 1 ~a11~0)) (.cse17 (= |old(~a25~0)| ~a25~0)) (.cse1 (not (= 1 |old(~a11~0)|))) (.cse9 (not (= 1 ~a21~0))) (.cse10 (= 0 |old(~a17~0)|)) (.cse20 (not .cse8)) (.cse11 (not (= 1 |old(~a19~0)|))) (.cse12 (= 0 |old(~a28~0)|)) (.cse23 (= |old(~a11~0)| |old(~a19~0)|)) (.cse15 (= |calculate_output_#in~input| 0)) (.cse19 (and .cse2 (= ~a11~0 |old(~a11~0)|) .cse3 .cse13 .cse14 .cse6)) (.cse7 (< 7 |old(~a17~0)|))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8) (or .cse9 .cse10 .cse11 .cse12 (and .cse2 .cse3 .cse5 .cse13 .cse14 .cse6) .cse15 .cse1 .cse8 .cse7) (or (and (not (= ~a28~0 0)) .cse5 .cse16 .cse17 .cse13) .cse9 .cse11 .cse12 .cse18 .cse15 .cse1) (or .cse0 .cse9 .cse10 .cse11 .cse12 .cse15 .cse7 .cse19) (or .cse9 .cse20 .cse11 .cse12 (and .cse3 .cse21 .cse16 .cse13 .cse6) .cse22 .cse18 .cse15) (or .cse0 .cse9 .cse12 .cse22 .cse18 .cse15 (and .cse3 .cse4 .cse21 .cse16 .cse6)) (or .cse9 (not (= 7 |old(~a28~0)|)) .cse20 .cse11 (= ~a28~0 7) .cse18 .cse15 .cse1) (or (and .cse4 .cse5 .cse17) .cse23 .cse1) (or (= 7 |old(~a17~0)|) (not (= ~a17~0 7)) .cse23 .cse1) (or .cse9 .cse10 .cse20 .cse11 .cse12 .cse23 .cse15 .cse19 .cse7)))) [2018-11-18 15:11:20,288 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,288 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,288 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,288 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-18 15:11:20,288 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-18 15:11:20,288 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-18 15:11:20,289 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-18 15:11:20,290 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-18 15:11:20,290 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-18 15:11:20,290 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-18 15:11:20,290 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-18 15:11:20,290 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-18 15:11:20,290 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-18 15:11:20,290 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,290 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,290 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,290 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,290 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 15:11:20,290 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-18 15:11:20,290 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-18 15:11:20,290 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-18 15:11:20,291 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-18 15:11:20,292 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-18 15:11:20,292 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:11:20,292 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-11-18 15:11:20,292 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:11:20,292 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:11:20,292 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|)) (and (= ~a11~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a25~0 |old(~a25~0)|))) [2018-11-18 15:11:20,292 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-18 15:11:20,292 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (<= ~a17~0 7)) (.cse2 (<= ~a28~0 10)) (.cse1 (= 1 ~a11~0)) (.cse3 (= ~a11~0 0)) (.cse4 (not (= main_~input~0 0))) (.cse5 (not (= ~a28~0 0))) (.cse6 (= ~a17~0 8)) (.cse7 (= ~a19~0 1))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and .cse0 (not (= ~a25~0 1)) .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse2 .cse6) (and .cse0 .cse5 .cse1 .cse2 (not (= ~a17~0 0))) (and .cse5 .cse1 .cse6) (not (= 0 |old(~a25~0)|)) (and (and .cse3 (= ~a25~0 |old(~a25~0)|)) .cse6 .cse7 (= ~a28~0 7)) (and .cse1 (not (= ~a19~0 ~a11~0))) (and .cse3 .cse4 (and (and .cse5 .cse6 .cse7) (= 1 ~a25~0))) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)))) [2018-11-18 15:11:20,292 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-18 15:11:20,293 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-18 15:11:20,293 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (= ~a11~0 0)) (.cse3 (= ~a17~0 8)) (.cse1 (not (= main_~input~0 0))) (.cse6 (<= ~a17~0 7)) (.cse2 (not (= ~a28~0 0))) (.cse4 (= 1 ~a11~0)) (.cse5 (<= ~a28~0 10))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 (= 1 ~a25~0) (= ~a19~0 1) .cse3) (not (= 7 |old(~a28~0)|)) (and .cse1 .cse2 .cse4 .cse3) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse4 (not (= ~a19~0 ~a11~0))) (not (= 0 |old(~a11~0)|)) (and .cse6 (not (= ~a25~0 1)) .cse4 .cse5) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (and .cse1 .cse6 .cse2 .cse4 .cse5 (not (= ~a17~0 0))) (not (= 0 |old(~a25~0)|)))) [2018-11-18 15:11:20,293 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-18 15:11:20,293 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-18 15:11:20,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:11:20 BoogieIcfgContainer [2018-11-18 15:11:20,302 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 15:11:20,303 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:11:20,303 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:11:20,303 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:11:20,303 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:10:57" (3/4) ... [2018-11-18 15:11:20,306 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 15:11:20,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 15:11:20,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-18 15:11:20,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 15:11:20,328 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-18 15:11:20,329 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 15:11:20,359 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(1 == a21) || !(7 == \old(a28))) || !(0 == \old(a11))) || (((a17 <= 7 && !(a25 == 1)) && 1 == a11) && a28 <= 10)) || ((((a11 == 0 && !(input == 0)) && !(a28 == 0)) && a28 <= 10) && a17 == 8)) || ((((a17 <= 7 && !(a28 == 0)) && 1 == a11) && a28 <= 10) && !(a17 == 0))) || ((!(a28 == 0) && 1 == a11) && a17 == 8)) || !(0 == \old(a25))) || ((((a11 == 0 && a25 == \old(a25)) && a17 == 8) && a19 == 1) && a28 == 7)) || (1 == a11 && !(a19 == a11))) || ((a11 == 0 && !(input == 0)) && ((!(a28 == 0) && a17 == 8) && a19 == 1) && 1 == a25)) || !(1 == \old(a19))) || !(8 == \old(a17)) [2018-11-18 15:11:20,426 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0ae0e74a-c6bd-43e8-94ad-0722481399dc/bin-2019/utaipan/witness.graphml [2018-11-18 15:11:20,427 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:11:20,427 INFO L168 Benchmark]: Toolchain (without parser) took 24504.96 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 956.4 MB in the beginning and 878.6 MB in the end (delta: 77.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-18 15:11:20,428 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:11:20,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.39 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 916.1 MB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:11:20,429 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 916.1 MB in the beginning and 1.2 GB in the end (delta: -268.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-18 15:11:20,429 INFO L168 Benchmark]: Boogie Preprocessor took 49.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:11:20,430 INFO L168 Benchmark]: RCFGBuilder took 820.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 112.4 MB). Peak memory consumption was 112.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:11:20,430 INFO L168 Benchmark]: TraceAbstraction took 23065.94 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 989.3 MB). Free memory was 1.1 GB in the beginning and 902.7 MB in the end (delta: 166.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-18 15:11:20,430 INFO L168 Benchmark]: Witness Printer took 124.10 ms. Allocated memory is still 2.2 GB. Free memory was 902.7 MB in the beginning and 878.6 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2018-11-18 15:11:20,432 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.39 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 916.1 MB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 916.1 MB in the beginning and 1.2 GB in the end (delta: -268.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 820.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 112.4 MB). Peak memory consumption was 112.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23065.94 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 989.3 MB). Free memory was 1.1 GB in the beginning and 902.7 MB in the end (delta: 166.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 124.10 ms. Allocated memory is still 2.2 GB. Free memory was 902.7 MB in the beginning and 878.6 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 466]: 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: 606]: Loop Invariant Derived loop invariant: (((((((((((!(1 == a21) || !(7 == \old(a28))) || !(0 == \old(a11))) || (((a17 <= 7 && !(a25 == 1)) && 1 == a11) && a28 <= 10)) || ((((a11 == 0 && !(input == 0)) && !(a28 == 0)) && a28 <= 10) && a17 == 8)) || ((((a17 <= 7 && !(a28 == 0)) && 1 == a11) && a28 <= 10) && !(a17 == 0))) || ((!(a28 == 0) && 1 == a11) && a17 == 8)) || !(0 == \old(a25))) || ((((a11 == 0 && a25 == \old(a25)) && a17 == 8) && a19 == 1) && a28 == 7)) || (1 == a11 && !(a19 == a11))) || ((a11 == 0 && !(input == 0)) && ((!(a28 == 0) && a17 == 8) && a19 == 1) && 1 == a25)) || !(1 == \old(a19))) || !(8 == \old(a17)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 23.0s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 16.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1541 SDtfs, 7239 SDslu, 2358 SDs, 0 SdLazy, 12280 SolverSat, 2129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1898 GetRequests, 1757 SyntacticMatches, 7 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3683occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 7 AbstIntIterations, 5 AbstIntStrong, 0.9965049625979701 AbsIntWeakeningRatio, 0.22464558342420937 AbsIntAvgWeakeningVarsNumRemoved, 24.931297709923665 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 451 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 153 PreInvPairs, 210 NumberOfFragments, 697 HoareAnnotationTreeSize, 153 FomulaSimplifications, 9163 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4001 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2266 NumberOfCodeBlocks, 2266 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2675 ConstructedInterpolants, 0 QuantifiedInterpolants, 1016052 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1030 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 1373/1667 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...