./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_tso.oepc_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_d82f45c5-20c0-47a1-ac0c-577abbf491a7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d82f45c5-20c0-47a1-ac0c-577abbf491a7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d82f45c5-20c0-47a1-ac0c-577abbf491a7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d82f45c5-20c0-47a1-ac0c-577abbf491a7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d82f45c5-20c0-47a1-ac0c-577abbf491a7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d82f45c5-20c0-47a1-ac0c-577abbf491a7/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 6aaa902a47ad4e36fdf776a2739bece57b1e8f78 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 04:19:25,336 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:19:25,337 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:19:25,345 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:19:25,345 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:19:25,346 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:19:25,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:19:25,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:19:25,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:19:25,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:19:25,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:19:25,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:19:25,351 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:19:25,352 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:19:25,353 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:19:25,353 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:19:25,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:19:25,355 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:19:25,357 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:19:25,358 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:19:25,359 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:19:25,359 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:19:25,361 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:19:25,361 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:19:25,361 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:19:25,362 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:19:25,363 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:19:25,363 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:19:25,364 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:19:25,364 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:19:25,365 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:19:25,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:19:25,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:19:25,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:19:25,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:19:25,366 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:19:25,367 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d82f45c5-20c0-47a1-ac0c-577abbf491a7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 04:19:25,376 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:19:25,376 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:19:25,377 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 04:19:25,377 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 04:19:25,377 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 04:19:25,377 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 04:19:25,377 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 04:19:25,377 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:19:25,378 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:19:25,378 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:19:25,378 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:19:25,378 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:19:25,378 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 04:19:25,378 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 04:19:25,378 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 04:19:25,378 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:19:25,378 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:19:25,378 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 04:19:25,379 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 04:19:25,379 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:19:25,379 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:19:25,379 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 04:19:25,379 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 04:19:25,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:19:25,379 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:19:25,379 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 04:19:25,379 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 04:19:25,380 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 04:19:25,380 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 04:19:25,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 04:19:25,380 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_d82f45c5-20c0-47a1-ac0c-577abbf491a7/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 -> 6aaa902a47ad4e36fdf776a2739bece57b1e8f78 [2018-12-09 04:19:25,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:19:25,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:19:25,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:19:25,410 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:19:25,410 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:19:25,411 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d82f45c5-20c0-47a1-ac0c-577abbf491a7/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix022_tso.oepc_false-unreach-call.i [2018-12-09 04:19:25,444 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d82f45c5-20c0-47a1-ac0c-577abbf491a7/bin-2019/uautomizer/data/f09527945/3c362fc12ca94a05abdc6ade685c7ed8/FLAG72e87065d [2018-12-09 04:19:25,883 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:19:25,883 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d82f45c5-20c0-47a1-ac0c-577abbf491a7/sv-benchmarks/c/pthread-wmm/mix022_tso.oepc_false-unreach-call.i [2018-12-09 04:19:25,891 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d82f45c5-20c0-47a1-ac0c-577abbf491a7/bin-2019/uautomizer/data/f09527945/3c362fc12ca94a05abdc6ade685c7ed8/FLAG72e87065d [2018-12-09 04:19:25,903 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d82f45c5-20c0-47a1-ac0c-577abbf491a7/bin-2019/uautomizer/data/f09527945/3c362fc12ca94a05abdc6ade685c7ed8 [2018-12-09 04:19:25,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:19:25,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:19:25,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:19:25,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:19:25,910 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:19:25,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:19:25" (1/1) ... [2018-12-09 04:19:25,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4599fb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:25, skipping insertion in model container [2018-12-09 04:19:25,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:19:25" (1/1) ... [2018-12-09 04:19:25,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:19:25,944 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:19:26,160 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:19:26,170 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:19:26,274 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:19:26,309 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:19:26,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:26 WrapperNode [2018-12-09 04:19:26,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:19:26,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:19:26,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:19:26,310 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:19:26,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:26" (1/1) ... [2018-12-09 04:19:26,329 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:26" (1/1) ... [2018-12-09 04:19:26,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:19:26,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:19:26,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:19:26,350 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:19:26,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:26" (1/1) ... [2018-12-09 04:19:26,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:26" (1/1) ... [2018-12-09 04:19:26,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:26" (1/1) ... [2018-12-09 04:19:26,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:26" (1/1) ... [2018-12-09 04:19:26,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:26" (1/1) ... [2018-12-09 04:19:26,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:26" (1/1) ... [2018-12-09 04:19:26,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:26" (1/1) ... [2018-12-09 04:19:26,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:19:26,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:19:26,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:19:26,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:19:26,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d82f45c5-20c0-47a1-ac0c-577abbf491a7/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 04:19:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 04:19:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 04:19:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 04:19:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 04:19:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 04:19:26,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 04:19:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 04:19:26,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 04:19:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 04:19:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:19:26,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:19:26,406 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 04:19:26,783 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:19:26,783 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 04:19:26,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:19:26 BoogieIcfgContainer [2018-12-09 04:19:26,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:19:26,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 04:19:26,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 04:19:26,786 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 04:19:26,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:19:25" (1/3) ... [2018-12-09 04:19:26,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585a0c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:19:26, skipping insertion in model container [2018-12-09 04:19:26,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:19:26" (2/3) ... [2018-12-09 04:19:26,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585a0c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:19:26, skipping insertion in model container [2018-12-09 04:19:26,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:19:26" (3/3) ... [2018-12-09 04:19:26,788 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_tso.oepc_false-unreach-call.i [2018-12-09 04:19:26,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,812 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,813 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,813 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,813 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,818 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,818 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,818 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,818 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,819 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,825 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,826 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,827 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,828 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,829 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,830 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,831 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:19:26,841 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 04:19:26,841 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 04:19:26,846 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 04:19:26,855 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 04:19:26,870 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 04:19:26,870 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 04:19:26,871 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 04:19:26,871 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 04:19:26,871 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:19:26,871 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:19:26,871 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 04:19:26,871 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:19:26,871 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 04:19:26,882 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 184places, 243 transitions [2018-12-09 04:19:31,430 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 75068 states. [2018-12-09 04:19:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 75068 states. [2018-12-09 04:19:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 04:19:31,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:31,437 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] [2018-12-09 04:19:31,438 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:31,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:31,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1573700734, now seen corresponding path program 1 times [2018-12-09 04:19:31,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:31,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:31,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:31,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:31,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:31,594 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 04:19:31,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:31,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:19:31,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:19:31,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:19:31,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:19:31,608 INFO L87 Difference]: Start difference. First operand 75068 states. Second operand 4 states. [2018-12-09 04:19:32,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:32,531 INFO L93 Difference]: Finished difference Result 142996 states and 583892 transitions. [2018-12-09 04:19:32,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:19:32,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-09 04:19:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:32,945 INFO L225 Difference]: With dead ends: 142996 [2018-12-09 04:19:32,946 INFO L226 Difference]: Without dead ends: 126812 [2018-12-09 04:19:32,947 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 04:19:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126812 states. [2018-12-09 04:19:35,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126812 to 67930. [2018-12-09 04:19:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67930 states. [2018-12-09 04:19:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67930 states to 67930 states and 279065 transitions. [2018-12-09 04:19:35,403 INFO L78 Accepts]: Start accepts. Automaton has 67930 states and 279065 transitions. Word has length 37 [2018-12-09 04:19:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:35,404 INFO L480 AbstractCegarLoop]: Abstraction has 67930 states and 279065 transitions. [2018-12-09 04:19:35,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:19:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 67930 states and 279065 transitions. [2018-12-09 04:19:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 04:19:35,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:35,407 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 04:19:35,407 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:35,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:35,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1444770339, now seen corresponding path program 1 times [2018-12-09 04:19:35,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:35,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:35,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:35,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:35,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:35,464 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 04:19:35,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:35,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:19:35,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:19:35,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:19:35,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:19:35,466 INFO L87 Difference]: Start difference. First operand 67930 states and 279065 transitions. Second operand 5 states. [2018-12-09 04:19:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:36,556 INFO L93 Difference]: Finished difference Result 201246 states and 776001 transitions. [2018-12-09 04:19:36,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:19:36,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-09 04:19:36,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:38,570 INFO L225 Difference]: With dead ends: 201246 [2018-12-09 04:19:38,570 INFO L226 Difference]: Without dead ends: 201086 [2018-12-09 04:19:38,571 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 04:19:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201086 states. [2018-12-09 04:19:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201086 to 109739. [2018-12-09 04:19:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109739 states. [2018-12-09 04:19:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109739 states to 109739 states and 422911 transitions. [2018-12-09 04:19:41,847 INFO L78 Accepts]: Start accepts. Automaton has 109739 states and 422911 transitions. Word has length 44 [2018-12-09 04:19:41,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:41,848 INFO L480 AbstractCegarLoop]: Abstraction has 109739 states and 422911 transitions. [2018-12-09 04:19:41,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:19:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 109739 states and 422911 transitions. [2018-12-09 04:19:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 04:19:41,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:41,850 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 04:19:41,850 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:41,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash -991995994, now seen corresponding path program 1 times [2018-12-09 04:19:41,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:41,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:41,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:41,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:41,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:41,891 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 04:19:41,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:41,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:19:41,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:19:41,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:19:41,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:19:41,892 INFO L87 Difference]: Start difference. First operand 109739 states and 422911 transitions. Second operand 4 states. [2018-12-09 04:19:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:41,976 INFO L93 Difference]: Finished difference Result 26128 states and 89696 transitions. [2018-12-09 04:19:41,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:19:41,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-09 04:19:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:42,008 INFO L225 Difference]: With dead ends: 26128 [2018-12-09 04:19:42,008 INFO L226 Difference]: Without dead ends: 24431 [2018-12-09 04:19:42,009 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 04:19:42,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24431 states. [2018-12-09 04:19:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24431 to 24431. [2018-12-09 04:19:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24431 states. [2018-12-09 04:19:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24431 states to 24431 states and 84249 transitions. [2018-12-09 04:19:42,294 INFO L78 Accepts]: Start accepts. Automaton has 24431 states and 84249 transitions. Word has length 45 [2018-12-09 04:19:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:42,294 INFO L480 AbstractCegarLoop]: Abstraction has 24431 states and 84249 transitions. [2018-12-09 04:19:42,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:19:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 24431 states and 84249 transitions. [2018-12-09 04:19:42,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 04:19:42,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:42,297 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] [2018-12-09 04:19:42,298 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:42,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:42,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1579757532, now seen corresponding path program 1 times [2018-12-09 04:19:42,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:42,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:42,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:42,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:42,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:42,348 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 04:19:42,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:42,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:19:42,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:19:42,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:19:42,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:19:42,349 INFO L87 Difference]: Start difference. First operand 24431 states and 84249 transitions. Second operand 4 states. [2018-12-09 04:19:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:42,583 INFO L93 Difference]: Finished difference Result 33039 states and 111277 transitions. [2018-12-09 04:19:42,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:19:42,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 04:19:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:42,625 INFO L225 Difference]: With dead ends: 33039 [2018-12-09 04:19:42,625 INFO L226 Difference]: Without dead ends: 33039 [2018-12-09 04:19:42,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 04:19:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33039 states. [2018-12-09 04:19:42,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33039 to 27711. [2018-12-09 04:19:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27711 states. [2018-12-09 04:19:42,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27711 states to 27711 states and 94397 transitions. [2018-12-09 04:19:42,973 INFO L78 Accepts]: Start accepts. Automaton has 27711 states and 94397 transitions. Word has length 58 [2018-12-09 04:19:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:42,973 INFO L480 AbstractCegarLoop]: Abstraction has 27711 states and 94397 transitions. [2018-12-09 04:19:42,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:19:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 27711 states and 94397 transitions. [2018-12-09 04:19:42,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 04:19:42,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:42,977 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] [2018-12-09 04:19:42,977 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:42,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:42,977 INFO L82 PathProgramCache]: Analyzing trace with hash -992403568, now seen corresponding path program 1 times [2018-12-09 04:19:42,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:42,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:42,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:43,027 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 04:19:43,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:43,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:19:43,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:19:43,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:19:43,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:19:43,029 INFO L87 Difference]: Start difference. First operand 27711 states and 94397 transitions. Second operand 4 states. [2018-12-09 04:19:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:43,573 INFO L93 Difference]: Finished difference Result 34248 states and 114231 transitions. [2018-12-09 04:19:43,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:19:43,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 04:19:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:43,616 INFO L225 Difference]: With dead ends: 34248 [2018-12-09 04:19:43,616 INFO L226 Difference]: Without dead ends: 34248 [2018-12-09 04:19:43,616 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 04:19:43,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34248 states. [2018-12-09 04:19:43,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34248 to 31773. [2018-12-09 04:19:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31773 states. [2018-12-09 04:19:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31773 states to 31773 states and 107008 transitions. [2018-12-09 04:19:44,107 INFO L78 Accepts]: Start accepts. Automaton has 31773 states and 107008 transitions. Word has length 58 [2018-12-09 04:19:44,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:44,107 INFO L480 AbstractCegarLoop]: Abstraction has 31773 states and 107008 transitions. [2018-12-09 04:19:44,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:19:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 31773 states and 107008 transitions. [2018-12-09 04:19:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 04:19:44,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:44,111 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] [2018-12-09 04:19:44,111 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:44,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:44,111 INFO L82 PathProgramCache]: Analyzing trace with hash 360906129, now seen corresponding path program 1 times [2018-12-09 04:19:44,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:44,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:44,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:44,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:44,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:44,153 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 04:19:44,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:44,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:19:44,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:19:44,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:19:44,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:19:44,154 INFO L87 Difference]: Start difference. First operand 31773 states and 107008 transitions. Second operand 6 states. [2018-12-09 04:19:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:44,670 INFO L93 Difference]: Finished difference Result 46397 states and 155016 transitions. [2018-12-09 04:19:44,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:19:44,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 04:19:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:44,728 INFO L225 Difference]: With dead ends: 46397 [2018-12-09 04:19:44,728 INFO L226 Difference]: Without dead ends: 46365 [2018-12-09 04:19:44,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 04:19:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46365 states. [2018-12-09 04:19:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46365 to 37325. [2018-12-09 04:19:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37325 states. [2018-12-09 04:19:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37325 states to 37325 states and 124568 transitions. [2018-12-09 04:19:45,191 INFO L78 Accepts]: Start accepts. Automaton has 37325 states and 124568 transitions. Word has length 58 [2018-12-09 04:19:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:45,191 INFO L480 AbstractCegarLoop]: Abstraction has 37325 states and 124568 transitions. [2018-12-09 04:19:45,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:19:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 37325 states and 124568 transitions. [2018-12-09 04:19:45,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 04:19:45,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:45,207 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] [2018-12-09 04:19:45,207 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:45,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:45,208 INFO L82 PathProgramCache]: Analyzing trace with hash -124637825, now seen corresponding path program 1 times [2018-12-09 04:19:45,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:45,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:45,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:45,270 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 04:19:45,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:45,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:19:45,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:19:45,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:19:45,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:19:45,271 INFO L87 Difference]: Start difference. First operand 37325 states and 124568 transitions. Second operand 4 states. [2018-12-09 04:19:45,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:45,777 INFO L93 Difference]: Finished difference Result 59481 states and 195605 transitions. [2018-12-09 04:19:45,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:19:45,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-09 04:19:45,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:45,859 INFO L225 Difference]: With dead ends: 59481 [2018-12-09 04:19:45,860 INFO L226 Difference]: Without dead ends: 59285 [2018-12-09 04:19:45,860 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 04:19:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59285 states. [2018-12-09 04:19:46,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59285 to 50769. [2018-12-09 04:19:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50769 states. [2018-12-09 04:19:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50769 states to 50769 states and 168555 transitions. [2018-12-09 04:19:46,583 INFO L78 Accepts]: Start accepts. Automaton has 50769 states and 168555 transitions. Word has length 72 [2018-12-09 04:19:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:46,583 INFO L480 AbstractCegarLoop]: Abstraction has 50769 states and 168555 transitions. [2018-12-09 04:19:46,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:19:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 50769 states and 168555 transitions. [2018-12-09 04:19:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 04:19:46,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:46,599 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] [2018-12-09 04:19:46,599 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:46,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:46,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1228671872, now seen corresponding path program 1 times [2018-12-09 04:19:46,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:46,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:46,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:46,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:46,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:46,695 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 04:19:46,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:46,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 04:19:46,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:19:46,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:19:46,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:19:46,695 INFO L87 Difference]: Start difference. First operand 50769 states and 168555 transitions. Second operand 8 states. [2018-12-09 04:19:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:47,785 INFO L93 Difference]: Finished difference Result 74755 states and 241276 transitions. [2018-12-09 04:19:47,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 04:19:47,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-12-09 04:19:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:47,887 INFO L225 Difference]: With dead ends: 74755 [2018-12-09 04:19:47,887 INFO L226 Difference]: Without dead ends: 74491 [2018-12-09 04:19:47,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-09 04:19:48,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74491 states. [2018-12-09 04:19:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74491 to 59134. [2018-12-09 04:19:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59134 states. [2018-12-09 04:19:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59134 states to 59134 states and 194352 transitions. [2018-12-09 04:19:48,670 INFO L78 Accepts]: Start accepts. Automaton has 59134 states and 194352 transitions. Word has length 72 [2018-12-09 04:19:48,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:48,670 INFO L480 AbstractCegarLoop]: Abstraction has 59134 states and 194352 transitions. [2018-12-09 04:19:48,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:19:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 59134 states and 194352 transitions. [2018-12-09 04:19:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 04:19:48,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:48,693 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] [2018-12-09 04:19:48,693 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:48,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:48,693 INFO L82 PathProgramCache]: Analyzing trace with hash 935268865, now seen corresponding path program 1 times [2018-12-09 04:19:48,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:48,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:48,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:48,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:48,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:48,734 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 04:19:48,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:48,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:19:48,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:19:48,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:19:48,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:19:48,734 INFO L87 Difference]: Start difference. First operand 59134 states and 194352 transitions. Second operand 5 states. [2018-12-09 04:19:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:48,779 INFO L93 Difference]: Finished difference Result 8418 states and 21911 transitions. [2018-12-09 04:19:48,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:19:48,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-09 04:19:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:48,784 INFO L225 Difference]: With dead ends: 8418 [2018-12-09 04:19:48,784 INFO L226 Difference]: Without dead ends: 6688 [2018-12-09 04:19:48,785 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 04:19:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6688 states. [2018-12-09 04:19:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6688 to 5491. [2018-12-09 04:19:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5491 states. [2018-12-09 04:19:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5491 states to 5491 states and 14306 transitions. [2018-12-09 04:19:48,828 INFO L78 Accepts]: Start accepts. Automaton has 5491 states and 14306 transitions. Word has length 72 [2018-12-09 04:19:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:48,828 INFO L480 AbstractCegarLoop]: Abstraction has 5491 states and 14306 transitions. [2018-12-09 04:19:48,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:19:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 5491 states and 14306 transitions. [2018-12-09 04:19:48,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 04:19:48,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:48,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:48,833 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:48,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:48,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1186244919, now seen corresponding path program 1 times [2018-12-09 04:19:48,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:48,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:48,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:48,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:48,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:48,891 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 04:19:48,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:48,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:19:48,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:19:48,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:19:48,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:19:48,891 INFO L87 Difference]: Start difference. First operand 5491 states and 14306 transitions. Second operand 6 states. [2018-12-09 04:19:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:49,296 INFO L93 Difference]: Finished difference Result 6815 states and 17529 transitions. [2018-12-09 04:19:49,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:19:49,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-12-09 04:19:49,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:49,300 INFO L225 Difference]: With dead ends: 6815 [2018-12-09 04:19:49,301 INFO L226 Difference]: Without dead ends: 6815 [2018-12-09 04:19:49,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:19:49,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6815 states. [2018-12-09 04:19:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6815 to 5717. [2018-12-09 04:19:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5717 states. [2018-12-09 04:19:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5717 states to 5717 states and 14885 transitions. [2018-12-09 04:19:49,343 INFO L78 Accepts]: Start accepts. Automaton has 5717 states and 14885 transitions. Word has length 107 [2018-12-09 04:19:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:49,344 INFO L480 AbstractCegarLoop]: Abstraction has 5717 states and 14885 transitions. [2018-12-09 04:19:49,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:19:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 5717 states and 14885 transitions. [2018-12-09 04:19:49,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 04:19:49,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:49,348 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:49,348 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:49,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:49,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1650504994, now seen corresponding path program 1 times [2018-12-09 04:19:49,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:49,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:49,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:49,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:49,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:49,403 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 04:19:49,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:49,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:19:49,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:19:49,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:19:49,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:19:49,404 INFO L87 Difference]: Start difference. First operand 5717 states and 14885 transitions. Second operand 7 states. [2018-12-09 04:19:49,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:49,714 INFO L93 Difference]: Finished difference Result 6354 states and 16397 transitions. [2018-12-09 04:19:49,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:19:49,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-12-09 04:19:49,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:49,719 INFO L225 Difference]: With dead ends: 6354 [2018-12-09 04:19:49,719 INFO L226 Difference]: Without dead ends: 6354 [2018-12-09 04:19:49,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:19:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6354 states. [2018-12-09 04:19:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6354 to 5775. [2018-12-09 04:19:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5775 states. [2018-12-09 04:19:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5775 states to 5775 states and 15019 transitions. [2018-12-09 04:19:49,761 INFO L78 Accepts]: Start accepts. Automaton has 5775 states and 15019 transitions. Word has length 107 [2018-12-09 04:19:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:49,762 INFO L480 AbstractCegarLoop]: Abstraction has 5775 states and 15019 transitions. [2018-12-09 04:19:49,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:19:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5775 states and 15019 transitions. [2018-12-09 04:19:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 04:19:49,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:49,766 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:49,766 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:49,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:49,766 INFO L82 PathProgramCache]: Analyzing trace with hash -2134755490, now seen corresponding path program 2 times [2018-12-09 04:19:49,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:49,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:49,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:49,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:49,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:49,806 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 04:19:49,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:49,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:19:49,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:19:49,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:19:49,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:19:49,806 INFO L87 Difference]: Start difference. First operand 5775 states and 15019 transitions. Second operand 5 states. [2018-12-09 04:19:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:49,964 INFO L93 Difference]: Finished difference Result 6224 states and 16025 transitions. [2018-12-09 04:19:49,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:19:49,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-12-09 04:19:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:49,969 INFO L225 Difference]: With dead ends: 6224 [2018-12-09 04:19:49,969 INFO L226 Difference]: Without dead ends: 6224 [2018-12-09 04:19:49,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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 04:19:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2018-12-09 04:19:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 5790. [2018-12-09 04:19:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5790 states. [2018-12-09 04:19:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5790 states to 5790 states and 15050 transitions. [2018-12-09 04:19:50,015 INFO L78 Accepts]: Start accepts. Automaton has 5790 states and 15050 transitions. Word has length 107 [2018-12-09 04:19:50,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:50,015 INFO L480 AbstractCegarLoop]: Abstraction has 5790 states and 15050 transitions. [2018-12-09 04:19:50,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:19:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 5790 states and 15050 transitions. [2018-12-09 04:19:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 04:19:50,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:50,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:50,020 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:50,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:50,020 INFO L82 PathProgramCache]: Analyzing trace with hash -970977122, now seen corresponding path program 3 times [2018-12-09 04:19:50,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:50,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:50,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:50,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:19:50,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:50,081 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 04:19:50,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:50,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:19:50,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:19:50,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:19:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:19:50,082 INFO L87 Difference]: Start difference. First operand 5790 states and 15050 transitions. Second operand 4 states. [2018-12-09 04:19:50,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:50,204 INFO L93 Difference]: Finished difference Result 6378 states and 16425 transitions. [2018-12-09 04:19:50,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:19:50,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-09 04:19:50,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:50,209 INFO L225 Difference]: With dead ends: 6378 [2018-12-09 04:19:50,209 INFO L226 Difference]: Without dead ends: 6350 [2018-12-09 04:19:50,209 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 04:19:50,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6350 states. [2018-12-09 04:19:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6350 to 6297. [2018-12-09 04:19:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6297 states. [2018-12-09 04:19:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6297 states to 6297 states and 16261 transitions. [2018-12-09 04:19:50,260 INFO L78 Accepts]: Start accepts. Automaton has 6297 states and 16261 transitions. Word has length 107 [2018-12-09 04:19:50,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:50,260 INFO L480 AbstractCegarLoop]: Abstraction has 6297 states and 16261 transitions. [2018-12-09 04:19:50,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:19:50,260 INFO L276 IsEmpty]: Start isEmpty. Operand 6297 states and 16261 transitions. [2018-12-09 04:19:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 04:19:50,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:50,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:50,265 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:50,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:50,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1396099, now seen corresponding path program 1 times [2018-12-09 04:19:50,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:50,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:50,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:50,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:19:50,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:50,286 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 04:19:50,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:50,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:19:50,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:19:50,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:19:50,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:19:50,287 INFO L87 Difference]: Start difference. First operand 6297 states and 16261 transitions. Second operand 3 states. [2018-12-09 04:19:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:50,416 INFO L93 Difference]: Finished difference Result 7650 states and 19424 transitions. [2018-12-09 04:19:50,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:19:50,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-12-09 04:19:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:50,424 INFO L225 Difference]: With dead ends: 7650 [2018-12-09 04:19:50,424 INFO L226 Difference]: Without dead ends: 7650 [2018-12-09 04:19:50,424 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 04:19:50,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7650 states. [2018-12-09 04:19:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7650 to 7325. [2018-12-09 04:19:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7325 states. [2018-12-09 04:19:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7325 states to 7325 states and 18703 transitions. [2018-12-09 04:19:50,509 INFO L78 Accepts]: Start accepts. Automaton has 7325 states and 18703 transitions. Word has length 107 [2018-12-09 04:19:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:50,509 INFO L480 AbstractCegarLoop]: Abstraction has 7325 states and 18703 transitions. [2018-12-09 04:19:50,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:19:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 7325 states and 18703 transitions. [2018-12-09 04:19:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 04:19:50,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:50,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:50,517 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:50,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:50,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2076167123, now seen corresponding path program 2 times [2018-12-09 04:19:50,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:50,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:50,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:50,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:50,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:50,565 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 04:19:50,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:50,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:19:50,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:19:50,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:19:50,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:19:50,566 INFO L87 Difference]: Start difference. First operand 7325 states and 18703 transitions. Second operand 5 states. [2018-12-09 04:19:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:50,790 INFO L93 Difference]: Finished difference Result 8240 states and 20813 transitions. [2018-12-09 04:19:50,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:19:50,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-12-09 04:19:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:50,796 INFO L225 Difference]: With dead ends: 8240 [2018-12-09 04:19:50,796 INFO L226 Difference]: Without dead ends: 8212 [2018-12-09 04:19:50,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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 04:19:50,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8212 states. [2018-12-09 04:19:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8212 to 7711. [2018-12-09 04:19:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7711 states. [2018-12-09 04:19:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7711 states to 7711 states and 19562 transitions. [2018-12-09 04:19:50,855 INFO L78 Accepts]: Start accepts. Automaton has 7711 states and 19562 transitions. Word has length 107 [2018-12-09 04:19:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:50,855 INFO L480 AbstractCegarLoop]: Abstraction has 7711 states and 19562 transitions. [2018-12-09 04:19:50,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:19:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 7711 states and 19562 transitions. [2018-12-09 04:19:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 04:19:50,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:50,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:50,860 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:50,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:50,860 INFO L82 PathProgramCache]: Analyzing trace with hash 887083414, now seen corresponding path program 1 times [2018-12-09 04:19:50,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:50,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:50,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:50,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:19:50,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:50,890 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 04:19:50,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:50,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:19:50,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:19:50,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:19:50,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:19:50,891 INFO L87 Difference]: Start difference. First operand 7711 states and 19562 transitions. Second operand 4 states. [2018-12-09 04:19:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:51,077 INFO L93 Difference]: Finished difference Result 11322 states and 28079 transitions. [2018-12-09 04:19:51,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:19:51,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-09 04:19:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:51,085 INFO L225 Difference]: With dead ends: 11322 [2018-12-09 04:19:51,085 INFO L226 Difference]: Without dead ends: 11236 [2018-12-09 04:19:51,085 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 04:19:51,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11236 states. [2018-12-09 04:19:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11236 to 8377. [2018-12-09 04:19:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8377 states. [2018-12-09 04:19:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8377 states to 8377 states and 21224 transitions. [2018-12-09 04:19:51,155 INFO L78 Accepts]: Start accepts. Automaton has 8377 states and 21224 transitions. Word has length 107 [2018-12-09 04:19:51,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:51,155 INFO L480 AbstractCegarLoop]: Abstraction has 8377 states and 21224 transitions. [2018-12-09 04:19:51,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:19:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 8377 states and 21224 transitions. [2018-12-09 04:19:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 04:19:51,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:51,161 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:51,161 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:51,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:51,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1761062012, now seen corresponding path program 2 times [2018-12-09 04:19:51,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:51,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:51,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:51,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:51,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:51,206 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 04:19:51,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:51,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:19:51,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:19:51,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:19:51,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:19:51,207 INFO L87 Difference]: Start difference. First operand 8377 states and 21224 transitions. Second operand 4 states. [2018-12-09 04:19:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:51,318 INFO L93 Difference]: Finished difference Result 9141 states and 22962 transitions. [2018-12-09 04:19:51,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:19:51,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-09 04:19:51,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:51,324 INFO L225 Difference]: With dead ends: 9141 [2018-12-09 04:19:51,324 INFO L226 Difference]: Without dead ends: 9141 [2018-12-09 04:19:51,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:19:51,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9141 states. [2018-12-09 04:19:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9141 to 8185. [2018-12-09 04:19:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8185 states. [2018-12-09 04:19:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8185 states to 8185 states and 20787 transitions. [2018-12-09 04:19:51,385 INFO L78 Accepts]: Start accepts. Automaton has 8185 states and 20787 transitions. Word has length 107 [2018-12-09 04:19:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:51,386 INFO L480 AbstractCegarLoop]: Abstraction has 8185 states and 20787 transitions. [2018-12-09 04:19:51,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:19:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 8185 states and 20787 transitions. [2018-12-09 04:19:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 04:19:51,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:51,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:51,391 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:51,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:51,391 INFO L82 PathProgramCache]: Analyzing trace with hash -375195506, now seen corresponding path program 1 times [2018-12-09 04:19:51,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:51,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:51,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:51,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:19:51,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:51,455 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 04:19:51,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:51,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:19:51,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:19:51,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:19:51,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:19:51,455 INFO L87 Difference]: Start difference. First operand 8185 states and 20787 transitions. Second operand 7 states. [2018-12-09 04:19:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:51,818 INFO L93 Difference]: Finished difference Result 11985 states and 29229 transitions. [2018-12-09 04:19:51,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:19:51,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-09 04:19:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:51,826 INFO L225 Difference]: With dead ends: 11985 [2018-12-09 04:19:51,826 INFO L226 Difference]: Without dead ends: 11544 [2018-12-09 04:19:51,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:19:51,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11544 states. [2018-12-09 04:19:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11544 to 10397. [2018-12-09 04:19:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2018-12-09 04:19:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 25907 transitions. [2018-12-09 04:19:51,907 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 25907 transitions. Word has length 109 [2018-12-09 04:19:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:51,907 INFO L480 AbstractCegarLoop]: Abstraction has 10397 states and 25907 transitions. [2018-12-09 04:19:51,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:19:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 25907 transitions. [2018-12-09 04:19:51,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 04:19:51,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:19:51,914 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:51,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:51,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1889997717, now seen corresponding path program 1 times [2018-12-09 04:19:51,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:51,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:51,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:51,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:51,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:51,978 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 04:19:51,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:51,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:19:51,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:19:51,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:19:51,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:19:51,979 INFO L87 Difference]: Start difference. First operand 10397 states and 25907 transitions. Second operand 6 states. [2018-12-09 04:19:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:52,278 INFO L93 Difference]: Finished difference Result 12148 states and 30164 transitions. [2018-12-09 04:19:52,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:19:52,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-09 04:19:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:52,287 INFO L225 Difference]: With dead ends: 12148 [2018-12-09 04:19:52,287 INFO L226 Difference]: Without dead ends: 12116 [2018-12-09 04:19:52,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:19:52,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12116 states. [2018-12-09 04:19:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12116 to 10429. [2018-12-09 04:19:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10429 states. [2018-12-09 04:19:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10429 states to 10429 states and 25987 transitions. [2018-12-09 04:19:52,370 INFO L78 Accepts]: Start accepts. Automaton has 10429 states and 25987 transitions. Word has length 109 [2018-12-09 04:19:52,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:52,370 INFO L480 AbstractCegarLoop]: Abstraction has 10429 states and 25987 transitions. [2018-12-09 04:19:52,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:19:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 10429 states and 25987 transitions. [2018-12-09 04:19:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 04:19:52,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:52,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:52,378 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:52,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:52,378 INFO L82 PathProgramCache]: Analyzing trace with hash -928383700, now seen corresponding path program 1 times [2018-12-09 04:19:52,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:52,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:52,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:52,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:52,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:52,444 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 04:19:52,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:52,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:19:52,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:19:52,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:19:52,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:19:52,446 INFO L87 Difference]: Start difference. First operand 10429 states and 25987 transitions. Second operand 7 states. [2018-12-09 04:19:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:52,766 INFO L93 Difference]: Finished difference Result 11875 states and 28495 transitions. [2018-12-09 04:19:52,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:19:52,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-09 04:19:52,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:52,775 INFO L225 Difference]: With dead ends: 11875 [2018-12-09 04:19:52,775 INFO L226 Difference]: Without dead ends: 11831 [2018-12-09 04:19:52,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-09 04:19:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11831 states. [2018-12-09 04:19:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11831 to 8829. [2018-12-09 04:19:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8829 states. [2018-12-09 04:19:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8829 states to 8829 states and 21662 transitions. [2018-12-09 04:19:52,849 INFO L78 Accepts]: Start accepts. Automaton has 8829 states and 21662 transitions. Word has length 109 [2018-12-09 04:19:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:52,849 INFO L480 AbstractCegarLoop]: Abstraction has 8829 states and 21662 transitions. [2018-12-09 04:19:52,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:19:52,849 INFO L276 IsEmpty]: Start isEmpty. Operand 8829 states and 21662 transitions. [2018-12-09 04:19:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 04:19:52,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:52,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:52,856 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:52,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:52,856 INFO L82 PathProgramCache]: Analyzing trace with hash -606302802, now seen corresponding path program 1 times [2018-12-09 04:19:52,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:52,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:52,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:52,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:52,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:52,903 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 04:19:52,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:52,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:19:52,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:19:52,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:19:52,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:19:52,904 INFO L87 Difference]: Start difference. First operand 8829 states and 21662 transitions. Second operand 6 states. [2018-12-09 04:19:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:53,185 INFO L93 Difference]: Finished difference Result 11309 states and 27551 transitions. [2018-12-09 04:19:53,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:19:53,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-09 04:19:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:53,192 INFO L225 Difference]: With dead ends: 11309 [2018-12-09 04:19:53,192 INFO L226 Difference]: Without dead ends: 11254 [2018-12-09 04:19:53,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 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 04:19:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11254 states. [2018-12-09 04:19:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11254 to 9140. [2018-12-09 04:19:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9140 states. [2018-12-09 04:19:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9140 states to 9140 states and 22395 transitions. [2018-12-09 04:19:53,264 INFO L78 Accepts]: Start accepts. Automaton has 9140 states and 22395 transitions. Word has length 109 [2018-12-09 04:19:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:53,264 INFO L480 AbstractCegarLoop]: Abstraction has 9140 states and 22395 transitions. [2018-12-09 04:19:53,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:19:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 9140 states and 22395 transitions. [2018-12-09 04:19:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 04:19:53,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:53,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:53,271 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:53,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:53,271 INFO L82 PathProgramCache]: Analyzing trace with hash 389934893, now seen corresponding path program 1 times [2018-12-09 04:19:53,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:53,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:53,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:53,339 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 04:19:53,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:53,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:19:53,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:19:53,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:19:53,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:19:53,339 INFO L87 Difference]: Start difference. First operand 9140 states and 22395 transitions. Second operand 7 states. [2018-12-09 04:19:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:53,630 INFO L93 Difference]: Finished difference Result 11744 states and 28579 transitions. [2018-12-09 04:19:53,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 04:19:53,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-09 04:19:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:53,638 INFO L225 Difference]: With dead ends: 11744 [2018-12-09 04:19:53,638 INFO L226 Difference]: Without dead ends: 11712 [2018-12-09 04:19:53,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 04:19:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11712 states. [2018-12-09 04:19:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11712 to 9236. [2018-12-09 04:19:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9236 states. [2018-12-09 04:19:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9236 states to 9236 states and 22521 transitions. [2018-12-09 04:19:53,714 INFO L78 Accepts]: Start accepts. Automaton has 9236 states and 22521 transitions. Word has length 109 [2018-12-09 04:19:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:53,714 INFO L480 AbstractCegarLoop]: Abstraction has 9236 states and 22521 transitions. [2018-12-09 04:19:53,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:19:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 9236 states and 22521 transitions. [2018-12-09 04:19:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 04:19:53,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:53,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:53,720 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:53,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1698653905, now seen corresponding path program 1 times [2018-12-09 04:19:53,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:53,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:53,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:53,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:53,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:53,780 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 04:19:53,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:53,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:19:53,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:19:53,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:19:53,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:19:53,781 INFO L87 Difference]: Start difference. First operand 9236 states and 22521 transitions. Second operand 7 states. [2018-12-09 04:19:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:53,892 INFO L93 Difference]: Finished difference Result 14466 states and 35645 transitions. [2018-12-09 04:19:53,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:19:53,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-09 04:19:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:53,902 INFO L225 Difference]: With dead ends: 14466 [2018-12-09 04:19:53,902 INFO L226 Difference]: Without dead ends: 14466 [2018-12-09 04:19:53,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:19:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14466 states. [2018-12-09 04:19:53,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14466 to 10577. [2018-12-09 04:19:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10577 states. [2018-12-09 04:19:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10577 states to 10577 states and 25601 transitions. [2018-12-09 04:19:54,004 INFO L78 Accepts]: Start accepts. Automaton has 10577 states and 25601 transitions. Word has length 109 [2018-12-09 04:19:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:54,004 INFO L480 AbstractCegarLoop]: Abstraction has 10577 states and 25601 transitions. [2018-12-09 04:19:54,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:19:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 10577 states and 25601 transitions. [2018-12-09 04:19:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 04:19:54,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:54,012 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:54,012 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:54,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:54,012 INFO L82 PathProgramCache]: Analyzing trace with hash 660653104, now seen corresponding path program 1 times [2018-12-09 04:19:54,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:54,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:54,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:54,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:54,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:54,063 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 04:19:54,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:54,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:19:54,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:19:54,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:19:54,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:19:54,064 INFO L87 Difference]: Start difference. First operand 10577 states and 25601 transitions. Second operand 5 states. [2018-12-09 04:19:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:54,097 INFO L93 Difference]: Finished difference Result 11861 states and 28767 transitions. [2018-12-09 04:19:54,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:19:54,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2018-12-09 04:19:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:54,105 INFO L225 Difference]: With dead ends: 11861 [2018-12-09 04:19:54,106 INFO L226 Difference]: Without dead ends: 11861 [2018-12-09 04:19:54,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:19:54,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11861 states. [2018-12-09 04:19:54,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11861 to 8083. [2018-12-09 04:19:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8083 states. [2018-12-09 04:19:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8083 states to 8083 states and 19148 transitions. [2018-12-09 04:19:54,174 INFO L78 Accepts]: Start accepts. Automaton has 8083 states and 19148 transitions. Word has length 109 [2018-12-09 04:19:54,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:54,175 INFO L480 AbstractCegarLoop]: Abstraction has 8083 states and 19148 transitions. [2018-12-09 04:19:54,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:19:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 8083 states and 19148 transitions. [2018-12-09 04:19:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 04:19:54,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:54,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:54,180 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:54,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:54,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1141369520, now seen corresponding path program 1 times [2018-12-09 04:19:54,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:54,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:54,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:54,251 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 04:19:54,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:54,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:19:54,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:19:54,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:19:54,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:19:54,252 INFO L87 Difference]: Start difference. First operand 8083 states and 19148 transitions. Second operand 6 states. [2018-12-09 04:19:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:54,396 INFO L93 Difference]: Finished difference Result 7779 states and 18180 transitions. [2018-12-09 04:19:54,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:19:54,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-09 04:19:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:54,401 INFO L225 Difference]: With dead ends: 7779 [2018-12-09 04:19:54,401 INFO L226 Difference]: Without dead ends: 7779 [2018-12-09 04:19:54,401 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 04:19:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7779 states. [2018-12-09 04:19:54,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7779 to 6548. [2018-12-09 04:19:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6548 states. [2018-12-09 04:19:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 15450 transitions. [2018-12-09 04:19:54,450 INFO L78 Accepts]: Start accepts. Automaton has 6548 states and 15450 transitions. Word has length 109 [2018-12-09 04:19:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:54,450 INFO L480 AbstractCegarLoop]: Abstraction has 6548 states and 15450 transitions. [2018-12-09 04:19:54,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:19:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 6548 states and 15450 transitions. [2018-12-09 04:19:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 04:19:54,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:54,454 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:54,454 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:54,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:54,454 INFO L82 PathProgramCache]: Analyzing trace with hash 402159777, now seen corresponding path program 1 times [2018-12-09 04:19:54,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:54,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:54,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:54,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:54,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:54,515 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 04:19:54,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:54,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 04:19:54,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:19:54,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:19:54,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:19:54,516 INFO L87 Difference]: Start difference. First operand 6548 states and 15450 transitions. Second operand 8 states. [2018-12-09 04:19:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:54,942 INFO L93 Difference]: Finished difference Result 11170 states and 25452 transitions. [2018-12-09 04:19:54,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 04:19:54,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2018-12-09 04:19:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:54,949 INFO L225 Difference]: With dead ends: 11170 [2018-12-09 04:19:54,949 INFO L226 Difference]: Without dead ends: 11170 [2018-12-09 04:19:54,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-09 04:19:54,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11170 states. [2018-12-09 04:19:55,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11170 to 7867. [2018-12-09 04:19:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2018-12-09 04:19:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 18359 transitions. [2018-12-09 04:19:55,014 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 18359 transitions. Word has length 111 [2018-12-09 04:19:55,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:55,015 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 18359 transitions. [2018-12-09 04:19:55,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:19:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 18359 transitions. [2018-12-09 04:19:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 04:19:55,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:55,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:55,019 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:55,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:55,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1646924258, now seen corresponding path program 1 times [2018-12-09 04:19:55,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:55,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:55,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:55,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:55,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:55,081 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 04:19:55,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:55,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 04:19:55,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:19:55,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:19:55,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:19:55,082 INFO L87 Difference]: Start difference. First operand 7867 states and 18359 transitions. Second operand 8 states. [2018-12-09 04:19:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:55,593 INFO L93 Difference]: Finished difference Result 11525 states and 26359 transitions. [2018-12-09 04:19:55,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 04:19:55,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2018-12-09 04:19:55,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:55,600 INFO L225 Difference]: With dead ends: 11525 [2018-12-09 04:19:55,600 INFO L226 Difference]: Without dead ends: 11477 [2018-12-09 04:19:55,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-12-09 04:19:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11477 states. [2018-12-09 04:19:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11477 to 8275. [2018-12-09 04:19:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8275 states. [2018-12-09 04:19:55,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8275 states to 8275 states and 19209 transitions. [2018-12-09 04:19:55,667 INFO L78 Accepts]: Start accepts. Automaton has 8275 states and 19209 transitions. Word has length 111 [2018-12-09 04:19:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:55,667 INFO L480 AbstractCegarLoop]: Abstraction has 8275 states and 19209 transitions. [2018-12-09 04:19:55,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:19:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8275 states and 19209 transitions. [2018-12-09 04:19:55,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 04:19:55,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:55,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:55,672 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:55,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:55,672 INFO L82 PathProgramCache]: Analyzing trace with hash -288736029, now seen corresponding path program 1 times [2018-12-09 04:19:55,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:55,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:55,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:55,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:55,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:55,743 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 04:19:55,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:55,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:19:55,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:19:55,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:19:55,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:19:55,744 INFO L87 Difference]: Start difference. First operand 8275 states and 19209 transitions. Second operand 7 states. [2018-12-09 04:19:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:55,973 INFO L93 Difference]: Finished difference Result 10067 states and 22860 transitions. [2018-12-09 04:19:55,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 04:19:55,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 04:19:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:55,979 INFO L225 Difference]: With dead ends: 10067 [2018-12-09 04:19:55,979 INFO L226 Difference]: Without dead ends: 10067 [2018-12-09 04:19:55,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:19:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10067 states. [2018-12-09 04:19:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10067 to 8610. [2018-12-09 04:19:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8610 states. [2018-12-09 04:19:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8610 states to 8610 states and 19913 transitions. [2018-12-09 04:19:56,043 INFO L78 Accepts]: Start accepts. Automaton has 8610 states and 19913 transitions. Word has length 111 [2018-12-09 04:19:56,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:56,043 INFO L480 AbstractCegarLoop]: Abstraction has 8610 states and 19913 transitions. [2018-12-09 04:19:56,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:19:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 8610 states and 19913 transitions. [2018-12-09 04:19:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 04:19:56,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:56,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:56,048 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:56,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:56,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1203734749, now seen corresponding path program 1 times [2018-12-09 04:19:56,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:56,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:56,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:56,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:56,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:56,097 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 04:19:56,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:56,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:19:56,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:19:56,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:19:56,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:19:56,098 INFO L87 Difference]: Start difference. First operand 8610 states and 19913 transitions. Second operand 5 states. [2018-12-09 04:19:56,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:56,219 INFO L93 Difference]: Finished difference Result 8962 states and 20777 transitions. [2018-12-09 04:19:56,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:19:56,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 04:19:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:56,225 INFO L225 Difference]: With dead ends: 8962 [2018-12-09 04:19:56,225 INFO L226 Difference]: Without dead ends: 8930 [2018-12-09 04:19:56,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 04:19:56,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8930 states. [2018-12-09 04:19:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8930 to 7844. [2018-12-09 04:19:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7844 states. [2018-12-09 04:19:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7844 states to 7844 states and 18120 transitions. [2018-12-09 04:19:56,283 INFO L78 Accepts]: Start accepts. Automaton has 7844 states and 18120 transitions. Word has length 111 [2018-12-09 04:19:56,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:56,283 INFO L480 AbstractCegarLoop]: Abstraction has 7844 states and 18120 transitions. [2018-12-09 04:19:56,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:19:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 7844 states and 18120 transitions. [2018-12-09 04:19:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 04:19:56,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:56,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:56,288 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:56,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:56,288 INFO L82 PathProgramCache]: Analyzing trace with hash 41029732, now seen corresponding path program 1 times [2018-12-09 04:19:56,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:56,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:56,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:56,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:56,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:56,320 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 04:19:56,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:56,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:19:56,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:19:56,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:19:56,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:19:56,321 INFO L87 Difference]: Start difference. First operand 7844 states and 18120 transitions. Second operand 5 states. [2018-12-09 04:19:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:56,525 INFO L93 Difference]: Finished difference Result 10007 states and 22797 transitions. [2018-12-09 04:19:56,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:19:56,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 04:19:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:56,531 INFO L225 Difference]: With dead ends: 10007 [2018-12-09 04:19:56,531 INFO L226 Difference]: Without dead ends: 10007 [2018-12-09 04:19:56,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:19:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10007 states. [2018-12-09 04:19:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10007 to 7314. [2018-12-09 04:19:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7314 states. [2018-12-09 04:19:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7314 states to 7314 states and 16876 transitions. [2018-12-09 04:19:56,588 INFO L78 Accepts]: Start accepts. Automaton has 7314 states and 16876 transitions. Word has length 111 [2018-12-09 04:19:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:56,588 INFO L480 AbstractCegarLoop]: Abstraction has 7314 states and 16876 transitions. [2018-12-09 04:19:56,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:19:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 7314 states and 16876 transitions. [2018-12-09 04:19:56,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 04:19:56,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:56,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:56,593 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:56,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:56,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2010295817, now seen corresponding path program 1 times [2018-12-09 04:19:56,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:56,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:56,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:56,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:56,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:19:56,660 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 04:19:56,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:19:56,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 04:19:56,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 04:19:56,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 04:19:56,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:19:56,660 INFO L87 Difference]: Start difference. First operand 7314 states and 16876 transitions. Second operand 9 states. [2018-12-09 04:19:56,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:19:56,760 INFO L93 Difference]: Finished difference Result 10186 states and 24029 transitions. [2018-12-09 04:19:56,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:19:56,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2018-12-09 04:19:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:19:56,762 INFO L225 Difference]: With dead ends: 10186 [2018-12-09 04:19:56,762 INFO L226 Difference]: Without dead ends: 3134 [2018-12-09 04:19:56,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-09 04:19:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2018-12-09 04:19:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 3134. [2018-12-09 04:19:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2018-12-09 04:19:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 7603 transitions. [2018-12-09 04:19:56,783 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 7603 transitions. Word has length 113 [2018-12-09 04:19:56,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:19:56,783 INFO L480 AbstractCegarLoop]: Abstraction has 3134 states and 7603 transitions. [2018-12-09 04:19:56,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 04:19:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 7603 transitions. [2018-12-09 04:19:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 04:19:56,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:19:56,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:19:56,785 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:19:56,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:19:56,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1401095761, now seen corresponding path program 2 times [2018-12-09 04:19:56,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:19:56,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:19:56,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:56,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:19:56,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:19:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:19:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:19:56,850 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 04:19:56,925 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 04:19:56,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:19:56 BasicIcfg [2018-12-09 04:19:56,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 04:19:56,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:19:56,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:19:56,926 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:19:56,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:19:26" (3/4) ... [2018-12-09 04:19:56,928 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 04:19:57,004 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d82f45c5-20c0-47a1-ac0c-577abbf491a7/bin-2019/uautomizer/witness.graphml [2018-12-09 04:19:57,004 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:19:57,005 INFO L168 Benchmark]: Toolchain (without parser) took 31099.04 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 950.6 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-12-09 04:19:57,006 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:19:57,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-09 04:19:57,006 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 04:19:57,006 INFO L168 Benchmark]: Boogie Preprocessor took 21.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:19:57,006 INFO L168 Benchmark]: RCFGBuilder took 411.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 63.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 11.5 GB. [2018-12-09 04:19:57,006 INFO L168 Benchmark]: TraceAbstraction took 30141.94 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-09 04:19:57,006 INFO L168 Benchmark]: Witness Printer took 78.08 ms. Allocated memory is still 5.0 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2018-12-09 04:19:57,007 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 411.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 63.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30141.94 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 78.08 ms. Allocated memory is still 5.0 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 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] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] -1 pthread_t t599; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] FCALL, FORK -1 pthread_create(&t599, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] -1 pthread_t t600; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] FCALL, FORK -1 pthread_create(&t600, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] 0 x$w_buff1 = x$w_buff0 [L722] 0 x$w_buff0 = 2 [L723] 0 x$w_buff1_used = x$w_buff0_used [L724] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L727] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L728] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L729] 0 x$r_buff0_thd2 = (_Bool)1 [L732] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 0 x$flush_delayed = weak$$choice2 [L735] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L737] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 0 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L741] 0 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L742] EXPR 0 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L742] 0 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 0 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 0 x = x$flush_delayed ? x$mem_tmp : x [L745] 0 x$flush_delayed = (_Bool)0 [L748] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] 1 y = 1 [L704] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L707] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L707] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L709] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L710] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L711] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L751] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L751] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L752] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L753] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L754] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L755] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L755] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L758] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L783] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L784] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L789] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L790] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L791] -1 x$flush_delayed = weak$$choice2 [L792] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L794] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L795] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L796] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L797] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L798] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L799] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L800] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] -1 x = x$flush_delayed ? x$mem_tmp : x [L802] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 264 locations, 3 error locations. UNSAFE Result, 30.0s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11333 SDtfs, 11405 SDslu, 24743 SDs, 0 SdLazy, 11367 SolverSat, 625 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 81 SyntacticMatches, 28 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109739occurred in iteration=2, 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: 10.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 230012 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 3025 NumberOfCodeBlocks, 3025 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2881 ConstructedInterpolants, 0 QuantifiedInterpolants, 638304 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...