./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash afbf25d75f484a934aa8912c08ac22e74061fce8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:45:44,795 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:45:44,796 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:45:44,802 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:45:44,802 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:45:44,803 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:45:44,803 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:45:44,804 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:45:44,805 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:45:44,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:45:44,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:45:44,806 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:45:44,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:45:44,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:45:44,807 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:45:44,808 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:45:44,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:45:44,809 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:45:44,810 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:45:44,811 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:45:44,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:45:44,812 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:45:44,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:45:44,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:45:44,813 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:45:44,813 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:45:44,814 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:45:44,814 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:45:44,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:45:44,815 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:45:44,815 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:45:44,816 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:45:44,816 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:45:44,816 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:45:44,816 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:45:44,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:45:44,817 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 00:45:44,824 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:45:44,824 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:45:44,824 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:45:44,824 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:45:44,825 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:45:44,825 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:45:44,825 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:45:44,825 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:45:44,825 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:45:44,825 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:45:44,825 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:45:44,825 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:45:44,825 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:45:44,826 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:45:44,826 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:45:44,826 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:45:44,826 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:45:44,826 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:45:44,826 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:45:44,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:45:44,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:45:44,826 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:45:44,826 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:45:44,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:45:44,827 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:45:44,827 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:45:44,827 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:45:44,827 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:45:44,827 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:45:44,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:45:44,827 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/bin-2019/uautomizer 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 -> Automizer 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 -> afbf25d75f484a934aa8912c08ac22e74061fce8 [2018-12-09 00:45:44,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:45:44,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:45:44,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:45:44,856 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:45:44,857 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:45:44,857 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix054_power.opt_false-unreach-call.i [2018-12-09 00:45:44,899 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/bin-2019/uautomizer/data/44c19b32b/1b5b504138f540e8ac1cbdfe1a6632f9/FLAGd28919303 [2018-12-09 00:45:45,369 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:45:45,369 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/sv-benchmarks/c/pthread-wmm/mix054_power.opt_false-unreach-call.i [2018-12-09 00:45:45,377 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/bin-2019/uautomizer/data/44c19b32b/1b5b504138f540e8ac1cbdfe1a6632f9/FLAGd28919303 [2018-12-09 00:45:45,386 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/bin-2019/uautomizer/data/44c19b32b/1b5b504138f540e8ac1cbdfe1a6632f9 [2018-12-09 00:45:45,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:45:45,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:45:45,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:45:45,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:45:45,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:45:45,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:45:45" (1/1) ... [2018-12-09 00:45:45,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:45, skipping insertion in model container [2018-12-09 00:45:45,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:45:45" (1/1) ... [2018-12-09 00:45:45,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:45:45,418 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:45:45,594 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:45:45,602 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:45:45,678 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:45:45,707 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:45:45,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:45 WrapperNode [2018-12-09 00:45:45,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:45:45,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:45:45,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:45:45,708 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:45:45,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:45" (1/1) ... [2018-12-09 00:45:45,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:45" (1/1) ... [2018-12-09 00:45:45,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:45:45,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:45:45,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:45:45,739 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:45:45,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:45" (1/1) ... [2018-12-09 00:45:45,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:45" (1/1) ... [2018-12-09 00:45:45,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:45" (1/1) ... [2018-12-09 00:45:45,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:45" (1/1) ... [2018-12-09 00:45:45,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:45" (1/1) ... [2018-12-09 00:45:45,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:45" (1/1) ... [2018-12-09 00:45:45,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:45" (1/1) ... [2018-12-09 00:45:45,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:45:45,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:45:45,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:45:45,760 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:45:45,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/bin-2019/uautomizer/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-12-09 00:45:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:45:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:45:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 00:45:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:45:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 00:45:45,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 00:45:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 00:45:45,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 00:45:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 00:45:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:45:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:45:45,794 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 00:45:46,095 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:45:46,095 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 00:45:46,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:45:46 BoogieIcfgContainer [2018-12-09 00:45:46,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:45:46,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:45:46,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:45:46,098 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:45:46,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:45:45" (1/3) ... [2018-12-09 00:45:46,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1911d099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:45:46, skipping insertion in model container [2018-12-09 00:45:46,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:45:45" (2/3) ... [2018-12-09 00:45:46,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1911d099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:45:46, skipping insertion in model container [2018-12-09 00:45:46,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:45:46" (3/3) ... [2018-12-09 00:45:46,100 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.opt_false-unreach-call.i [2018-12-09 00:45:46,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,124 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,124 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,124 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,124 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,125 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,129 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,129 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,141 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,142 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,143 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,144 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,145 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:45:46,151 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 00:45:46,151 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:45:46,158 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 00:45:46,172 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 00:45:46,188 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:45:46,189 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:45:46,189 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:45:46,189 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:45:46,189 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:45:46,189 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:45:46,189 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:45:46,189 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:45:46,189 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:45:46,197 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-12-09 00:45:47,736 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34805 states. [2018-12-09 00:45:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 34805 states. [2018-12-09 00:45:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 00:45:47,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:47,742 INFO L402 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] [2018-12-09 00:45:47,744 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:47,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:47,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1272153477, now seen corresponding path program 1 times [2018-12-09 00:45:47,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:47,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:47,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:47,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:47,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:47,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:47,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:45:47,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:45:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:45:47,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:45:47,889 INFO L87 Difference]: Start difference. First operand 34805 states. Second operand 4 states. [2018-12-09 00:45:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:48,373 INFO L93 Difference]: Finished difference Result 60789 states and 234492 transitions. [2018-12-09 00:45:48,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:45:48,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-09 00:45:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:48,535 INFO L225 Difference]: With dead ends: 60789 [2018-12-09 00:45:48,535 INFO L226 Difference]: Without dead ends: 44269 [2018-12-09 00:45:48,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:45:48,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44269 states. [2018-12-09 00:45:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44269 to 27337. [2018-12-09 00:45:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27337 states. [2018-12-09 00:45:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27337 states to 27337 states and 105498 transitions. [2018-12-09 00:45:49,322 INFO L78 Accepts]: Start accepts. Automaton has 27337 states and 105498 transitions. Word has length 32 [2018-12-09 00:45:49,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:49,323 INFO L480 AbstractCegarLoop]: Abstraction has 27337 states and 105498 transitions. [2018-12-09 00:45:49,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:45:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 27337 states and 105498 transitions. [2018-12-09 00:45:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 00:45:49,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:49,327 INFO L402 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] [2018-12-09 00:45:49,327 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:49,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:49,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1559910934, now seen corresponding path program 1 times [2018-12-09 00:45:49,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:49,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:49,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:49,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:49,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:49,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:49,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:45:49,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:45:49,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:45:49,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:45:49,382 INFO L87 Difference]: Start difference. First operand 27337 states and 105498 transitions. Second operand 4 states. [2018-12-09 00:45:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:49,450 INFO L93 Difference]: Finished difference Result 8527 states and 28343 transitions. [2018-12-09 00:45:49,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:45:49,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-09 00:45:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:49,465 INFO L225 Difference]: With dead ends: 8527 [2018-12-09 00:45:49,465 INFO L226 Difference]: Without dead ends: 7465 [2018-12-09 00:45:49,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:45:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2018-12-09 00:45:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 7465. [2018-12-09 00:45:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7465 states. [2018-12-09 00:45:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7465 states to 7465 states and 24635 transitions. [2018-12-09 00:45:49,553 INFO L78 Accepts]: Start accepts. Automaton has 7465 states and 24635 transitions. Word has length 44 [2018-12-09 00:45:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:49,554 INFO L480 AbstractCegarLoop]: Abstraction has 7465 states and 24635 transitions. [2018-12-09 00:45:49,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:45:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 7465 states and 24635 transitions. [2018-12-09 00:45:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 00:45:49,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:49,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:45:49,555 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:49,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1459656693, now seen corresponding path program 1 times [2018-12-09 00:45:49,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:49,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:49,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:49,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:49,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:49,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:49,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:45:49,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:45:49,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:45:49,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:45:49,617 INFO L87 Difference]: Start difference. First operand 7465 states and 24635 transitions. Second operand 5 states. [2018-12-09 00:45:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:49,816 INFO L93 Difference]: Finished difference Result 13997 states and 45804 transitions. [2018-12-09 00:45:49,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:45:49,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-09 00:45:49,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:49,844 INFO L225 Difference]: With dead ends: 13997 [2018-12-09 00:45:49,844 INFO L226 Difference]: Without dead ends: 13929 [2018-12-09 00:45:49,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:45:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13929 states. [2018-12-09 00:45:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13929 to 9440. [2018-12-09 00:45:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9440 states. [2018-12-09 00:45:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9440 states to 9440 states and 30541 transitions. [2018-12-09 00:45:49,974 INFO L78 Accepts]: Start accepts. Automaton has 9440 states and 30541 transitions. Word has length 45 [2018-12-09 00:45:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:49,975 INFO L480 AbstractCegarLoop]: Abstraction has 9440 states and 30541 transitions. [2018-12-09 00:45:49,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:45:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 9440 states and 30541 transitions. [2018-12-09 00:45:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 00:45:49,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:49,976 INFO L402 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] [2018-12-09 00:45:49,976 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:49,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:49,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1598559727, now seen corresponding path program 1 times [2018-12-09 00:45:49,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:49,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:49,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:49,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:49,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:50,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:50,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:50,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:50,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:50,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:50,012 INFO L87 Difference]: Start difference. First operand 9440 states and 30541 transitions. Second operand 3 states. [2018-12-09 00:45:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:50,121 INFO L93 Difference]: Finished difference Result 13278 states and 42640 transitions. [2018-12-09 00:45:50,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:50,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-09 00:45:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:50,137 INFO L225 Difference]: With dead ends: 13278 [2018-12-09 00:45:50,137 INFO L226 Difference]: Without dead ends: 13278 [2018-12-09 00:45:50,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13278 states. [2018-12-09 00:45:50,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13278 to 9844. [2018-12-09 00:45:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9844 states. [2018-12-09 00:45:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9844 states to 9844 states and 31507 transitions. [2018-12-09 00:45:50,264 INFO L78 Accepts]: Start accepts. Automaton has 9844 states and 31507 transitions. Word has length 47 [2018-12-09 00:45:50,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:50,265 INFO L480 AbstractCegarLoop]: Abstraction has 9844 states and 31507 transitions. [2018-12-09 00:45:50,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand 9844 states and 31507 transitions. [2018-12-09 00:45:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 00:45:50,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:50,266 INFO L402 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] [2018-12-09 00:45:50,266 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:50,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:50,266 INFO L82 PathProgramCache]: Analyzing trace with hash -108379620, now seen corresponding path program 1 times [2018-12-09 00:45:50,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:50,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:50,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:50,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:50,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:50,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:50,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:45:50,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:45:50,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:45:50,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:45:50,334 INFO L87 Difference]: Start difference. First operand 9844 states and 31507 transitions. Second operand 7 states. [2018-12-09 00:45:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:50,696 INFO L93 Difference]: Finished difference Result 12284 states and 38672 transitions. [2018-12-09 00:45:50,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:45:50,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-12-09 00:45:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:50,709 INFO L225 Difference]: With dead ends: 12284 [2018-12-09 00:45:50,709 INFO L226 Difference]: Without dead ends: 12212 [2018-12-09 00:45:50,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:45:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2018-12-09 00:45:50,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 10848. [2018-12-09 00:45:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10848 states. [2018-12-09 00:45:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10848 states to 10848 states and 34562 transitions. [2018-12-09 00:45:50,821 INFO L78 Accepts]: Start accepts. Automaton has 10848 states and 34562 transitions. Word has length 51 [2018-12-09 00:45:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:50,821 INFO L480 AbstractCegarLoop]: Abstraction has 10848 states and 34562 transitions. [2018-12-09 00:45:50,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:45:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 10848 states and 34562 transitions. [2018-12-09 00:45:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 00:45:50,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:50,824 INFO L402 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] [2018-12-09 00:45:50,824 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:50,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:50,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1204429704, now seen corresponding path program 1 times [2018-12-09 00:45:50,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:50,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:50,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:50,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:50,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:50,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:50,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:45:50,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:45:50,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:45:50,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:45:50,860 INFO L87 Difference]: Start difference. First operand 10848 states and 34562 transitions. Second operand 4 states. [2018-12-09 00:45:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:50,956 INFO L93 Difference]: Finished difference Result 12395 states and 39571 transitions. [2018-12-09 00:45:50,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:45:50,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-09 00:45:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:50,970 INFO L225 Difference]: With dead ends: 12395 [2018-12-09 00:45:50,970 INFO L226 Difference]: Without dead ends: 12395 [2018-12-09 00:45:50,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:45:50,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12395 states. [2018-12-09 00:45:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12395 to 11368. [2018-12-09 00:45:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11368 states. [2018-12-09 00:45:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11368 states to 11368 states and 36235 transitions. [2018-12-09 00:45:51,095 INFO L78 Accepts]: Start accepts. Automaton has 11368 states and 36235 transitions. Word has length 59 [2018-12-09 00:45:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:51,096 INFO L480 AbstractCegarLoop]: Abstraction has 11368 states and 36235 transitions. [2018-12-09 00:45:51,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:45:51,096 INFO L276 IsEmpty]: Start isEmpty. Operand 11368 states and 36235 transitions. [2018-12-09 00:45:51,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 00:45:51,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:51,099 INFO L402 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] [2018-12-09 00:45:51,099 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:51,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:51,099 INFO L82 PathProgramCache]: Analyzing trace with hash 538380631, now seen corresponding path program 1 times [2018-12-09 00:45:51,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:51,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:51,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:51,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:51,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:51,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:51,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:45:51,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:45:51,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:45:51,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:45:51,156 INFO L87 Difference]: Start difference. First operand 11368 states and 36235 transitions. Second operand 6 states. [2018-12-09 00:45:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:51,454 INFO L93 Difference]: Finished difference Result 20968 states and 66485 transitions. [2018-12-09 00:45:51,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:45:51,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-09 00:45:51,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:51,481 INFO L225 Difference]: With dead ends: 20968 [2018-12-09 00:45:51,481 INFO L226 Difference]: Without dead ends: 20897 [2018-12-09 00:45:51,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:45:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20897 states. [2018-12-09 00:45:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20897 to 13754. [2018-12-09 00:45:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13754 states. [2018-12-09 00:45:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13754 states to 13754 states and 43279 transitions. [2018-12-09 00:45:51,726 INFO L78 Accepts]: Start accepts. Automaton has 13754 states and 43279 transitions. Word has length 59 [2018-12-09 00:45:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:51,726 INFO L480 AbstractCegarLoop]: Abstraction has 13754 states and 43279 transitions. [2018-12-09 00:45:51,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:45:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 13754 states and 43279 transitions. [2018-12-09 00:45:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 00:45:51,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:51,731 INFO L402 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] [2018-12-09 00:45:51,731 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:51,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:51,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1986786434, now seen corresponding path program 1 times [2018-12-09 00:45:51,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:51,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:51,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:51,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:51,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:51,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:51,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:45:51,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:45:51,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:45:51,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:45:51,756 INFO L87 Difference]: Start difference. First operand 13754 states and 43279 transitions. Second operand 4 states. [2018-12-09 00:45:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:52,014 INFO L93 Difference]: Finished difference Result 20200 states and 61902 transitions. [2018-12-09 00:45:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:45:52,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 00:45:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:52,035 INFO L225 Difference]: With dead ends: 20200 [2018-12-09 00:45:52,035 INFO L226 Difference]: Without dead ends: 20200 [2018-12-09 00:45:52,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:45:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20200 states. [2018-12-09 00:45:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20200 to 15792. [2018-12-09 00:45:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15792 states. [2018-12-09 00:45:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15792 states to 15792 states and 49060 transitions. [2018-12-09 00:45:52,218 INFO L78 Accepts]: Start accepts. Automaton has 15792 states and 49060 transitions. Word has length 63 [2018-12-09 00:45:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:52,218 INFO L480 AbstractCegarLoop]: Abstraction has 15792 states and 49060 transitions. [2018-12-09 00:45:52,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:45:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 15792 states and 49060 transitions. [2018-12-09 00:45:52,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 00:45:52,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:52,223 INFO L402 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] [2018-12-09 00:45:52,223 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:52,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:52,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1121709459, now seen corresponding path program 1 times [2018-12-09 00:45:52,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:52,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:52,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:52,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:52,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:52,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:52,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:45:52,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:45:52,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:45:52,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:45:52,264 INFO L87 Difference]: Start difference. First operand 15792 states and 49060 transitions. Second operand 4 states. [2018-12-09 00:45:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:52,442 INFO L93 Difference]: Finished difference Result 19959 states and 61084 transitions. [2018-12-09 00:45:52,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:45:52,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 00:45:52,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:52,463 INFO L225 Difference]: With dead ends: 19959 [2018-12-09 00:45:52,463 INFO L226 Difference]: Without dead ends: 19959 [2018-12-09 00:45:52,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:45:52,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19959 states. [2018-12-09 00:45:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19959 to 16086. [2018-12-09 00:45:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16086 states. [2018-12-09 00:45:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16086 states to 16086 states and 49917 transitions. [2018-12-09 00:45:52,646 INFO L78 Accepts]: Start accepts. Automaton has 16086 states and 49917 transitions. Word has length 63 [2018-12-09 00:45:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:52,646 INFO L480 AbstractCegarLoop]: Abstraction has 16086 states and 49917 transitions. [2018-12-09 00:45:52,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:45:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 16086 states and 49917 transitions. [2018-12-09 00:45:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 00:45:52,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:52,651 INFO L402 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] [2018-12-09 00:45:52,651 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:52,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:52,652 INFO L82 PathProgramCache]: Analyzing trace with hash 866972914, now seen corresponding path program 1 times [2018-12-09 00:45:52,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:52,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:52,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:52,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:52,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:52,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:52,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:52,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:52,671 INFO L87 Difference]: Start difference. First operand 16086 states and 49917 transitions. Second operand 3 states. [2018-12-09 00:45:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:52,821 INFO L93 Difference]: Finished difference Result 16558 states and 51205 transitions. [2018-12-09 00:45:52,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:52,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-12-09 00:45:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:52,915 INFO L225 Difference]: With dead ends: 16558 [2018-12-09 00:45:52,915 INFO L226 Difference]: Without dead ends: 16558 [2018-12-09 00:45:52,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:52,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16558 states. [2018-12-09 00:45:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16558 to 16322. [2018-12-09 00:45:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16322 states. [2018-12-09 00:45:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16322 states to 16322 states and 50541 transitions. [2018-12-09 00:45:53,079 INFO L78 Accepts]: Start accepts. Automaton has 16322 states and 50541 transitions. Word has length 63 [2018-12-09 00:45:53,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:53,079 INFO L480 AbstractCegarLoop]: Abstraction has 16322 states and 50541 transitions. [2018-12-09 00:45:53,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:53,079 INFO L276 IsEmpty]: Start isEmpty. Operand 16322 states and 50541 transitions. [2018-12-09 00:45:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 00:45:53,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:53,085 INFO L402 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] [2018-12-09 00:45:53,085 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:53,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:53,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1567726820, now seen corresponding path program 1 times [2018-12-09 00:45:53,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:53,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:53,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:53,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:53,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:53,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:53,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:45:53,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:45:53,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:45:53,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:45:53,134 INFO L87 Difference]: Start difference. First operand 16322 states and 50541 transitions. Second operand 6 states. [2018-12-09 00:45:53,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:53,389 INFO L93 Difference]: Finished difference Result 17646 states and 53545 transitions. [2018-12-09 00:45:53,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:45:53,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-09 00:45:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:53,408 INFO L225 Difference]: With dead ends: 17646 [2018-12-09 00:45:53,408 INFO L226 Difference]: Without dead ends: 17646 [2018-12-09 00:45:53,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:45:53,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17646 states. [2018-12-09 00:45:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17646 to 16546. [2018-12-09 00:45:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16546 states. [2018-12-09 00:45:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16546 states to 16546 states and 50764 transitions. [2018-12-09 00:45:53,580 INFO L78 Accepts]: Start accepts. Automaton has 16546 states and 50764 transitions. Word has length 65 [2018-12-09 00:45:53,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:53,580 INFO L480 AbstractCegarLoop]: Abstraction has 16546 states and 50764 transitions. [2018-12-09 00:45:53,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:45:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 16546 states and 50764 transitions. [2018-12-09 00:45:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 00:45:53,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:53,586 INFO L402 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] [2018-12-09 00:45:53,586 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:53,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:53,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1500720067, now seen corresponding path program 1 times [2018-12-09 00:45:53,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:53,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:53,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:53,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:53,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:53,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:53,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:45:53,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:45:53,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:45:53,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:45:53,642 INFO L87 Difference]: Start difference. First operand 16546 states and 50764 transitions. Second operand 5 states. [2018-12-09 00:45:53,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:53,865 INFO L93 Difference]: Finished difference Result 21334 states and 64873 transitions. [2018-12-09 00:45:53,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:45:53,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 00:45:53,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:53,887 INFO L225 Difference]: With dead ends: 21334 [2018-12-09 00:45:53,887 INFO L226 Difference]: Without dead ends: 21334 [2018-12-09 00:45:53,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:45:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21334 states. [2018-12-09 00:45:54,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21334 to 19570. [2018-12-09 00:45:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19570 states. [2018-12-09 00:45:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19570 states to 19570 states and 59494 transitions. [2018-12-09 00:45:54,088 INFO L78 Accepts]: Start accepts. Automaton has 19570 states and 59494 transitions. Word has length 65 [2018-12-09 00:45:54,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:54,088 INFO L480 AbstractCegarLoop]: Abstraction has 19570 states and 59494 transitions. [2018-12-09 00:45:54,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:45:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 19570 states and 59494 transitions. [2018-12-09 00:45:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 00:45:54,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:54,095 INFO L402 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] [2018-12-09 00:45:54,095 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:54,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:54,095 INFO L82 PathProgramCache]: Analyzing trace with hash 990185890, now seen corresponding path program 1 times [2018-12-09 00:45:54,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:54,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:54,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:54,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:54,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:54,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:54,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:45:54,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:45:54,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:45:54,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:45:54,149 INFO L87 Difference]: Start difference. First operand 19570 states and 59494 transitions. Second operand 5 states. [2018-12-09 00:45:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:54,447 INFO L93 Difference]: Finished difference Result 30156 states and 90237 transitions. [2018-12-09 00:45:54,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:45:54,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 00:45:54,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:54,480 INFO L225 Difference]: With dead ends: 30156 [2018-12-09 00:45:54,480 INFO L226 Difference]: Without dead ends: 30156 [2018-12-09 00:45:54,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:45:54,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30156 states. [2018-12-09 00:45:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30156 to 26760. [2018-12-09 00:45:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26760 states. [2018-12-09 00:45:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26760 states to 26760 states and 80370 transitions. [2018-12-09 00:45:54,906 INFO L78 Accepts]: Start accepts. Automaton has 26760 states and 80370 transitions. Word has length 65 [2018-12-09 00:45:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:54,906 INFO L480 AbstractCegarLoop]: Abstraction has 26760 states and 80370 transitions. [2018-12-09 00:45:54,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:45:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 26760 states and 80370 transitions. [2018-12-09 00:45:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 00:45:54,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:54,914 INFO L402 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] [2018-12-09 00:45:54,915 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:54,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:54,915 INFO L82 PathProgramCache]: Analyzing trace with hash -817268573, now seen corresponding path program 1 times [2018-12-09 00:45:54,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:54,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:54,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:54,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:54,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:54,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:54,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:45:54,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:45:54,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:45:54,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:45:54,953 INFO L87 Difference]: Start difference. First operand 26760 states and 80370 transitions. Second operand 4 states. [2018-12-09 00:45:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:55,321 INFO L93 Difference]: Finished difference Result 36608 states and 110252 transitions. [2018-12-09 00:45:55,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:45:55,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 00:45:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:55,363 INFO L225 Difference]: With dead ends: 36608 [2018-12-09 00:45:55,363 INFO L226 Difference]: Without dead ends: 36344 [2018-12-09 00:45:55,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:45:55,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36344 states. [2018-12-09 00:45:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36344 to 33704. [2018-12-09 00:45:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33704 states. [2018-12-09 00:45:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33704 states to 33704 states and 101614 transitions. [2018-12-09 00:45:55,730 INFO L78 Accepts]: Start accepts. Automaton has 33704 states and 101614 transitions. Word has length 65 [2018-12-09 00:45:55,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:55,730 INFO L480 AbstractCegarLoop]: Abstraction has 33704 states and 101614 transitions. [2018-12-09 00:45:55,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:45:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 33704 states and 101614 transitions. [2018-12-09 00:45:55,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 00:45:55,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:55,739 INFO L402 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] [2018-12-09 00:45:55,739 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:55,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:55,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1680747364, now seen corresponding path program 1 times [2018-12-09 00:45:55,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:55,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:55,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:55,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:55,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:55,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:55,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:45:55,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:45:55,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:45:55,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:45:55,788 INFO L87 Difference]: Start difference. First operand 33704 states and 101614 transitions. Second operand 5 states. [2018-12-09 00:45:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:55,817 INFO L93 Difference]: Finished difference Result 8356 states and 20403 transitions. [2018-12-09 00:45:55,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:45:55,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 00:45:55,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:55,822 INFO L225 Difference]: With dead ends: 8356 [2018-12-09 00:45:55,822 INFO L226 Difference]: Without dead ends: 6588 [2018-12-09 00:45:55,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:45:55,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states. [2018-12-09 00:45:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 5161. [2018-12-09 00:45:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5161 states. [2018-12-09 00:45:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 12358 transitions. [2018-12-09 00:45:55,864 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 12358 transitions. Word has length 65 [2018-12-09 00:45:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:55,864 INFO L480 AbstractCegarLoop]: Abstraction has 5161 states and 12358 transitions. [2018-12-09 00:45:55,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:45:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 12358 transitions. [2018-12-09 00:45:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 00:45:55,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:55,867 INFO L402 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] [2018-12-09 00:45:55,867 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:55,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:55,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2026999384, now seen corresponding path program 1 times [2018-12-09 00:45:55,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:55,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:55,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:55,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:55,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:55,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:55,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:55,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:55,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:55,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:55,882 INFO L87 Difference]: Start difference. First operand 5161 states and 12358 transitions. Second operand 3 states. [2018-12-09 00:45:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:55,904 INFO L93 Difference]: Finished difference Result 7236 states and 17318 transitions. [2018-12-09 00:45:55,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:55,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-09 00:45:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:55,909 INFO L225 Difference]: With dead ends: 7236 [2018-12-09 00:45:55,909 INFO L226 Difference]: Without dead ends: 7236 [2018-12-09 00:45:55,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7236 states. [2018-12-09 00:45:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7236 to 5104. [2018-12-09 00:45:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5104 states. [2018-12-09 00:45:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 11991 transitions. [2018-12-09 00:45:55,953 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 11991 transitions. Word has length 65 [2018-12-09 00:45:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:55,953 INFO L480 AbstractCegarLoop]: Abstraction has 5104 states and 11991 transitions. [2018-12-09 00:45:55,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 11991 transitions. [2018-12-09 00:45:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 00:45:55,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:55,956 INFO L402 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] [2018-12-09 00:45:55,956 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:55,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:55,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1343049765, now seen corresponding path program 1 times [2018-12-09 00:45:55,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:55,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:55,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:55,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:55,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:55,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:55,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:45:55,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:45:55,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:45:55,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:45:55,993 INFO L87 Difference]: Start difference. First operand 5104 states and 11991 transitions. Second operand 5 states. [2018-12-09 00:45:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:56,085 INFO L93 Difference]: Finished difference Result 6127 states and 14344 transitions. [2018-12-09 00:45:56,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:45:56,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-09 00:45:56,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:56,089 INFO L225 Difference]: With dead ends: 6127 [2018-12-09 00:45:56,089 INFO L226 Difference]: Without dead ends: 6127 [2018-12-09 00:45:56,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:45:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2018-12-09 00:45:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 5496. [2018-12-09 00:45:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5496 states. [2018-12-09 00:45:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 12892 transitions. [2018-12-09 00:45:56,127 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 12892 transitions. Word has length 71 [2018-12-09 00:45:56,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:56,127 INFO L480 AbstractCegarLoop]: Abstraction has 5496 states and 12892 transitions. [2018-12-09 00:45:56,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:45:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 12892 transitions. [2018-12-09 00:45:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 00:45:56,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:56,130 INFO L402 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] [2018-12-09 00:45:56,130 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:56,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:56,130 INFO L82 PathProgramCache]: Analyzing trace with hash 399760570, now seen corresponding path program 1 times [2018-12-09 00:45:56,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:56,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:56,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:56,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:56,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:45:56,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:45:56,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:45:56,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:45:56,215 INFO L87 Difference]: Start difference. First operand 5496 states and 12892 transitions. Second operand 9 states. [2018-12-09 00:45:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:56,506 INFO L93 Difference]: Finished difference Result 7583 states and 17690 transitions. [2018-12-09 00:45:56,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 00:45:56,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2018-12-09 00:45:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:56,511 INFO L225 Difference]: With dead ends: 7583 [2018-12-09 00:45:56,511 INFO L226 Difference]: Without dead ends: 7528 [2018-12-09 00:45:56,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-09 00:45:56,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7528 states. [2018-12-09 00:45:56,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7528 to 5564. [2018-12-09 00:45:56,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5564 states. [2018-12-09 00:45:56,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5564 states to 5564 states and 12958 transitions. [2018-12-09 00:45:56,553 INFO L78 Accepts]: Start accepts. Automaton has 5564 states and 12958 transitions. Word has length 71 [2018-12-09 00:45:56,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:56,553 INFO L480 AbstractCegarLoop]: Abstraction has 5564 states and 12958 transitions. [2018-12-09 00:45:56,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:45:56,553 INFO L276 IsEmpty]: Start isEmpty. Operand 5564 states and 12958 transitions. [2018-12-09 00:45:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 00:45:56,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:56,557 INFO L402 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] [2018-12-09 00:45:56,557 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:56,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:56,557 INFO L82 PathProgramCache]: Analyzing trace with hash -226879915, now seen corresponding path program 1 times [2018-12-09 00:45:56,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:56,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:56,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:56,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:56,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:56,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:56,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:45:56,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:45:56,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:45:56,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:56,584 INFO L87 Difference]: Start difference. First operand 5564 states and 12958 transitions. Second operand 3 states. [2018-12-09 00:45:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:56,678 INFO L93 Difference]: Finished difference Result 7293 states and 16480 transitions. [2018-12-09 00:45:56,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:45:56,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-09 00:45:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:56,683 INFO L225 Difference]: With dead ends: 7293 [2018-12-09 00:45:56,683 INFO L226 Difference]: Without dead ends: 6965 [2018-12-09 00:45:56,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:45:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2018-12-09 00:45:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 6435. [2018-12-09 00:45:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6435 states. [2018-12-09 00:45:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6435 states to 6435 states and 14760 transitions. [2018-12-09 00:45:56,728 INFO L78 Accepts]: Start accepts. Automaton has 6435 states and 14760 transitions. Word has length 90 [2018-12-09 00:45:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:56,728 INFO L480 AbstractCegarLoop]: Abstraction has 6435 states and 14760 transitions. [2018-12-09 00:45:56,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:45:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 6435 states and 14760 transitions. [2018-12-09 00:45:56,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 00:45:56,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:56,733 INFO L402 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] [2018-12-09 00:45:56,733 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:56,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:56,733 INFO L82 PathProgramCache]: Analyzing trace with hash 871185909, now seen corresponding path program 1 times [2018-12-09 00:45:56,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:56,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:56,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:56,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:56,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:56,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:56,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:45:56,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:45:56,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:45:56,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:45:56,764 INFO L87 Difference]: Start difference. First operand 6435 states and 14760 transitions. Second operand 4 states. [2018-12-09 00:45:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:56,820 INFO L93 Difference]: Finished difference Result 6823 states and 15667 transitions. [2018-12-09 00:45:56,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:45:56,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-09 00:45:56,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:56,824 INFO L225 Difference]: With dead ends: 6823 [2018-12-09 00:45:56,824 INFO L226 Difference]: Without dead ends: 6823 [2018-12-09 00:45:56,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:45:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6823 states. [2018-12-09 00:45:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6823 to 6359. [2018-12-09 00:45:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6359 states. [2018-12-09 00:45:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6359 states to 6359 states and 14673 transitions. [2018-12-09 00:45:56,877 INFO L78 Accepts]: Start accepts. Automaton has 6359 states and 14673 transitions. Word has length 90 [2018-12-09 00:45:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:56,877 INFO L480 AbstractCegarLoop]: Abstraction has 6359 states and 14673 transitions. [2018-12-09 00:45:56,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:45:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 6359 states and 14673 transitions. [2018-12-09 00:45:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 00:45:56,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:56,881 INFO L402 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] [2018-12-09 00:45:56,881 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:56,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:56,882 INFO L82 PathProgramCache]: Analyzing trace with hash -71232549, now seen corresponding path program 1 times [2018-12-09 00:45:56,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:56,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:56,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:56,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:56,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:56,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:56,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:45:56,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:45:56,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:45:56,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:45:56,914 INFO L87 Difference]: Start difference. First operand 6359 states and 14673 transitions. Second operand 5 states. [2018-12-09 00:45:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:56,975 INFO L93 Difference]: Finished difference Result 7324 states and 16774 transitions. [2018-12-09 00:45:56,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:45:56,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 00:45:56,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:56,980 INFO L225 Difference]: With dead ends: 7324 [2018-12-09 00:45:56,980 INFO L226 Difference]: Without dead ends: 7324 [2018-12-09 00:45:56,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:45:56,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2018-12-09 00:45:57,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 5724. [2018-12-09 00:45:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5724 states. [2018-12-09 00:45:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5724 states to 5724 states and 13218 transitions. [2018-12-09 00:45:57,021 INFO L78 Accepts]: Start accepts. Automaton has 5724 states and 13218 transitions. Word has length 92 [2018-12-09 00:45:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:57,021 INFO L480 AbstractCegarLoop]: Abstraction has 5724 states and 13218 transitions. [2018-12-09 00:45:57,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:45:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 5724 states and 13218 transitions. [2018-12-09 00:45:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 00:45:57,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:57,027 INFO L402 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] [2018-12-09 00:45:57,028 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:57,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash -325969094, now seen corresponding path program 1 times [2018-12-09 00:45:57,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:57,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:57,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:57,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:57,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:45:57,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:45:57,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:45:57,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:45:57,067 INFO L87 Difference]: Start difference. First operand 5724 states and 13218 transitions. Second operand 5 states. [2018-12-09 00:45:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:57,312 INFO L93 Difference]: Finished difference Result 9776 states and 22784 transitions. [2018-12-09 00:45:57,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:45:57,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 00:45:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:57,318 INFO L225 Difference]: With dead ends: 9776 [2018-12-09 00:45:57,318 INFO L226 Difference]: Without dead ends: 9760 [2018-12-09 00:45:57,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:45:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9760 states. [2018-12-09 00:45:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 6548. [2018-12-09 00:45:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6548 states. [2018-12-09 00:45:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 15152 transitions. [2018-12-09 00:45:57,374 INFO L78 Accepts]: Start accepts. Automaton has 6548 states and 15152 transitions. Word has length 92 [2018-12-09 00:45:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:57,374 INFO L480 AbstractCegarLoop]: Abstraction has 6548 states and 15152 transitions. [2018-12-09 00:45:57,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:45:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 6548 states and 15152 transitions. [2018-12-09 00:45:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 00:45:57,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:57,379 INFO L402 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] [2018-12-09 00:45:57,379 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:57,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:57,379 INFO L82 PathProgramCache]: Analyzing trace with hash 918795387, now seen corresponding path program 1 times [2018-12-09 00:45:57,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:57,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:57,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:57,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:57,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:57,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:57,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:45:57,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:45:57,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:45:57,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:45:57,427 INFO L87 Difference]: Start difference. First operand 6548 states and 15152 transitions. Second operand 6 states. [2018-12-09 00:45:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:57,605 INFO L93 Difference]: Finished difference Result 8814 states and 20118 transitions. [2018-12-09 00:45:57,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:45:57,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-09 00:45:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:57,610 INFO L225 Difference]: With dead ends: 8814 [2018-12-09 00:45:57,610 INFO L226 Difference]: Without dead ends: 8814 [2018-12-09 00:45:57,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:45:57,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8814 states. [2018-12-09 00:45:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8814 to 6687. [2018-12-09 00:45:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6687 states. [2018-12-09 00:45:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 15343 transitions. [2018-12-09 00:45:57,663 INFO L78 Accepts]: Start accepts. Automaton has 6687 states and 15343 transitions. Word has length 92 [2018-12-09 00:45:57,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:57,664 INFO L480 AbstractCegarLoop]: Abstraction has 6687 states and 15343 transitions. [2018-12-09 00:45:57,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:45:57,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6687 states and 15343 transitions. [2018-12-09 00:45:57,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 00:45:57,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:57,668 INFO L402 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] [2018-12-09 00:45:57,668 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:57,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:57,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2034234414, now seen corresponding path program 1 times [2018-12-09 00:45:57,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:57,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:57,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:57,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:57,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:57,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:57,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:57,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:45:57,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:45:57,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:45:57,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:45:57,756 INFO L87 Difference]: Start difference. First operand 6687 states and 15343 transitions. Second operand 7 states. [2018-12-09 00:45:57,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:57,932 INFO L93 Difference]: Finished difference Result 8708 states and 19628 transitions. [2018-12-09 00:45:57,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:45:57,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-09 00:45:57,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:57,937 INFO L225 Difference]: With dead ends: 8708 [2018-12-09 00:45:57,937 INFO L226 Difference]: Without dead ends: 8600 [2018-12-09 00:45:57,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:45:57,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8600 states. [2018-12-09 00:45:57,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8600 to 7161. [2018-12-09 00:45:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7161 states. [2018-12-09 00:45:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7161 states to 7161 states and 16336 transitions. [2018-12-09 00:45:57,991 INFO L78 Accepts]: Start accepts. Automaton has 7161 states and 16336 transitions. Word has length 92 [2018-12-09 00:45:57,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:57,991 INFO L480 AbstractCegarLoop]: Abstraction has 7161 states and 16336 transitions. [2018-12-09 00:45:57,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:45:57,992 INFO L276 IsEmpty]: Start isEmpty. Operand 7161 states and 16336 transitions. [2018-12-09 00:45:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 00:45:57,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:57,996 INFO L402 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] [2018-12-09 00:45:57,997 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:57,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:57,997 INFO L82 PathProgramCache]: Analyzing trace with hash -42974929, now seen corresponding path program 1 times [2018-12-09 00:45:57,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:57,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:58,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:58,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:45:58,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:45:58,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:45:58,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:45:58,078 INFO L87 Difference]: Start difference. First operand 7161 states and 16336 transitions. Second operand 9 states. [2018-12-09 00:45:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:58,408 INFO L93 Difference]: Finished difference Result 10311 states and 23437 transitions. [2018-12-09 00:45:58,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 00:45:58,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2018-12-09 00:45:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:58,414 INFO L225 Difference]: With dead ends: 10311 [2018-12-09 00:45:58,415 INFO L226 Difference]: Without dead ends: 10279 [2018-12-09 00:45:58,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-09 00:45:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10279 states. [2018-12-09 00:45:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10279 to 8967. [2018-12-09 00:45:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8967 states. [2018-12-09 00:45:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8967 states to 8967 states and 20311 transitions. [2018-12-09 00:45:58,486 INFO L78 Accepts]: Start accepts. Automaton has 8967 states and 20311 transitions. Word has length 92 [2018-12-09 00:45:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:58,487 INFO L480 AbstractCegarLoop]: Abstraction has 8967 states and 20311 transitions. [2018-12-09 00:45:58,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:45:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 8967 states and 20311 transitions. [2018-12-09 00:45:58,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 00:45:58,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:58,493 INFO L402 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] [2018-12-09 00:45:58,493 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:58,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:58,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1839926288, now seen corresponding path program 1 times [2018-12-09 00:45:58,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:58,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:58,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:58,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:58,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:58,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:58,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:45:58,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:45:58,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:45:58,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:45:58,543 INFO L87 Difference]: Start difference. First operand 8967 states and 20311 transitions. Second operand 8 states. [2018-12-09 00:45:58,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:58,846 INFO L93 Difference]: Finished difference Result 13472 states and 31134 transitions. [2018-12-09 00:45:58,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 00:45:58,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-12-09 00:45:58,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:58,856 INFO L225 Difference]: With dead ends: 13472 [2018-12-09 00:45:58,856 INFO L226 Difference]: Without dead ends: 13472 [2018-12-09 00:45:58,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 00:45:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13472 states. [2018-12-09 00:45:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13472 to 9477. [2018-12-09 00:45:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9477 states. [2018-12-09 00:45:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9477 states to 9477 states and 21668 transitions. [2018-12-09 00:45:58,944 INFO L78 Accepts]: Start accepts. Automaton has 9477 states and 21668 transitions. Word has length 92 [2018-12-09 00:45:58,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:58,945 INFO L480 AbstractCegarLoop]: Abstraction has 9477 states and 21668 transitions. [2018-12-09 00:45:58,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:45:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 9477 states and 21668 transitions. [2018-12-09 00:45:58,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 00:45:58,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:58,951 INFO L402 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] [2018-12-09 00:45:58,951 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:58,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:58,952 INFO L82 PathProgramCache]: Analyzing trace with hash -952422607, now seen corresponding path program 1 times [2018-12-09 00:45:58,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:58,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:58,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:59,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:59,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:45:59,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:45:59,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:45:59,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:45:59,005 INFO L87 Difference]: Start difference. First operand 9477 states and 21668 transitions. Second operand 6 states. [2018-12-09 00:45:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:59,054 INFO L93 Difference]: Finished difference Result 12003 states and 27498 transitions. [2018-12-09 00:45:59,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:45:59,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-09 00:45:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:59,062 INFO L225 Difference]: With dead ends: 12003 [2018-12-09 00:45:59,062 INFO L226 Difference]: Without dead ends: 12003 [2018-12-09 00:45:59,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:45:59,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12003 states. [2018-12-09 00:45:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12003 to 9739. [2018-12-09 00:45:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9739 states. [2018-12-09 00:45:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9739 states to 9739 states and 22123 transitions. [2018-12-09 00:45:59,139 INFO L78 Accepts]: Start accepts. Automaton has 9739 states and 22123 transitions. Word has length 92 [2018-12-09 00:45:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:59,139 INFO L480 AbstractCegarLoop]: Abstraction has 9739 states and 22123 transitions. [2018-12-09 00:45:59,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:45:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 22123 transitions. [2018-12-09 00:45:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 00:45:59,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:59,146 INFO L402 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] [2018-12-09 00:45:59,146 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:59,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1019429360, now seen corresponding path program 1 times [2018-12-09 00:45:59,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:59,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:59,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:59,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:59,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:59,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:59,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:45:59,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:45:59,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:45:59,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:45:59,220 INFO L87 Difference]: Start difference. First operand 9739 states and 22123 transitions. Second operand 7 states. [2018-12-09 00:45:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:59,338 INFO L93 Difference]: Finished difference Result 13063 states and 30000 transitions. [2018-12-09 00:45:59,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:45:59,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-09 00:45:59,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:59,351 INFO L225 Difference]: With dead ends: 13063 [2018-12-09 00:45:59,351 INFO L226 Difference]: Without dead ends: 13063 [2018-12-09 00:45:59,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:45:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13063 states. [2018-12-09 00:45:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13063 to 9137. [2018-12-09 00:45:59,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9137 states. [2018-12-09 00:45:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9137 states to 9137 states and 20655 transitions. [2018-12-09 00:45:59,475 INFO L78 Accepts]: Start accepts. Automaton has 9137 states and 20655 transitions. Word has length 92 [2018-12-09 00:45:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:59,475 INFO L480 AbstractCegarLoop]: Abstraction has 9137 states and 20655 transitions. [2018-12-09 00:45:59,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:45:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 9137 states and 20655 transitions. [2018-12-09 00:45:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 00:45:59,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:59,483 INFO L402 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] [2018-12-09 00:45:59,483 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:59,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:59,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1543562384, now seen corresponding path program 1 times [2018-12-09 00:45:59,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:59,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:59,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:59,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:59,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:59,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:59,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:59,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:45:59,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:45:59,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:45:59,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:45:59,545 INFO L87 Difference]: Start difference. First operand 9137 states and 20655 transitions. Second operand 6 states. [2018-12-09 00:45:59,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:45:59,633 INFO L93 Difference]: Finished difference Result 8657 states and 19199 transitions. [2018-12-09 00:45:59,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:45:59,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-09 00:45:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:45:59,640 INFO L225 Difference]: With dead ends: 8657 [2018-12-09 00:45:59,641 INFO L226 Difference]: Without dead ends: 8657 [2018-12-09 00:45:59,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:45:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8657 states. [2018-12-09 00:45:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8657 to 5230. [2018-12-09 00:45:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5230 states. [2018-12-09 00:45:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 11603 transitions. [2018-12-09 00:45:59,705 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 11603 transitions. Word has length 92 [2018-12-09 00:45:59,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:45:59,705 INFO L480 AbstractCegarLoop]: Abstraction has 5230 states and 11603 transitions. [2018-12-09 00:45:59,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:45:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 11603 transitions. [2018-12-09 00:45:59,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 00:45:59,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:45:59,708 INFO L402 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] [2018-12-09 00:45:59,709 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:45:59,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:45:59,709 INFO L82 PathProgramCache]: Analyzing trace with hash -34543133, now seen corresponding path program 1 times [2018-12-09 00:45:59,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:45:59,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:45:59,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:59,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:45:59,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:45:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:45:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:45:59,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:45:59,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 00:45:59,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 00:45:59,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 00:45:59,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:45:59,846 INFO L87 Difference]: Start difference. First operand 5230 states and 11603 transitions. Second operand 13 states. [2018-12-09 00:46:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:46:00,877 INFO L93 Difference]: Finished difference Result 7435 states and 16209 transitions. [2018-12-09 00:46:00,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 00:46:00,877 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-12-09 00:46:00,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:46:00,885 INFO L225 Difference]: With dead ends: 7435 [2018-12-09 00:46:00,885 INFO L226 Difference]: Without dead ends: 7435 [2018-12-09 00:46:00,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-12-09 00:46:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2018-12-09 00:46:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 6126. [2018-12-09 00:46:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6126 states. [2018-12-09 00:46:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6126 states to 6126 states and 13501 transitions. [2018-12-09 00:46:00,940 INFO L78 Accepts]: Start accepts. Automaton has 6126 states and 13501 transitions. Word has length 94 [2018-12-09 00:46:00,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:46:00,940 INFO L480 AbstractCegarLoop]: Abstraction has 6126 states and 13501 transitions. [2018-12-09 00:46:00,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 00:46:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 6126 states and 13501 transitions. [2018-12-09 00:46:00,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 00:46:00,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:46:00,944 INFO L402 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] [2018-12-09 00:46:00,945 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:46:00,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:46:00,945 INFO L82 PathProgramCache]: Analyzing trace with hash 852960548, now seen corresponding path program 1 times [2018-12-09 00:46:00,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:46:00,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:46:00,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:46:00,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:46:00,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:46:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:46:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:46:01,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:46:01,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 00:46:01,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 00:46:01,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 00:46:01,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:46:01,048 INFO L87 Difference]: Start difference. First operand 6126 states and 13501 transitions. Second operand 11 states. [2018-12-09 00:46:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:46:02,209 INFO L93 Difference]: Finished difference Result 12214 states and 27167 transitions. [2018-12-09 00:46:02,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 00:46:02,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-12-09 00:46:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:46:02,218 INFO L225 Difference]: With dead ends: 12214 [2018-12-09 00:46:02,218 INFO L226 Difference]: Without dead ends: 8454 [2018-12-09 00:46:02,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 00:46:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8454 states. [2018-12-09 00:46:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8454 to 6145. [2018-12-09 00:46:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6145 states. [2018-12-09 00:46:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6145 states to 6145 states and 13469 transitions. [2018-12-09 00:46:02,274 INFO L78 Accepts]: Start accepts. Automaton has 6145 states and 13469 transitions. Word has length 94 [2018-12-09 00:46:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:46:02,275 INFO L480 AbstractCegarLoop]: Abstraction has 6145 states and 13469 transitions. [2018-12-09 00:46:02,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 00:46:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 6145 states and 13469 transitions. [2018-12-09 00:46:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 00:46:02,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:46:02,278 INFO L402 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] [2018-12-09 00:46:02,279 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:46:02,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:46:02,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1818748071, now seen corresponding path program 2 times [2018-12-09 00:46:02,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:46:02,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:46:02,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:46:02,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:46:02,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:46:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:46:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:46:02,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:46:02,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:46:02,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:46:02,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:46:02,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:46:02,370 INFO L87 Difference]: Start difference. First operand 6145 states and 13469 transitions. Second operand 8 states. [2018-12-09 00:46:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:46:02,553 INFO L93 Difference]: Finished difference Result 7558 states and 16521 transitions. [2018-12-09 00:46:02,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 00:46:02,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-09 00:46:02,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:46:02,558 INFO L225 Difference]: With dead ends: 7558 [2018-12-09 00:46:02,558 INFO L226 Difference]: Without dead ends: 7558 [2018-12-09 00:46:02,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-09 00:46:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2018-12-09 00:46:02,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 6568. [2018-12-09 00:46:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6568 states. [2018-12-09 00:46:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6568 states to 6568 states and 14369 transitions. [2018-12-09 00:46:02,604 INFO L78 Accepts]: Start accepts. Automaton has 6568 states and 14369 transitions. Word has length 94 [2018-12-09 00:46:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:46:02,605 INFO L480 AbstractCegarLoop]: Abstraction has 6568 states and 14369 transitions. [2018-12-09 00:46:02,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:46:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6568 states and 14369 transitions. [2018-12-09 00:46:02,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 00:46:02,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:46:02,609 INFO L402 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] [2018-12-09 00:46:02,609 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:46:02,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:46:02,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1588715544, now seen corresponding path program 2 times [2018-12-09 00:46:02,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:46:02,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:46:02,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:46:02,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:46:02,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:46:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:46:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:46:02,661 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 00:46:02,751 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 00:46:02,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:46:02 BasicIcfg [2018-12-09 00:46:02,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:46:02,752 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:46:02,752 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:46:02,752 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:46:02,753 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:45:46" (3/4) ... [2018-12-09 00:46:02,754 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 00:46:02,844 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4fdc01cb-b877-4639-9adb-83e186d6cbd9/bin-2019/uautomizer/witness.graphml [2018-12-09 00:46:02,844 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:46:02,845 INFO L168 Benchmark]: Toolchain (without parser) took 17457.00 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 951.7 MB in the beginning and 1.5 GB in the end (delta: -541.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-09 00:46:02,846 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:46:02,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -128.5 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:46:02,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-09 00:46:02,846 INFO L168 Benchmark]: Boogie Preprocessor took 20.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:46:02,846 INFO L168 Benchmark]: RCFGBuilder took 335.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:46:02,847 INFO L168 Benchmark]: TraceAbstraction took 16655.85 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -496.9 MB). Peak memory consumption was 969.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:46:02,847 INFO L168 Benchmark]: Witness Printer took 92.00 ms. Allocated memory is still 2.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:46:02,848 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -128.5 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 335.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16655.85 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -496.9 MB). Peak memory consumption was 969.0 MB. Max. memory is 11.5 GB. * Witness Printer took 92.00 ms. Allocated memory is still 2.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L681] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L682] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L683] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L684] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L689] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L690] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L691] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L692] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L693] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] -1 pthread_t t1445; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] FCALL, FORK -1 pthread_create(&t1445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 1 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1446; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 2 [L730] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L731] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L732] 1 y$flush_delayed = weak$$choice2 [L733] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L735] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L736] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L740] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$flush_delayed ? y$mem_tmp : y [L743] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L720] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L746] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L778] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L784] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 3 error locations. UNSAFE Result, 16.5s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8356 SDtfs, 9100 SDslu, 20553 SDs, 0 SdLazy, 8607 SolverSat, 425 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 90 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34805occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 32 MinimizatonAttempts, 86864 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2442 NumberOfCodeBlocks, 2442 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2316 ConstructedInterpolants, 0 QuantifiedInterpolants, 502579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...