./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_rmo.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_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85b1258ded0eac0276acac04f0bf2be2f4435887 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 18:36:47,927 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 18:36:47,928 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 18:36:47,936 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 18:36:47,936 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 18:36:47,937 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 18:36:47,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 18:36:47,939 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 18:36:47,940 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 18:36:47,940 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 18:36:47,941 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 18:36:47,941 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 18:36:47,941 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 18:36:47,942 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 18:36:47,943 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 18:36:47,943 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 18:36:47,944 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 18:36:47,945 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 18:36:47,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 18:36:47,948 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 18:36:47,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 18:36:47,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 18:36:47,951 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 18:36:47,951 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 18:36:47,951 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 18:36:47,952 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 18:36:47,952 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 18:36:47,953 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 18:36:47,953 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 18:36:47,954 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 18:36:47,954 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 18:36:47,955 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 18:36:47,955 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 18:36:47,955 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 18:36:47,956 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 18:36:47,956 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 18:36:47,956 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 18:36:47,967 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 18:36:47,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 18:36:47,967 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 18:36:47,968 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 18:36:47,968 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 18:36:47,968 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 18:36:47,968 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 18:36:47,968 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 18:36:47,968 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 18:36:47,968 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 18:36:47,969 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 18:36:47,969 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 18:36:47,969 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 18:36:47,969 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 18:36:47,970 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 18:36:47,970 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 18:36:47,970 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 18:36:47,970 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 18:36:47,970 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 18:36:47,970 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 18:36:47,970 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 18:36:47,970 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 18:36:47,971 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 18:36:47,971 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 18:36:47,971 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 18:36:47,971 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 18:36:47,971 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 18:36:47,971 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 18:36:47,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 18:36:47,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 18:36:47,971 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 18:36:47,972 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 18:36:47,972 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 18:36:47,972 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 18:36:47,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 18:36:47,972 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 18:36:47,972 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85b1258ded0eac0276acac04f0bf2be2f4435887 [2018-12-09 18:36:47,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 18:36:48,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 18:36:48,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 18:36:48,008 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 18:36:48,009 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 18:36:48,009 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix054_rmo.oepc_false-unreach-call.i [2018-12-09 18:36:48,048 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/bin-2019/utaipan/data/cd6f5c316/c83d41fd605b472fb425027a6586e1df/FLAGf4ac3f4fd [2018-12-09 18:36:48,528 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 18:36:48,528 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/sv-benchmarks/c/pthread-wmm/mix054_rmo.oepc_false-unreach-call.i [2018-12-09 18:36:48,537 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/bin-2019/utaipan/data/cd6f5c316/c83d41fd605b472fb425027a6586e1df/FLAGf4ac3f4fd [2018-12-09 18:36:48,547 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/bin-2019/utaipan/data/cd6f5c316/c83d41fd605b472fb425027a6586e1df [2018-12-09 18:36:48,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 18:36:48,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 18:36:48,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 18:36:48,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 18:36:48,553 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 18:36:48,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:36:48" (1/1) ... [2018-12-09 18:36:48,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2918fbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:48, skipping insertion in model container [2018-12-09 18:36:48,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:36:48" (1/1) ... [2018-12-09 18:36:48,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 18:36:48,587 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 18:36:48,776 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:36:48,783 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 18:36:48,865 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:36:48,906 INFO L195 MainTranslator]: Completed translation [2018-12-09 18:36:48,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:48 WrapperNode [2018-12-09 18:36:48,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 18:36:48,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 18:36:48,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 18:36:48,907 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 18:36:48,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:48" (1/1) ... [2018-12-09 18:36:48,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:48" (1/1) ... [2018-12-09 18:36:48,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 18:36:48,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 18:36:48,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 18:36:48,939 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 18:36:48,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:48" (1/1) ... [2018-12-09 18:36:48,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:48" (1/1) ... [2018-12-09 18:36:48,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:48" (1/1) ... [2018-12-09 18:36:48,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:48" (1/1) ... [2018-12-09 18:36:48,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:48" (1/1) ... [2018-12-09 18:36:48,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:48" (1/1) ... [2018-12-09 18:36:48,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:48" (1/1) ... [2018-12-09 18:36:48,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 18:36:48,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 18:36:48,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 18:36:48,961 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 18:36:48,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 18:36:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 18:36:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 18:36:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 18:36:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 18:36:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 18:36:48,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 18:36:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 18:36:48,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 18:36:48,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 18:36:48,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 18:36:48,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 18:36:48,996 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 18:36:49,283 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 18:36:49,283 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 18:36:49,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:36:49 BoogieIcfgContainer [2018-12-09 18:36:49,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 18:36:49,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 18:36:49,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 18:36:49,286 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 18:36:49,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:36:48" (1/3) ... [2018-12-09 18:36:49,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248906ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:36:49, skipping insertion in model container [2018-12-09 18:36:49,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:48" (2/3) ... [2018-12-09 18:36:49,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248906ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:36:49, skipping insertion in model container [2018-12-09 18:36:49,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:36:49" (3/3) ... [2018-12-09 18:36:49,288 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_rmo.oepc_false-unreach-call.i [2018-12-09 18:36:49,310 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,310 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,311 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,311 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,311 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,311 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,311 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,311 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,312 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,312 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,312 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,312 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,312 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,312 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,312 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,313 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,313 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,313 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,313 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,313 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,313 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,313 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,314 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,314 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,314 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,314 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,314 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,314 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,314 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,315 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,315 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,315 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,315 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,315 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,315 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,315 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,315 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,316 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,317 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,317 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,320 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,320 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,320 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,320 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,320 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,320 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,320 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,320 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,321 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,321 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,321 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,321 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,321 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,321 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,321 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,323 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,323 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,323 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,323 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,323 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,323 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,323 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,324 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,324 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,324 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,324 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,324 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,324 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,324 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,325 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,325 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,325 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,325 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,325 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,325 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,325 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,325 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,325 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:36:49,337 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 18:36:49,337 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 18:36:49,342 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 18:36:49,352 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 18:36:49,367 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 18:36:49,367 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 18:36:49,367 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 18:36:49,368 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 18:36:49,368 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 18:36:49,368 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 18:36:49,368 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 18:36:49,368 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 18:36:49,375 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-12-09 18:36:50,982 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34805 states. [2018-12-09 18:36:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 34805 states. [2018-12-09 18:36:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 18:36:50,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:50,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:36:50,989 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:50,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:50,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1272153477, now seen corresponding path program 1 times [2018-12-09 18:36:50,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:51,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:51,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:51,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:51,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:51,130 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 18:36:51,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:51,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:36:51,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:51,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:36:51,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:36:51,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:36:51,145 INFO L87 Difference]: Start difference. First operand 34805 states. Second operand 4 states. [2018-12-09 18:36:51,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:51,685 INFO L93 Difference]: Finished difference Result 60789 states and 234492 transitions. [2018-12-09 18:36:51,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:36:51,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-09 18:36:51,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:51,858 INFO L225 Difference]: With dead ends: 60789 [2018-12-09 18:36:51,858 INFO L226 Difference]: Without dead ends: 44269 [2018-12-09 18:36:51,860 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 18:36:52,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44269 states. [2018-12-09 18:36:52,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44269 to 27337. [2018-12-09 18:36:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27337 states. [2018-12-09 18:36:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27337 states to 27337 states and 105498 transitions. [2018-12-09 18:36:52,792 INFO L78 Accepts]: Start accepts. Automaton has 27337 states and 105498 transitions. Word has length 32 [2018-12-09 18:36:52,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:36:52,793 INFO L480 AbstractCegarLoop]: Abstraction has 27337 states and 105498 transitions. [2018-12-09 18:36:52,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:36:52,793 INFO L276 IsEmpty]: Start isEmpty. Operand 27337 states and 105498 transitions. [2018-12-09 18:36:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 18:36:52,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:52,799 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 18:36:52,799 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:52,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:52,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1559910934, now seen corresponding path program 1 times [2018-12-09 18:36:52,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:52,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:52,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:52,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:52,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:52,864 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 18:36:52,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:52,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:36:52,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:52,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:36:52,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:36:52,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:36:52,866 INFO L87 Difference]: Start difference. First operand 27337 states and 105498 transitions. Second operand 4 states. [2018-12-09 18:36:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:52,964 INFO L93 Difference]: Finished difference Result 8527 states and 28343 transitions. [2018-12-09 18:36:52,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:36:52,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-09 18:36:52,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:52,986 INFO L225 Difference]: With dead ends: 8527 [2018-12-09 18:36:52,986 INFO L226 Difference]: Without dead ends: 7465 [2018-12-09 18:36:52,986 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 18:36:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2018-12-09 18:36:53,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 7465. [2018-12-09 18:36:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7465 states. [2018-12-09 18:36:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7465 states to 7465 states and 24635 transitions. [2018-12-09 18:36:53,092 INFO L78 Accepts]: Start accepts. Automaton has 7465 states and 24635 transitions. Word has length 44 [2018-12-09 18:36:53,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:36:53,092 INFO L480 AbstractCegarLoop]: Abstraction has 7465 states and 24635 transitions. [2018-12-09 18:36:53,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:36:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 7465 states and 24635 transitions. [2018-12-09 18:36:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 18:36:53,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:53,093 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 18:36:53,094 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:53,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:53,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1459656693, now seen corresponding path program 1 times [2018-12-09 18:36:53,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:53,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:53,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:53,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:53,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:36:53,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:53,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:36:53,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:53,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:36:53,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:36:53,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:36:53,157 INFO L87 Difference]: Start difference. First operand 7465 states and 24635 transitions. Second operand 5 states. [2018-12-09 18:36:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:53,396 INFO L93 Difference]: Finished difference Result 13997 states and 45804 transitions. [2018-12-09 18:36:53,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:36:53,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-09 18:36:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:53,425 INFO L225 Difference]: With dead ends: 13997 [2018-12-09 18:36:53,425 INFO L226 Difference]: Without dead ends: 13929 [2018-12-09 18:36:53,425 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 18:36:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13929 states. [2018-12-09 18:36:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13929 to 9440. [2018-12-09 18:36:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9440 states. [2018-12-09 18:36:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9440 states to 9440 states and 30541 transitions. [2018-12-09 18:36:53,573 INFO L78 Accepts]: Start accepts. Automaton has 9440 states and 30541 transitions. Word has length 45 [2018-12-09 18:36:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:36:53,574 INFO L480 AbstractCegarLoop]: Abstraction has 9440 states and 30541 transitions. [2018-12-09 18:36:53,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:36:53,574 INFO L276 IsEmpty]: Start isEmpty. Operand 9440 states and 30541 transitions. [2018-12-09 18:36:53,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 18:36:53,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:53,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:36:53,576 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:53,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:53,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1598559727, now seen corresponding path program 1 times [2018-12-09 18:36:53,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:53,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:53,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:53,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:53,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:53,681 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 18:36:53,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:53,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:36:53,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:53,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:36:53,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:36:53,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:36:53,682 INFO L87 Difference]: Start difference. First operand 9440 states and 30541 transitions. Second operand 3 states. [2018-12-09 18:36:53,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:53,742 INFO L93 Difference]: Finished difference Result 13278 states and 42640 transitions. [2018-12-09 18:36:53,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:36:53,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-09 18:36:53,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:53,761 INFO L225 Difference]: With dead ends: 13278 [2018-12-09 18:36:53,761 INFO L226 Difference]: Without dead ends: 13278 [2018-12-09 18:36:53,761 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 18:36:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13278 states. [2018-12-09 18:36:53,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13278 to 9844. [2018-12-09 18:36:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9844 states. [2018-12-09 18:36:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9844 states to 9844 states and 31507 transitions. [2018-12-09 18:36:53,905 INFO L78 Accepts]: Start accepts. Automaton has 9844 states and 31507 transitions. Word has length 47 [2018-12-09 18:36:53,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:36:53,906 INFO L480 AbstractCegarLoop]: Abstraction has 9844 states and 31507 transitions. [2018-12-09 18:36:53,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:36:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 9844 states and 31507 transitions. [2018-12-09 18:36:53,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 18:36:53,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:53,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:36:53,908 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:53,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:53,908 INFO L82 PathProgramCache]: Analyzing trace with hash -108379620, now seen corresponding path program 1 times [2018-12-09 18:36:53,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:53,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:53,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:53,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:53,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:53,981 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 18:36:53,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:53,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 18:36:53,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:53,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:36:53,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:36:53,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:36:53,982 INFO L87 Difference]: Start difference. First operand 9844 states and 31507 transitions. Second operand 7 states. [2018-12-09 18:36:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:54,387 INFO L93 Difference]: Finished difference Result 12284 states and 38672 transitions. [2018-12-09 18:36:54,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 18:36:54,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-12-09 18:36:54,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:54,404 INFO L225 Difference]: With dead ends: 12284 [2018-12-09 18:36:54,404 INFO L226 Difference]: Without dead ends: 12212 [2018-12-09 18:36:54,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 18:36:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2018-12-09 18:36:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 10848. [2018-12-09 18:36:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10848 states. [2018-12-09 18:36:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10848 states to 10848 states and 34562 transitions. [2018-12-09 18:36:54,538 INFO L78 Accepts]: Start accepts. Automaton has 10848 states and 34562 transitions. Word has length 51 [2018-12-09 18:36:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:36:54,538 INFO L480 AbstractCegarLoop]: Abstraction has 10848 states and 34562 transitions. [2018-12-09 18:36:54,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:36:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 10848 states and 34562 transitions. [2018-12-09 18:36:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 18:36:54,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:54,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:36:54,541 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:54,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:54,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1204429704, now seen corresponding path program 1 times [2018-12-09 18:36:54,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:54,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:54,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:54,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:54,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:54,570 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 18:36:54,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:54,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:36:54,570 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:54,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:36:54,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:36:54,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:36:54,571 INFO L87 Difference]: Start difference. First operand 10848 states and 34562 transitions. Second operand 4 states. [2018-12-09 18:36:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:54,648 INFO L93 Difference]: Finished difference Result 12395 states and 39571 transitions. [2018-12-09 18:36:54,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:36:54,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-09 18:36:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:54,666 INFO L225 Difference]: With dead ends: 12395 [2018-12-09 18:36:54,666 INFO L226 Difference]: Without dead ends: 12395 [2018-12-09 18:36:54,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:36:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12395 states. [2018-12-09 18:36:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12395 to 11368. [2018-12-09 18:36:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11368 states. [2018-12-09 18:36:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11368 states to 11368 states and 36235 transitions. [2018-12-09 18:36:54,807 INFO L78 Accepts]: Start accepts. Automaton has 11368 states and 36235 transitions. Word has length 59 [2018-12-09 18:36:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:36:54,807 INFO L480 AbstractCegarLoop]: Abstraction has 11368 states and 36235 transitions. [2018-12-09 18:36:54,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:36:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 11368 states and 36235 transitions. [2018-12-09 18:36:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 18:36:54,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:54,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:36:54,811 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:54,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:54,812 INFO L82 PathProgramCache]: Analyzing trace with hash 538380631, now seen corresponding path program 1 times [2018-12-09 18:36:54,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:54,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:54,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:54,854 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 18:36:54,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:54,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:36:54,854 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:54,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:36:54,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:36:54,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:36:54,855 INFO L87 Difference]: Start difference. First operand 11368 states and 36235 transitions. Second operand 6 states. [2018-12-09 18:36:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:55,205 INFO L93 Difference]: Finished difference Result 20968 states and 66485 transitions. [2018-12-09 18:36:55,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 18:36:55,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-09 18:36:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:55,236 INFO L225 Difference]: With dead ends: 20968 [2018-12-09 18:36:55,237 INFO L226 Difference]: Without dead ends: 20897 [2018-12-09 18:36:55,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:36:55,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20897 states. [2018-12-09 18:36:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20897 to 13754. [2018-12-09 18:36:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13754 states. [2018-12-09 18:36:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13754 states to 13754 states and 43279 transitions. [2018-12-09 18:36:55,496 INFO L78 Accepts]: Start accepts. Automaton has 13754 states and 43279 transitions. Word has length 59 [2018-12-09 18:36:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:36:55,496 INFO L480 AbstractCegarLoop]: Abstraction has 13754 states and 43279 transitions. [2018-12-09 18:36:55,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:36:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand 13754 states and 43279 transitions. [2018-12-09 18:36:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 18:36:55,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:55,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:36:55,502 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:55,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:55,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1986786434, now seen corresponding path program 1 times [2018-12-09 18:36:55,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:55,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:55,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:55,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:55,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:55,533 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 18:36:55,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:55,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:36:55,534 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:55,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:36:55,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:36:55,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:36:55,534 INFO L87 Difference]: Start difference. First operand 13754 states and 43279 transitions. Second operand 4 states. [2018-12-09 18:36:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:55,789 INFO L93 Difference]: Finished difference Result 20200 states and 61902 transitions. [2018-12-09 18:36:55,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:36:55,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 18:36:55,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:55,814 INFO L225 Difference]: With dead ends: 20200 [2018-12-09 18:36:55,814 INFO L226 Difference]: Without dead ends: 20200 [2018-12-09 18:36:55,814 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 18:36:55,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20200 states. [2018-12-09 18:36:55,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20200 to 15792. [2018-12-09 18:36:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15792 states. [2018-12-09 18:36:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15792 states to 15792 states and 49060 transitions. [2018-12-09 18:36:55,993 INFO L78 Accepts]: Start accepts. Automaton has 15792 states and 49060 transitions. Word has length 63 [2018-12-09 18:36:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:36:55,994 INFO L480 AbstractCegarLoop]: Abstraction has 15792 states and 49060 transitions. [2018-12-09 18:36:55,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:36:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 15792 states and 49060 transitions. [2018-12-09 18:36:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 18:36:55,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:56,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:36:56,000 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:56,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:56,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1121709459, now seen corresponding path program 1 times [2018-12-09 18:36:56,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:56,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:56,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:56,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:56,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:56,045 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 18:36:56,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:56,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:36:56,046 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:56,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:36:56,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:36:56,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:36:56,046 INFO L87 Difference]: Start difference. First operand 15792 states and 49060 transitions. Second operand 4 states. [2018-12-09 18:36:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:56,242 INFO L93 Difference]: Finished difference Result 19959 states and 61084 transitions. [2018-12-09 18:36:56,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:36:56,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 18:36:56,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:56,266 INFO L225 Difference]: With dead ends: 19959 [2018-12-09 18:36:56,266 INFO L226 Difference]: Without dead ends: 19959 [2018-12-09 18:36:56,267 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 18:36:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19959 states. [2018-12-09 18:36:56,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19959 to 16086. [2018-12-09 18:36:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16086 states. [2018-12-09 18:36:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16086 states to 16086 states and 49917 transitions. [2018-12-09 18:36:56,452 INFO L78 Accepts]: Start accepts. Automaton has 16086 states and 49917 transitions. Word has length 63 [2018-12-09 18:36:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:36:56,453 INFO L480 AbstractCegarLoop]: Abstraction has 16086 states and 49917 transitions. [2018-12-09 18:36:56,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:36:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 16086 states and 49917 transitions. [2018-12-09 18:36:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 18:36:56,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:56,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:36:56,458 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:56,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:56,458 INFO L82 PathProgramCache]: Analyzing trace with hash 866972914, now seen corresponding path program 1 times [2018-12-09 18:36:56,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:56,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:56,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:56,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:56,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:56,489 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 18:36:56,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:56,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:36:56,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:56,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:36:56,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:36:56,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:36:56,490 INFO L87 Difference]: Start difference. First operand 16086 states and 49917 transitions. Second operand 3 states. [2018-12-09 18:36:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:56,749 INFO L93 Difference]: Finished difference Result 16558 states and 51205 transitions. [2018-12-09 18:36:56,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:36:56,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-12-09 18:36:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:56,769 INFO L225 Difference]: With dead ends: 16558 [2018-12-09 18:36:56,769 INFO L226 Difference]: Without dead ends: 16558 [2018-12-09 18:36:56,769 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 18:36:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16558 states. [2018-12-09 18:36:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16558 to 16322. [2018-12-09 18:36:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16322 states. [2018-12-09 18:36:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16322 states to 16322 states and 50541 transitions. [2018-12-09 18:36:56,934 INFO L78 Accepts]: Start accepts. Automaton has 16322 states and 50541 transitions. Word has length 63 [2018-12-09 18:36:56,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:36:56,934 INFO L480 AbstractCegarLoop]: Abstraction has 16322 states and 50541 transitions. [2018-12-09 18:36:56,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:36:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 16322 states and 50541 transitions. [2018-12-09 18:36:56,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 18:36:56,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:56,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:36:56,940 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:56,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:56,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1567726820, now seen corresponding path program 1 times [2018-12-09 18:36:56,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:56,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:56,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:56,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:57,022 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 18:36:57,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:57,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:36:57,022 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:57,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:36:57,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:36:57,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:36:57,023 INFO L87 Difference]: Start difference. First operand 16322 states and 50541 transitions. Second operand 6 states. [2018-12-09 18:36:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:57,258 INFO L93 Difference]: Finished difference Result 17646 states and 53545 transitions. [2018-12-09 18:36:57,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 18:36:57,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-09 18:36:57,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:57,278 INFO L225 Difference]: With dead ends: 17646 [2018-12-09 18:36:57,279 INFO L226 Difference]: Without dead ends: 17646 [2018-12-09 18:36:57,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:36:57,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17646 states. [2018-12-09 18:36:57,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17646 to 16546. [2018-12-09 18:36:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16546 states. [2018-12-09 18:36:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16546 states to 16546 states and 50764 transitions. [2018-12-09 18:36:57,451 INFO L78 Accepts]: Start accepts. Automaton has 16546 states and 50764 transitions. Word has length 65 [2018-12-09 18:36:57,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:36:57,451 INFO L480 AbstractCegarLoop]: Abstraction has 16546 states and 50764 transitions. [2018-12-09 18:36:57,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:36:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 16546 states and 50764 transitions. [2018-12-09 18:36:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 18:36:57,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:57,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:36:57,457 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:57,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:57,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1500720067, now seen corresponding path program 1 times [2018-12-09 18:36:57,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:57,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:57,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:57,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:57,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:57,494 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 18:36:57,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:57,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:36:57,494 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:57,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:36:57,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:36:57,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:36:57,495 INFO L87 Difference]: Start difference. First operand 16546 states and 50764 transitions. Second operand 5 states. [2018-12-09 18:36:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:57,733 INFO L93 Difference]: Finished difference Result 21334 states and 64873 transitions. [2018-12-09 18:36:57,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:36:57,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 18:36:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:57,759 INFO L225 Difference]: With dead ends: 21334 [2018-12-09 18:36:57,759 INFO L226 Difference]: Without dead ends: 21334 [2018-12-09 18:36:57,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:36:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21334 states. [2018-12-09 18:36:57,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21334 to 19570. [2018-12-09 18:36:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19570 states. [2018-12-09 18:36:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19570 states to 19570 states and 59494 transitions. [2018-12-09 18:36:57,963 INFO L78 Accepts]: Start accepts. Automaton has 19570 states and 59494 transitions. Word has length 65 [2018-12-09 18:36:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:36:57,963 INFO L480 AbstractCegarLoop]: Abstraction has 19570 states and 59494 transitions. [2018-12-09 18:36:57,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:36:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 19570 states and 59494 transitions. [2018-12-09 18:36:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 18:36:57,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:57,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:36:57,970 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:57,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:57,970 INFO L82 PathProgramCache]: Analyzing trace with hash 990185890, now seen corresponding path program 1 times [2018-12-09 18:36:57,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:57,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:57,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:57,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:57,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:58,029 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 18:36:58,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:58,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:36:58,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:58,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:36:58,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:36:58,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:36:58,031 INFO L87 Difference]: Start difference. First operand 19570 states and 59494 transitions. Second operand 5 states. [2018-12-09 18:36:58,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:58,351 INFO L93 Difference]: Finished difference Result 30156 states and 90237 transitions. [2018-12-09 18:36:58,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 18:36:58,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 18:36:58,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:58,390 INFO L225 Difference]: With dead ends: 30156 [2018-12-09 18:36:58,390 INFO L226 Difference]: Without dead ends: 30156 [2018-12-09 18:36:58,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:36:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30156 states. [2018-12-09 18:36:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30156 to 26760. [2018-12-09 18:36:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26760 states. [2018-12-09 18:36:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26760 states to 26760 states and 80370 transitions. [2018-12-09 18:36:58,816 INFO L78 Accepts]: Start accepts. Automaton has 26760 states and 80370 transitions. Word has length 65 [2018-12-09 18:36:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:36:58,816 INFO L480 AbstractCegarLoop]: Abstraction has 26760 states and 80370 transitions. [2018-12-09 18:36:58,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:36:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 26760 states and 80370 transitions. [2018-12-09 18:36:58,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 18:36:58,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:58,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:36:58,825 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:58,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:58,825 INFO L82 PathProgramCache]: Analyzing trace with hash -817268573, now seen corresponding path program 1 times [2018-12-09 18:36:58,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:58,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:58,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:58,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:58,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:58,865 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 18:36:58,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:58,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:36:58,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:58,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:36:58,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:36:58,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:36:58,865 INFO L87 Difference]: Start difference. First operand 26760 states and 80370 transitions. Second operand 4 states. [2018-12-09 18:36:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:59,424 INFO L93 Difference]: Finished difference Result 36608 states and 110252 transitions. [2018-12-09 18:36:59,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:36:59,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 18:36:59,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:59,473 INFO L225 Difference]: With dead ends: 36608 [2018-12-09 18:36:59,473 INFO L226 Difference]: Without dead ends: 36344 [2018-12-09 18:36:59,473 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 18:36:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36344 states. [2018-12-09 18:36:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36344 to 33704. [2018-12-09 18:36:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33704 states. [2018-12-09 18:36:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33704 states to 33704 states and 101614 transitions. [2018-12-09 18:36:59,860 INFO L78 Accepts]: Start accepts. Automaton has 33704 states and 101614 transitions. Word has length 65 [2018-12-09 18:36:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:36:59,860 INFO L480 AbstractCegarLoop]: Abstraction has 33704 states and 101614 transitions. [2018-12-09 18:36:59,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:36:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 33704 states and 101614 transitions. [2018-12-09 18:36:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 18:36:59,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:36:59,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:36:59,870 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:36:59,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:36:59,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1680747364, now seen corresponding path program 1 times [2018-12-09 18:36:59,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:36:59,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:59,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:36:59,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:36:59,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:36:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:36:59,907 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 18:36:59,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:36:59,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:36:59,908 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:36:59,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:36:59,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:36:59,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:36:59,909 INFO L87 Difference]: Start difference. First operand 33704 states and 101614 transitions. Second operand 5 states. [2018-12-09 18:36:59,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:36:59,961 INFO L93 Difference]: Finished difference Result 8356 states and 20403 transitions. [2018-12-09 18:36:59,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:36:59,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 18:36:59,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:36:59,966 INFO L225 Difference]: With dead ends: 8356 [2018-12-09 18:36:59,966 INFO L226 Difference]: Without dead ends: 6588 [2018-12-09 18:36:59,967 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 18:36:59,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states. [2018-12-09 18:37:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 5161. [2018-12-09 18:37:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5161 states. [2018-12-09 18:37:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 12358 transitions. [2018-12-09 18:37:00,006 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 12358 transitions. Word has length 65 [2018-12-09 18:37:00,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:00,006 INFO L480 AbstractCegarLoop]: Abstraction has 5161 states and 12358 transitions. [2018-12-09 18:37:00,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:37:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 12358 transitions. [2018-12-09 18:37:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 18:37:00,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:00,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:00,009 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:00,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:00,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2026999384, now seen corresponding path program 1 times [2018-12-09 18:37:00,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:00,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:00,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:00,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:00,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:00,032 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 18:37:00,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:00,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:37:00,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:00,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:37:00,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:37:00,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:37:00,032 INFO L87 Difference]: Start difference. First operand 5161 states and 12358 transitions. Second operand 3 states. [2018-12-09 18:37:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:00,059 INFO L93 Difference]: Finished difference Result 7236 states and 17318 transitions. [2018-12-09 18:37:00,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:37:00,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-09 18:37:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:00,064 INFO L225 Difference]: With dead ends: 7236 [2018-12-09 18:37:00,065 INFO L226 Difference]: Without dead ends: 7236 [2018-12-09 18:37:00,065 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 18:37:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7236 states. [2018-12-09 18:37:00,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7236 to 5104. [2018-12-09 18:37:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5104 states. [2018-12-09 18:37:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 11991 transitions. [2018-12-09 18:37:00,104 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 11991 transitions. Word has length 65 [2018-12-09 18:37:00,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:00,105 INFO L480 AbstractCegarLoop]: Abstraction has 5104 states and 11991 transitions. [2018-12-09 18:37:00,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:37:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 11991 transitions. [2018-12-09 18:37:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 18:37:00,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:00,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:00,108 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:00,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:00,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1343049765, now seen corresponding path program 1 times [2018-12-09 18:37:00,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:00,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:00,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:00,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:00,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:00,154 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 18:37:00,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:00,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:37:00,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:00,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:37:00,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:37:00,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:37:00,155 INFO L87 Difference]: Start difference. First operand 5104 states and 11991 transitions. Second operand 5 states. [2018-12-09 18:37:00,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:00,253 INFO L93 Difference]: Finished difference Result 6127 states and 14344 transitions. [2018-12-09 18:37:00,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 18:37:00,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-09 18:37:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:00,258 INFO L225 Difference]: With dead ends: 6127 [2018-12-09 18:37:00,258 INFO L226 Difference]: Without dead ends: 6127 [2018-12-09 18:37:00,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:37:00,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2018-12-09 18:37:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 5496. [2018-12-09 18:37:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5496 states. [2018-12-09 18:37:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 12892 transitions. [2018-12-09 18:37:00,299 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 12892 transitions. Word has length 71 [2018-12-09 18:37:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:00,300 INFO L480 AbstractCegarLoop]: Abstraction has 5496 states and 12892 transitions. [2018-12-09 18:37:00,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:37:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 12892 transitions. [2018-12-09 18:37:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 18:37:00,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:00,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:00,303 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:00,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:00,303 INFO L82 PathProgramCache]: Analyzing trace with hash 399760570, now seen corresponding path program 1 times [2018-12-09 18:37:00,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:00,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:00,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:00,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:00,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:00,396 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 18:37:00,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:00,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 18:37:00,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:00,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 18:37:00,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 18:37:00,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:37:00,397 INFO L87 Difference]: Start difference. First operand 5496 states and 12892 transitions. Second operand 9 states. [2018-12-09 18:37:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:00,675 INFO L93 Difference]: Finished difference Result 7583 states and 17690 transitions. [2018-12-09 18:37:00,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 18:37:00,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2018-12-09 18:37:00,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:00,681 INFO L225 Difference]: With dead ends: 7583 [2018-12-09 18:37:00,681 INFO L226 Difference]: Without dead ends: 7528 [2018-12-09 18:37:00,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-09 18:37:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7528 states. [2018-12-09 18:37:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7528 to 5564. [2018-12-09 18:37:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5564 states. [2018-12-09 18:37:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5564 states to 5564 states and 12958 transitions. [2018-12-09 18:37:00,725 INFO L78 Accepts]: Start accepts. Automaton has 5564 states and 12958 transitions. Word has length 71 [2018-12-09 18:37:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:00,725 INFO L480 AbstractCegarLoop]: Abstraction has 5564 states and 12958 transitions. [2018-12-09 18:37:00,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 18:37:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 5564 states and 12958 transitions. [2018-12-09 18:37:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 18:37:00,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:00,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:00,729 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:00,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:00,729 INFO L82 PathProgramCache]: Analyzing trace with hash -226879915, now seen corresponding path program 1 times [2018-12-09 18:37:00,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:00,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:00,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:00,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:00,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:00,758 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 18:37:00,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:00,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:37:00,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:00,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:37:00,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:37:00,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:37:00,759 INFO L87 Difference]: Start difference. First operand 5564 states and 12958 transitions. Second operand 3 states. [2018-12-09 18:37:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:00,842 INFO L93 Difference]: Finished difference Result 7293 states and 16480 transitions. [2018-12-09 18:37:00,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:37:00,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-09 18:37:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:00,847 INFO L225 Difference]: With dead ends: 7293 [2018-12-09 18:37:00,847 INFO L226 Difference]: Without dead ends: 6965 [2018-12-09 18:37:00,847 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 18:37:00,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2018-12-09 18:37:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 6435. [2018-12-09 18:37:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6435 states. [2018-12-09 18:37:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6435 states to 6435 states and 14760 transitions. [2018-12-09 18:37:00,894 INFO L78 Accepts]: Start accepts. Automaton has 6435 states and 14760 transitions. Word has length 90 [2018-12-09 18:37:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:00,894 INFO L480 AbstractCegarLoop]: Abstraction has 6435 states and 14760 transitions. [2018-12-09 18:37:00,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:37:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 6435 states and 14760 transitions. [2018-12-09 18:37:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 18:37:00,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:00,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:00,899 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:00,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:00,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1648326326, now seen corresponding path program 1 times [2018-12-09 18:37:00,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:00,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:00,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:00,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:00,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:00,950 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 18:37:00,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:00,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:37:00,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:00,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:37:00,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:37:00,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:37:00,951 INFO L87 Difference]: Start difference. First operand 6435 states and 14760 transitions. Second operand 4 states. [2018-12-09 18:37:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:01,016 INFO L93 Difference]: Finished difference Result 6823 states and 15667 transitions. [2018-12-09 18:37:01,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:37:01,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-09 18:37:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:01,021 INFO L225 Difference]: With dead ends: 6823 [2018-12-09 18:37:01,021 INFO L226 Difference]: Without dead ends: 6823 [2018-12-09 18:37:01,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:37:01,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6823 states. [2018-12-09 18:37:01,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6823 to 6359. [2018-12-09 18:37:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6359 states. [2018-12-09 18:37:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6359 states to 6359 states and 14673 transitions. [2018-12-09 18:37:01,082 INFO L78 Accepts]: Start accepts. Automaton has 6359 states and 14673 transitions. Word has length 90 [2018-12-09 18:37:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:01,082 INFO L480 AbstractCegarLoop]: Abstraction has 6359 states and 14673 transitions. [2018-12-09 18:37:01,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:37:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 6359 states and 14673 transitions. [2018-12-09 18:37:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 18:37:01,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:01,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:01,087 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:01,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:01,087 INFO L82 PathProgramCache]: Analyzing trace with hash -71232549, now seen corresponding path program 1 times [2018-12-09 18:37:01,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:01,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:01,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:01,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:01,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:01,134 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 18:37:01,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:01,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:37:01,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:01,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:37:01,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:37:01,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:37:01,135 INFO L87 Difference]: Start difference. First operand 6359 states and 14673 transitions. Second operand 5 states. [2018-12-09 18:37:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:01,214 INFO L93 Difference]: Finished difference Result 7324 states and 16774 transitions. [2018-12-09 18:37:01,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:37:01,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 18:37:01,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:01,220 INFO L225 Difference]: With dead ends: 7324 [2018-12-09 18:37:01,220 INFO L226 Difference]: Without dead ends: 7324 [2018-12-09 18:37:01,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:37:01,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2018-12-09 18:37:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 5724. [2018-12-09 18:37:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5724 states. [2018-12-09 18:37:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5724 states to 5724 states and 13218 transitions. [2018-12-09 18:37:01,265 INFO L78 Accepts]: Start accepts. Automaton has 5724 states and 13218 transitions. Word has length 92 [2018-12-09 18:37:01,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:01,265 INFO L480 AbstractCegarLoop]: Abstraction has 5724 states and 13218 transitions. [2018-12-09 18:37:01,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:37:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 5724 states and 13218 transitions. [2018-12-09 18:37:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 18:37:01,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:01,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] [2018-12-09 18:37:01,270 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:01,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:01,271 INFO L82 PathProgramCache]: Analyzing trace with hash -325969094, now seen corresponding path program 1 times [2018-12-09 18:37:01,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:01,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:01,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:01,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:01,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:01,306 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 18:37:01,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:01,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:37:01,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:01,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:37:01,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:37:01,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:37:01,307 INFO L87 Difference]: Start difference. First operand 5724 states and 13218 transitions. Second operand 5 states. [2018-12-09 18:37:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:01,557 INFO L93 Difference]: Finished difference Result 9776 states and 22784 transitions. [2018-12-09 18:37:01,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 18:37:01,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 18:37:01,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:01,568 INFO L225 Difference]: With dead ends: 9776 [2018-12-09 18:37:01,568 INFO L226 Difference]: Without dead ends: 9760 [2018-12-09 18:37:01,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:37:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9760 states. [2018-12-09 18:37:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 6548. [2018-12-09 18:37:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6548 states. [2018-12-09 18:37:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 15152 transitions. [2018-12-09 18:37:01,628 INFO L78 Accepts]: Start accepts. Automaton has 6548 states and 15152 transitions. Word has length 92 [2018-12-09 18:37:01,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:01,629 INFO L480 AbstractCegarLoop]: Abstraction has 6548 states and 15152 transitions. [2018-12-09 18:37:01,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:37:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 6548 states and 15152 transitions. [2018-12-09 18:37:01,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 18:37:01,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:01,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:01,633 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:01,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:01,634 INFO L82 PathProgramCache]: Analyzing trace with hash 918795387, now seen corresponding path program 1 times [2018-12-09 18:37:01,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:01,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:01,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:01,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:01,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:01,693 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 18:37:01,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:01,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:37:01,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:01,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:37:01,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:37:01,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:37:01,694 INFO L87 Difference]: Start difference. First operand 6548 states and 15152 transitions. Second operand 6 states. [2018-12-09 18:37:01,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:01,879 INFO L93 Difference]: Finished difference Result 8814 states and 20118 transitions. [2018-12-09 18:37:01,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 18:37:01,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-09 18:37:01,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:01,885 INFO L225 Difference]: With dead ends: 8814 [2018-12-09 18:37:01,885 INFO L226 Difference]: Without dead ends: 8814 [2018-12-09 18:37:01,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:37:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8814 states. [2018-12-09 18:37:01,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8814 to 6687. [2018-12-09 18:37:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6687 states. [2018-12-09 18:37:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 15343 transitions. [2018-12-09 18:37:01,940 INFO L78 Accepts]: Start accepts. Automaton has 6687 states and 15343 transitions. Word has length 92 [2018-12-09 18:37:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:01,940 INFO L480 AbstractCegarLoop]: Abstraction has 6687 states and 15343 transitions. [2018-12-09 18:37:01,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:37:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 6687 states and 15343 transitions. [2018-12-09 18:37:01,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 18:37:01,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:01,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:01,944 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:01,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:01,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1519645583, now seen corresponding path program 1 times [2018-12-09 18:37:01,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:01,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:01,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:01,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:01,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:02,019 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 18:37:02,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:02,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 18:37:02,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:02,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 18:37:02,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 18:37:02,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:37:02,020 INFO L87 Difference]: Start difference. First operand 6687 states and 15343 transitions. Second operand 8 states. [2018-12-09 18:37:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:02,214 INFO L93 Difference]: Finished difference Result 10538 states and 23822 transitions. [2018-12-09 18:37:02,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 18:37:02,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-12-09 18:37:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:02,221 INFO L225 Difference]: With dead ends: 10538 [2018-12-09 18:37:02,222 INFO L226 Difference]: Without dead ends: 10538 [2018-12-09 18:37:02,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:37:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10538 states. [2018-12-09 18:37:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10538 to 7565. [2018-12-09 18:37:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7565 states. [2018-12-09 18:37:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7565 states to 7565 states and 17306 transitions. [2018-12-09 18:37:02,289 INFO L78 Accepts]: Start accepts. Automaton has 7565 states and 17306 transitions. Word has length 92 [2018-12-09 18:37:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:02,289 INFO L480 AbstractCegarLoop]: Abstraction has 7565 states and 17306 transitions. [2018-12-09 18:37:02,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 18:37:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 7565 states and 17306 transitions. [2018-12-09 18:37:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 18:37:02,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:02,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:02,295 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:02,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash -557563760, now seen corresponding path program 1 times [2018-12-09 18:37:02,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:02,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:02,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:02,383 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 18:37:02,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:02,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 18:37:02,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:02,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 18:37:02,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 18:37:02,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:37:02,384 INFO L87 Difference]: Start difference. First operand 7565 states and 17306 transitions. Second operand 9 states. [2018-12-09 18:37:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:02,714 INFO L93 Difference]: Finished difference Result 10846 states and 24728 transitions. [2018-12-09 18:37:02,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 18:37:02,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2018-12-09 18:37:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:02,722 INFO L225 Difference]: With dead ends: 10846 [2018-12-09 18:37:02,723 INFO L226 Difference]: Without dead ends: 10814 [2018-12-09 18:37:02,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-09 18:37:02,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10814 states. [2018-12-09 18:37:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10814 to 9413. [2018-12-09 18:37:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9413 states. [2018-12-09 18:37:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9413 states to 9413 states and 21423 transitions. [2018-12-09 18:37:02,798 INFO L78 Accepts]: Start accepts. Automaton has 9413 states and 21423 transitions. Word has length 92 [2018-12-09 18:37:02,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:02,798 INFO L480 AbstractCegarLoop]: Abstraction has 9413 states and 21423 transitions. [2018-12-09 18:37:02,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 18:37:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 9413 states and 21423 transitions. [2018-12-09 18:37:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 18:37:02,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:02,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:02,806 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:02,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1940452177, now seen corresponding path program 1 times [2018-12-09 18:37:02,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:02,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:02,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:02,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:02,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:02,865 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 18:37:02,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:02,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 18:37:02,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:02,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 18:37:02,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 18:37:02,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:37:02,866 INFO L87 Difference]: Start difference. First operand 9413 states and 21423 transitions. Second operand 8 states. [2018-12-09 18:37:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:03,185 INFO L93 Difference]: Finished difference Result 13961 states and 32328 transitions. [2018-12-09 18:37:03,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 18:37:03,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-12-09 18:37:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:03,196 INFO L225 Difference]: With dead ends: 13961 [2018-12-09 18:37:03,196 INFO L226 Difference]: Without dead ends: 13961 [2018-12-09 18:37:03,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 18:37:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13961 states. [2018-12-09 18:37:03,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13961 to 9923. [2018-12-09 18:37:03,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9923 states. [2018-12-09 18:37:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9923 states to 9923 states and 22780 transitions. [2018-12-09 18:37:03,293 INFO L78 Accepts]: Start accepts. Automaton has 9923 states and 22780 transitions. Word has length 92 [2018-12-09 18:37:03,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:03,293 INFO L480 AbstractCegarLoop]: Abstraction has 9923 states and 22780 transitions. [2018-12-09 18:37:03,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 18:37:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 9923 states and 22780 transitions. [2018-12-09 18:37:03,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 18:37:03,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:03,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:03,300 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:03,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:03,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1467011438, now seen corresponding path program 1 times [2018-12-09 18:37:03,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:03,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:03,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:03,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:03,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:03,332 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 18:37:03,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:03,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:37:03,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:03,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:37:03,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:37:03,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:37:03,333 INFO L87 Difference]: Start difference. First operand 9923 states and 22780 transitions. Second operand 3 states. [2018-12-09 18:37:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:03,367 INFO L93 Difference]: Finished difference Result 9667 states and 21980 transitions. [2018-12-09 18:37:03,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:37:03,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-12-09 18:37:03,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:03,376 INFO L225 Difference]: With dead ends: 9667 [2018-12-09 18:37:03,376 INFO L226 Difference]: Without dead ends: 9635 [2018-12-09 18:37:03,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 18:37:03,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9635 states. [2018-12-09 18:37:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9635 to 7662. [2018-12-09 18:37:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2018-12-09 18:37:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 17304 transitions. [2018-12-09 18:37:03,443 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 17304 transitions. Word has length 92 [2018-12-09 18:37:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:03,443 INFO L480 AbstractCegarLoop]: Abstraction has 7662 states and 17304 transitions. [2018-12-09 18:37:03,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:37:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 17304 transitions. [2018-12-09 18:37:03,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 18:37:03,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:03,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:03,448 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:03,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:03,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2042666210, now seen corresponding path program 1 times [2018-12-09 18:37:03,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:03,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:03,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:03,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:03,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:03,481 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 18:37:03,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:03,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:37:03,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:03,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:37:03,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:37:03,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:37:03,482 INFO L87 Difference]: Start difference. First operand 7662 states and 17304 transitions. Second operand 4 states. [2018-12-09 18:37:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:03,617 INFO L93 Difference]: Finished difference Result 8647 states and 19331 transitions. [2018-12-09 18:37:03,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:37:03,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 18:37:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:03,624 INFO L225 Difference]: With dead ends: 8647 [2018-12-09 18:37:03,624 INFO L226 Difference]: Without dead ends: 8531 [2018-12-09 18:37:03,624 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 18:37:03,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8531 states. [2018-12-09 18:37:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8531 to 7965. [2018-12-09 18:37:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7965 states. [2018-12-09 18:37:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 17865 transitions. [2018-12-09 18:37:03,688 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 17865 transitions. Word has length 94 [2018-12-09 18:37:03,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:03,688 INFO L480 AbstractCegarLoop]: Abstraction has 7965 states and 17865 transitions. [2018-12-09 18:37:03,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:37:03,688 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 17865 transitions. [2018-12-09 18:37:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 18:37:03,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:03,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, 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 18:37:03,693 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:03,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:03,693 INFO L82 PathProgramCache]: Analyzing trace with hash -245894046, now seen corresponding path program 1 times [2018-12-09 18:37:03,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:03,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:03,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:03,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:03,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:03,786 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 18:37:03,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:03,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 18:37:03,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:03,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 18:37:03,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 18:37:03,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:37:03,786 INFO L87 Difference]: Start difference. First operand 7965 states and 17865 transitions. Second operand 9 states. [2018-12-09 18:37:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:04,144 INFO L93 Difference]: Finished difference Result 9894 states and 21848 transitions. [2018-12-09 18:37:04,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 18:37:04,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-09 18:37:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:04,150 INFO L225 Difference]: With dead ends: 9894 [2018-12-09 18:37:04,151 INFO L226 Difference]: Without dead ends: 9894 [2018-12-09 18:37:04,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-09 18:37:04,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9894 states. [2018-12-09 18:37:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9894 to 8424. [2018-12-09 18:37:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8424 states. [2018-12-09 18:37:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8424 states to 8424 states and 18820 transitions. [2018-12-09 18:37:04,213 INFO L78 Accepts]: Start accepts. Automaton has 8424 states and 18820 transitions. Word has length 94 [2018-12-09 18:37:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:04,214 INFO L480 AbstractCegarLoop]: Abstraction has 8424 states and 18820 transitions. [2018-12-09 18:37:04,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 18:37:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 8424 states and 18820 transitions. [2018-12-09 18:37:04,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 18:37:04,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:04,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:04,220 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:04,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:04,220 INFO L82 PathProgramCache]: Analyzing trace with hash -34543133, now seen corresponding path program 1 times [2018-12-09 18:37:04,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:04,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:04,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:04,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:04,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:04,336 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 18:37:04,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:04,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 18:37:04,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:04,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 18:37:04,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 18:37:04,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-09 18:37:04,337 INFO L87 Difference]: Start difference. First operand 8424 states and 18820 transitions. Second operand 13 states. [2018-12-09 18:37:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:04,992 INFO L93 Difference]: Finished difference Result 12280 states and 26987 transitions. [2018-12-09 18:37:04,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 18:37:04,993 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-12-09 18:37:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:05,001 INFO L225 Difference]: With dead ends: 12280 [2018-12-09 18:37:05,002 INFO L226 Difference]: Without dead ends: 12280 [2018-12-09 18:37:05,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-12-09 18:37:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12280 states. [2018-12-09 18:37:05,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12280 to 9362. [2018-12-09 18:37:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9362 states. [2018-12-09 18:37:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9362 states to 9362 states and 20907 transitions. [2018-12-09 18:37:05,080 INFO L78 Accepts]: Start accepts. Automaton has 9362 states and 20907 transitions. Word has length 94 [2018-12-09 18:37:05,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:05,080 INFO L480 AbstractCegarLoop]: Abstraction has 9362 states and 20907 transitions. [2018-12-09 18:37:05,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 18:37:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 9362 states and 20907 transitions. [2018-12-09 18:37:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 18:37:05,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:05,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:05,087 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:05,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:05,087 INFO L82 PathProgramCache]: Analyzing trace with hash 852960548, now seen corresponding path program 1 times [2018-12-09 18:37:05,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:05,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:05,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:05,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:05,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:05,193 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 18:37:05,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:05,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 18:37:05,193 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:05,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 18:37:05,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 18:37:05,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:37:05,194 INFO L87 Difference]: Start difference. First operand 9362 states and 20907 transitions. Second operand 11 states. [2018-12-09 18:37:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:06,025 INFO L93 Difference]: Finished difference Result 17986 states and 40330 transitions. [2018-12-09 18:37:06,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 18:37:06,025 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-12-09 18:37:06,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:06,034 INFO L225 Difference]: With dead ends: 17986 [2018-12-09 18:37:06,035 INFO L226 Difference]: Without dead ends: 12569 [2018-12-09 18:37:06,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 18:37:06,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12569 states. [2018-12-09 18:37:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12569 to 9259. [2018-12-09 18:37:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9259 states. [2018-12-09 18:37:06,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9259 states to 9259 states and 20612 transitions. [2018-12-09 18:37:06,112 INFO L78 Accepts]: Start accepts. Automaton has 9259 states and 20612 transitions. Word has length 94 [2018-12-09 18:37:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:06,112 INFO L480 AbstractCegarLoop]: Abstraction has 9259 states and 20612 transitions. [2018-12-09 18:37:06,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 18:37:06,112 INFO L276 IsEmpty]: Start isEmpty. Operand 9259 states and 20612 transitions. [2018-12-09 18:37:06,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 18:37:06,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:06,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:06,118 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:06,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:06,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1407956571, now seen corresponding path program 2 times [2018-12-09 18:37:06,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:06,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:06,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:37:06,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:06,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:37:06,226 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 18:37:06,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:37:06,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 18:37:06,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:37:06,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 18:37:06,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 18:37:06,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:37:06,227 INFO L87 Difference]: Start difference. First operand 9259 states and 20612 transitions. Second operand 12 states. [2018-12-09 18:37:06,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:37:06,620 INFO L93 Difference]: Finished difference Result 11480 states and 25371 transitions. [2018-12-09 18:37:06,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 18:37:06,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-09 18:37:06,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:37:06,630 INFO L225 Difference]: With dead ends: 11480 [2018-12-09 18:37:06,630 INFO L226 Difference]: Without dead ends: 11480 [2018-12-09 18:37:06,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-12-09 18:37:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11480 states. [2018-12-09 18:37:06,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11480 to 9336. [2018-12-09 18:37:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9336 states. [2018-12-09 18:37:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9336 states to 9336 states and 20771 transitions. [2018-12-09 18:37:06,705 INFO L78 Accepts]: Start accepts. Automaton has 9336 states and 20771 transitions. Word has length 94 [2018-12-09 18:37:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:37:06,706 INFO L480 AbstractCegarLoop]: Abstraction has 9336 states and 20771 transitions. [2018-12-09 18:37:06,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 18:37:06,706 INFO L276 IsEmpty]: Start isEmpty. Operand 9336 states and 20771 transitions. [2018-12-09 18:37:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 18:37:06,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:37:06,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:37:06,712 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:37:06,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:37:06,712 INFO L82 PathProgramCache]: Analyzing trace with hash -520452890, now seen corresponding path program 2 times [2018-12-09 18:37:06,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:37:06,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:06,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:37:06,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:37:06,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:37:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 18:37:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 18:37:06,757 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 18:37:06,823 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 18:37:06,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:37:06 BasicIcfg [2018-12-09 18:37:06,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 18:37:06,824 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 18:37:06,824 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 18:37:06,824 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 18:37:06,825 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:36:49" (3/4) ... [2018-12-09 18:37:06,826 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 18:37:06,892 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0e5cca02-405e-4d2c-bd2c-4924c46f8c1c/bin-2019/utaipan/witness.graphml [2018-12-09 18:37:06,892 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 18:37:06,893 INFO L168 Benchmark]: Toolchain (without parser) took 18343.44 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 950.6 MB in the beginning and 1.4 GB in the end (delta: -495.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-09 18:37:06,894 INFO L168 Benchmark]: CDTParser took 0.14 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 18:37:06,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-09 18:37:06,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.03 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 18:37:06,894 INFO L168 Benchmark]: Boogie Preprocessor took 21.00 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 18:37:06,894 INFO L168 Benchmark]: RCFGBuilder took 322.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. [2018-12-09 18:37:06,895 INFO L168 Benchmark]: TraceAbstraction took 17540.30 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -474.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-09 18:37:06,895 INFO L168 Benchmark]: Witness Printer took 68.06 ms. Allocated memory is still 2.7 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 67.8 MB). Peak memory consumption was 67.8 MB. Max. memory is 11.5 GB. [2018-12-09 18:37:06,896 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.14 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 356.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.03 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.00 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 322.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17540.30 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -474.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 68.06 ms. Allocated memory is still 2.7 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 67.8 MB). Peak memory consumption was 67.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L681] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L682] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L683] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L684] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L689] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L690] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L691] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L692] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L693] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] -1 pthread_t t1451; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] FCALL, FORK -1 pthread_create(&t1451, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 1 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1452; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1452, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 2 [L730] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L731] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L732] 1 y$flush_delayed = weak$$choice2 [L733] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L735] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L736] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L720] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L740] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$flush_delayed ? y$mem_tmp : y [L743] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L746] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L778] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L784] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 3 error locations. UNSAFE Result, 17.4s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 8.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8300 SDtfs, 8819 SDslu, 21183 SDs, 0 SdLazy, 9712 SolverSat, 462 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 92 SyntacticMatches, 33 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34805occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 86686 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2446 NumberOfCodeBlocks, 2446 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2320 ConstructedInterpolants, 0 QuantifiedInterpolants, 489107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...