./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_034ec302-3f6f-42fc-97fa-b7fc368385ae/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_034ec302-3f6f-42fc-97fa-b7fc368385ae/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_034ec302-3f6f-42fc-97fa-b7fc368385ae/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_034ec302-3f6f-42fc-97fa-b7fc368385ae/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_power.opt.i -s /tmp/vcloud-vcloud-master/worker/working_dir_034ec302-3f6f-42fc-97fa-b7fc368385ae/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_034ec302-3f6f-42fc-97fa-b7fc368385ae/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eed4165ea564d0f21104ff4cf209191d6ddb3441 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-cad4683 [2019-10-22 09:00:48,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:48,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:48,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:48,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:48,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:48,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:48,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:48,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:48,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:48,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:48,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:48,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:48,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:48,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:48,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:48,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:48,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:48,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:48,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:48,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:48,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:48,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:48,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:48,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:48,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:48,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:48,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:48,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:48,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:48,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:48,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:48,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:48,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:48,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:48,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:48,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:48,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:48,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:48,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:48,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:48,274 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_034ec302-3f6f-42fc-97fa-b7fc368385ae/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:00:48,286 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:48,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:48,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:48,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:48,288 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:48,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:48,288 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:48,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:48,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:48,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:48,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:00:48,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:00:48,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:00:48,290 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:48,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:48,290 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:48,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:00:48,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:48,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:48,291 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:00:48,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:00:48,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:00:48,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:48,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:00:48,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:00:48,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:48,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:00:48,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:00:48,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_034ec302-3f6f-42fc-97fa-b7fc368385ae/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eed4165ea564d0f21104ff4cf209191d6ddb3441 [2019-10-22 09:00:48,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:48,332 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:48,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:48,336 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:48,337 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:48,337 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_034ec302-3f6f-42fc-97fa-b7fc368385ae/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_power.opt.i [2019-10-22 09:00:48,389 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_034ec302-3f6f-42fc-97fa-b7fc368385ae/bin/uautomizer/data/41eae3a11/181668dec4884124906278a7625b72bf/FLAGf677dab63 [2019-10-22 09:00:48,857 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:48,858 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_034ec302-3f6f-42fc-97fa-b7fc368385ae/sv-benchmarks/c/pthread-wmm/safe033_power.opt.i [2019-10-22 09:00:48,872 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_034ec302-3f6f-42fc-97fa-b7fc368385ae/bin/uautomizer/data/41eae3a11/181668dec4884124906278a7625b72bf/FLAGf677dab63 [2019-10-22 09:00:48,886 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_034ec302-3f6f-42fc-97fa-b7fc368385ae/bin/uautomizer/data/41eae3a11/181668dec4884124906278a7625b72bf [2019-10-22 09:00:48,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:48,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:48,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:48,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:48,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:48,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:48" (1/1) ... [2019-10-22 09:00:48,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e97f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:48, skipping insertion in model container [2019-10-22 09:00:48,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:48" (1/1) ... [2019-10-22 09:00:48,908 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:48,962 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:49,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:49,419 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:49,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:49,541 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:49,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:49 WrapperNode [2019-10-22 09:00:49,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:49,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:49,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:49,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:49,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:49" (1/1) ... [2019-10-22 09:00:49,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:49" (1/1) ... [2019-10-22 09:00:49,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:49,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:49,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:49,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:49,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:49" (1/1) ... [2019-10-22 09:00:49,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:49" (1/1) ... [2019-10-22 09:00:49,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:49" (1/1) ... [2019-10-22 09:00:49,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:49" (1/1) ... [2019-10-22 09:00:49,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:49" (1/1) ... [2019-10-22 09:00:49,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:49" (1/1) ... [2019-10-22 09:00:49,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:49" (1/1) ... [2019-10-22 09:00:49,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:49,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:49,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:49,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:49,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_034ec302-3f6f-42fc-97fa-b7fc368385ae/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:00:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:00:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 09:00:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:00:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 09:00:49,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 09:00:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 09:00:49,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 09:00:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 09:00:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:49,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:49,682 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 09:00:50,243 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:50,244 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 09:00:50,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:50 BoogieIcfgContainer [2019-10-22 09:00:50,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:50,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:00:50,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:00:50,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:00:50,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:00:48" (1/3) ... [2019-10-22 09:00:50,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d61013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:00:50, skipping insertion in model container [2019-10-22 09:00:50,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:49" (2/3) ... [2019-10-22 09:00:50,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d61013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:00:50, skipping insertion in model container [2019-10-22 09:00:50,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:50" (3/3) ... [2019-10-22 09:00:50,256 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_power.opt.i [2019-10-22 09:00:50,301 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,307 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,308 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,310 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,310 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,310 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,310 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,310 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,311 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,312 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,312 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,312 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,312 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,313 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,313 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,315 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,315 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,315 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,316 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,316 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,316 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,329 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,329 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,330 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,330 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,330 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,330 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,331 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,331 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,331 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,331 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,332 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,332 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,332 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,332 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,332 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,332 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,332 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,333 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,333 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,333 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,333 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,333 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,334 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,334 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,334 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,334 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,334 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,335 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,335 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,335 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,335 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,336 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,336 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,336 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,336 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,336 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,336 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,336 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,337 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,337 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,337 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,337 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,337 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,337 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,337 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,338 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,338 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:00:50,344 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 09:00:50,344 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:00:50,354 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 09:00:50,368 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 09:00:50,389 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:00:50,390 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:00:50,390 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:00:50,391 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:50,391 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:50,391 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:00:50,391 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:50,391 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:00:50,405 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129 places, 161 transitions [2019-10-22 09:00:52,436 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27853 states. [2019-10-22 09:00:52,439 INFO L276 IsEmpty]: Start isEmpty. Operand 27853 states. [2019-10-22 09:00:52,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 09:00:52,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:52,449 INFO L380 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] [2019-10-22 09:00:52,452 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:52,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:52,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1948189748, now seen corresponding path program 1 times [2019-10-22 09:00:52,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:52,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457828553] [2019-10-22 09:00:52,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:52,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:52,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:52,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457828553] [2019-10-22 09:00:52,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:52,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:52,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998543013] [2019-10-22 09:00:52,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:00:52,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:52,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:52,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:52,705 INFO L87 Difference]: Start difference. First operand 27853 states. Second operand 4 states. [2019-10-22 09:00:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:53,229 INFO L93 Difference]: Finished difference Result 28521 states and 108878 transitions. [2019-10-22 09:00:53,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:53,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-10-22 09:00:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:53,435 INFO L225 Difference]: With dead ends: 28521 [2019-10-22 09:00:53,436 INFO L226 Difference]: Without dead ends: 21753 [2019-10-22 09:00:53,438 INFO L600 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 [2019-10-22 09:00:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21753 states. [2019-10-22 09:00:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21753 to 21753. [2019-10-22 09:00:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21753 states. [2019-10-22 09:00:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21753 states to 21753 states and 83438 transitions. [2019-10-22 09:00:54,665 INFO L78 Accepts]: Start accepts. Automaton has 21753 states and 83438 transitions. Word has length 36 [2019-10-22 09:00:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:54,666 INFO L462 AbstractCegarLoop]: Abstraction has 21753 states and 83438 transitions. [2019-10-22 09:00:54,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:00:54,666 INFO L276 IsEmpty]: Start isEmpty. Operand 21753 states and 83438 transitions. [2019-10-22 09:00:54,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 09:00:54,673 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:54,673 INFO L380 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] [2019-10-22 09:00:54,673 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:54,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:54,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2084779232, now seen corresponding path program 1 times [2019-10-22 09:00:54,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:54,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881450709] [2019-10-22 09:00:54,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:54,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:54,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881450709] [2019-10-22 09:00:54,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:54,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:54,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766125220] [2019-10-22 09:00:54,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:00:54,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:54,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:54,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:54,762 INFO L87 Difference]: Start difference. First operand 21753 states and 83438 transitions. Second operand 5 states. [2019-10-22 09:00:55,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:55,692 INFO L93 Difference]: Finished difference Result 34167 states and 124038 transitions. [2019-10-22 09:00:55,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:00:55,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-22 09:00:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:56,115 INFO L225 Difference]: With dead ends: 34167 [2019-10-22 09:00:56,115 INFO L226 Difference]: Without dead ends: 33599 [2019-10-22 09:00:56,115 INFO L600 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 [2019-10-22 09:00:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33599 states. [2019-10-22 09:00:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33599 to 31793. [2019-10-22 09:00:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31793 states. [2019-10-22 09:00:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31793 states to 31793 states and 116816 transitions. [2019-10-22 09:00:56,990 INFO L78 Accepts]: Start accepts. Automaton has 31793 states and 116816 transitions. Word has length 44 [2019-10-22 09:00:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:56,992 INFO L462 AbstractCegarLoop]: Abstraction has 31793 states and 116816 transitions. [2019-10-22 09:00:56,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:00:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 31793 states and 116816 transitions. [2019-10-22 09:00:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 09:00:56,998 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:56,998 INFO L380 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] [2019-10-22 09:00:56,999 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:56,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:56,999 INFO L82 PathProgramCache]: Analyzing trace with hash -813435401, now seen corresponding path program 1 times [2019-10-22 09:00:57,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:57,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324199805] [2019-10-22 09:00:57,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:57,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324199805] [2019-10-22 09:00:57,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:57,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:57,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519274203] [2019-10-22 09:00:57,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:00:57,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:57,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:57,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:57,114 INFO L87 Difference]: Start difference. First operand 31793 states and 116816 transitions. Second operand 5 states. [2019-10-22 09:00:57,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:57,893 INFO L93 Difference]: Finished difference Result 41641 states and 149740 transitions. [2019-10-22 09:00:57,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:00:57,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-22 09:00:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:58,044 INFO L225 Difference]: With dead ends: 41641 [2019-10-22 09:00:58,044 INFO L226 Difference]: Without dead ends: 41177 [2019-10-22 09:00:58,045 INFO L600 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 [2019-10-22 09:00:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41177 states. [2019-10-22 09:00:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41177 to 35361. [2019-10-22 09:00:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35361 states. [2019-10-22 09:00:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35361 states to 35361 states and 128874 transitions. [2019-10-22 09:00:59,010 INFO L78 Accepts]: Start accepts. Automaton has 35361 states and 128874 transitions. Word has length 45 [2019-10-22 09:00:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:59,011 INFO L462 AbstractCegarLoop]: Abstraction has 35361 states and 128874 transitions. [2019-10-22 09:00:59,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:00:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 35361 states and 128874 transitions. [2019-10-22 09:00:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 09:00:59,019 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:59,019 INFO L380 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] [2019-10-22 09:00:59,020 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1323257433, now seen corresponding path program 1 times [2019-10-22 09:00:59,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092073307] [2019-10-22 09:00:59,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:59,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092073307] [2019-10-22 09:00:59,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:59,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:59,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403727276] [2019-10-22 09:00:59,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:00:59,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:59,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:59,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:59,063 INFO L87 Difference]: Start difference. First operand 35361 states and 128874 transitions. Second operand 3 states. [2019-10-22 09:00:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:59,664 INFO L93 Difference]: Finished difference Result 45907 states and 163942 transitions. [2019-10-22 09:00:59,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:59,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-22 09:00:59,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:59,831 INFO L225 Difference]: With dead ends: 45907 [2019-10-22 09:00:59,832 INFO L226 Difference]: Without dead ends: 45907 [2019-10-22 09:00:59,832 INFO L600 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 [2019-10-22 09:01:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45907 states. [2019-10-22 09:01:00,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45907 to 40244. [2019-10-22 09:01:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40244 states. [2019-10-22 09:01:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40244 states to 40244 states and 145212 transitions. [2019-10-22 09:01:00,581 INFO L78 Accepts]: Start accepts. Automaton has 40244 states and 145212 transitions. Word has length 47 [2019-10-22 09:01:00,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:00,582 INFO L462 AbstractCegarLoop]: Abstraction has 40244 states and 145212 transitions. [2019-10-22 09:01:00,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 40244 states and 145212 transitions. [2019-10-22 09:01:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 09:01:00,595 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:00,595 INFO L380 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] [2019-10-22 09:01:00,595 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:00,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:00,596 INFO L82 PathProgramCache]: Analyzing trace with hash 598320720, now seen corresponding path program 1 times [2019-10-22 09:01:00,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:00,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618924291] [2019-10-22 09:01:00,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:00,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:00,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:00,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618924291] [2019-10-22 09:01:00,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:00,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:01:00,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731944536] [2019-10-22 09:01:00,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:01:00,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:00,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:00,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:00,672 INFO L87 Difference]: Start difference. First operand 40244 states and 145212 transitions. Second operand 6 states. [2019-10-22 09:01:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:01,705 INFO L93 Difference]: Finished difference Result 52463 states and 185474 transitions. [2019-10-22 09:01:01,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 09:01:01,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-22 09:01:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:01,839 INFO L225 Difference]: With dead ends: 52463 [2019-10-22 09:01:01,839 INFO L226 Difference]: Without dead ends: 51927 [2019-10-22 09:01:01,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:01:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51927 states. [2019-10-22 09:01:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51927 to 40895. [2019-10-22 09:01:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40895 states. [2019-10-22 09:01:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40895 states to 40895 states and 147665 transitions. [2019-10-22 09:01:02,650 INFO L78 Accepts]: Start accepts. Automaton has 40895 states and 147665 transitions. Word has length 51 [2019-10-22 09:01:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:02,651 INFO L462 AbstractCegarLoop]: Abstraction has 40895 states and 147665 transitions. [2019-10-22 09:01:02,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:01:02,651 INFO L276 IsEmpty]: Start isEmpty. Operand 40895 states and 147665 transitions. [2019-10-22 09:01:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 09:01:02,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:02,666 INFO L380 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] [2019-10-22 09:01:02,666 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:02,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:02,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1930460229, now seen corresponding path program 1 times [2019-10-22 09:01:02,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:02,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046004976] [2019-10-22 09:01:02,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:02,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:02,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046004976] [2019-10-22 09:01:02,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:02,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:01:02,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395163885] [2019-10-22 09:01:02,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:01:02,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:02,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:02,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:02,757 INFO L87 Difference]: Start difference. First operand 40895 states and 147665 transitions. Second operand 6 states. [2019-10-22 09:01:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:03,398 INFO L93 Difference]: Finished difference Result 56596 states and 201645 transitions. [2019-10-22 09:01:03,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:03,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-22 09:01:03,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:03,553 INFO L225 Difference]: With dead ends: 56596 [2019-10-22 09:01:03,554 INFO L226 Difference]: Without dead ends: 55457 [2019-10-22 09:01:03,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:01:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55457 states. [2019-10-22 09:01:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55457 to 51952. [2019-10-22 09:01:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51952 states. [2019-10-22 09:01:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51952 states to 51952 states and 186004 transitions. [2019-10-22 09:01:04,905 INFO L78 Accepts]: Start accepts. Automaton has 51952 states and 186004 transitions. Word has length 51 [2019-10-22 09:01:04,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:04,905 INFO L462 AbstractCegarLoop]: Abstraction has 51952 states and 186004 transitions. [2019-10-22 09:01:04,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:01:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 51952 states and 186004 transitions. [2019-10-22 09:01:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 09:01:04,921 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:04,921 INFO L380 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] [2019-10-22 09:01:04,922 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:04,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:04,922 INFO L82 PathProgramCache]: Analyzing trace with hash 567555708, now seen corresponding path program 1 times [2019-10-22 09:01:04,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:04,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086643140] [2019-10-22 09:01:04,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:05,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086643140] [2019-10-22 09:01:05,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:05,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:01:05,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155560849] [2019-10-22 09:01:05,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:01:05,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:05,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:01:05,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:05,008 INFO L87 Difference]: Start difference. First operand 51952 states and 186004 transitions. Second operand 7 states. [2019-10-22 09:01:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:05,909 INFO L93 Difference]: Finished difference Result 75635 states and 260101 transitions. [2019-10-22 09:01:05,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:01:05,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-22 09:01:05,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:06,083 INFO L225 Difference]: With dead ends: 75635 [2019-10-22 09:01:06,083 INFO L226 Difference]: Without dead ends: 75635 [2019-10-22 09:01:06,083 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:01:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75635 states. [2019-10-22 09:01:07,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75635 to 61470. [2019-10-22 09:01:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61470 states. [2019-10-22 09:01:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61470 states to 61470 states and 215181 transitions. [2019-10-22 09:01:07,738 INFO L78 Accepts]: Start accepts. Automaton has 61470 states and 215181 transitions. Word has length 51 [2019-10-22 09:01:07,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:07,738 INFO L462 AbstractCegarLoop]: Abstraction has 61470 states and 215181 transitions. [2019-10-22 09:01:07,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:01:07,738 INFO L276 IsEmpty]: Start isEmpty. Operand 61470 states and 215181 transitions. [2019-10-22 09:01:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 09:01:07,749 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:07,750 INFO L380 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] [2019-10-22 09:01:07,750 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:07,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:07,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1455059389, now seen corresponding path program 1 times [2019-10-22 09:01:07,750 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:07,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034279581] [2019-10-22 09:01:07,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:07,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034279581] [2019-10-22 09:01:07,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:07,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:07,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603228009] [2019-10-22 09:01:07,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:07,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:07,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:07,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:07,844 INFO L87 Difference]: Start difference. First operand 61470 states and 215181 transitions. Second operand 5 states. [2019-10-22 09:01:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:07,943 INFO L93 Difference]: Finished difference Result 13775 states and 43271 transitions. [2019-10-22 09:01:07,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:01:07,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-10-22 09:01:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:07,968 INFO L225 Difference]: With dead ends: 13775 [2019-10-22 09:01:07,968 INFO L226 Difference]: Without dead ends: 12158 [2019-10-22 09:01:07,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:07,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12158 states. [2019-10-22 09:01:08,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12158 to 12110. [2019-10-22 09:01:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12110 states. [2019-10-22 09:01:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12110 states to 12110 states and 37955 transitions. [2019-10-22 09:01:08,168 INFO L78 Accepts]: Start accepts. Automaton has 12110 states and 37955 transitions. Word has length 51 [2019-10-22 09:01:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:08,168 INFO L462 AbstractCegarLoop]: Abstraction has 12110 states and 37955 transitions. [2019-10-22 09:01:08,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 12110 states and 37955 transitions. [2019-10-22 09:01:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 09:01:08,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:08,174 INFO L380 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] [2019-10-22 09:01:08,174 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:08,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:08,174 INFO L82 PathProgramCache]: Analyzing trace with hash 911252639, now seen corresponding path program 1 times [2019-10-22 09:01:08,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:08,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085301356] [2019-10-22 09:01:08,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:08,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085301356] [2019-10-22 09:01:08,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:08,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:08,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308767595] [2019-10-22 09:01:08,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:08,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:08,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:08,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:08,244 INFO L87 Difference]: Start difference. First operand 12110 states and 37955 transitions. Second operand 4 states. [2019-10-22 09:01:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:08,403 INFO L93 Difference]: Finished difference Result 14273 states and 44578 transitions. [2019-10-22 09:01:08,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:08,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-10-22 09:01:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:08,431 INFO L225 Difference]: With dead ends: 14273 [2019-10-22 09:01:08,432 INFO L226 Difference]: Without dead ends: 14273 [2019-10-22 09:01:08,432 INFO L600 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 [2019-10-22 09:01:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2019-10-22 09:01:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 12841. [2019-10-22 09:01:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12841 states. [2019-10-22 09:01:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12841 states to 12841 states and 40180 transitions. [2019-10-22 09:01:08,617 INFO L78 Accepts]: Start accepts. Automaton has 12841 states and 40180 transitions. Word has length 61 [2019-10-22 09:01:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:08,617 INFO L462 AbstractCegarLoop]: Abstraction has 12841 states and 40180 transitions. [2019-10-22 09:01:08,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 12841 states and 40180 transitions. [2019-10-22 09:01:08,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 09:01:08,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:08,625 INFO L380 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] [2019-10-22 09:01:08,625 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:08,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:08,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1640904322, now seen corresponding path program 1 times [2019-10-22 09:01:08,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:08,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655102314] [2019-10-22 09:01:08,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:08,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655102314] [2019-10-22 09:01:08,708 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:08,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:01:08,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510282714] [2019-10-22 09:01:08,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:01:08,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:08,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:08,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:08,709 INFO L87 Difference]: Start difference. First operand 12841 states and 40180 transitions. Second operand 6 states. [2019-10-22 09:01:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:09,098 INFO L93 Difference]: Finished difference Result 16767 states and 51609 transitions. [2019-10-22 09:01:09,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:01:09,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-10-22 09:01:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:09,122 INFO L225 Difference]: With dead ends: 16767 [2019-10-22 09:01:09,122 INFO L226 Difference]: Without dead ends: 16703 [2019-10-22 09:01:09,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:01:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16703 states. [2019-10-22 09:01:09,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16703 to 13810. [2019-10-22 09:01:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13810 states. [2019-10-22 09:01:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13810 states to 13810 states and 42964 transitions. [2019-10-22 09:01:09,325 INFO L78 Accepts]: Start accepts. Automaton has 13810 states and 42964 transitions. Word has length 61 [2019-10-22 09:01:09,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:09,325 INFO L462 AbstractCegarLoop]: Abstraction has 13810 states and 42964 transitions. [2019-10-22 09:01:09,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:01:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 13810 states and 42964 transitions. [2019-10-22 09:01:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 09:01:09,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:09,333 INFO L380 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] [2019-10-22 09:01:09,333 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:09,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:09,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1008220767, now seen corresponding path program 1 times [2019-10-22 09:01:09,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:09,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415949110] [2019-10-22 09:01:09,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:09,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:09,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:09,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415949110] [2019-10-22 09:01:09,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:09,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:09,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165851906] [2019-10-22 09:01:09,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:09,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:09,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:09,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:09,392 INFO L87 Difference]: Start difference. First operand 13810 states and 42964 transitions. Second operand 4 states. [2019-10-22 09:01:09,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:09,601 INFO L93 Difference]: Finished difference Result 17357 states and 53253 transitions. [2019-10-22 09:01:09,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:09,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 09:01:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:09,626 INFO L225 Difference]: With dead ends: 17357 [2019-10-22 09:01:09,627 INFO L226 Difference]: Without dead ends: 17357 [2019-10-22 09:01:09,627 INFO L600 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 [2019-10-22 09:01:09,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17357 states. [2019-10-22 09:01:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17357 to 15781. [2019-10-22 09:01:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15781 states. [2019-10-22 09:01:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15781 states to 15781 states and 48576 transitions. [2019-10-22 09:01:09,829 INFO L78 Accepts]: Start accepts. Automaton has 15781 states and 48576 transitions. Word has length 63 [2019-10-22 09:01:09,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:09,830 INFO L462 AbstractCegarLoop]: Abstraction has 15781 states and 48576 transitions. [2019-10-22 09:01:09,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:09,830 INFO L276 IsEmpty]: Start isEmpty. Operand 15781 states and 48576 transitions. [2019-10-22 09:01:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 09:01:09,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:09,839 INFO L380 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] [2019-10-22 09:01:09,839 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:09,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:09,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1209537186, now seen corresponding path program 1 times [2019-10-22 09:01:09,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:09,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767859655] [2019-10-22 09:01:09,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:09,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:09,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:09,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:09,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767859655] [2019-10-22 09:01:09,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:09,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:09,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282228347] [2019-10-22 09:01:09,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:09,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:09,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:09,879 INFO L87 Difference]: Start difference. First operand 15781 states and 48576 transitions. Second operand 3 states. [2019-10-22 09:01:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:10,063 INFO L93 Difference]: Finished difference Result 16411 states and 50316 transitions. [2019-10-22 09:01:10,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:10,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-22 09:01:10,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:10,095 INFO L225 Difference]: With dead ends: 16411 [2019-10-22 09:01:10,095 INFO L226 Difference]: Without dead ends: 16411 [2019-10-22 09:01:10,095 INFO L600 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 [2019-10-22 09:01:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16411 states. [2019-10-22 09:01:10,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16411 to 16123. [2019-10-22 09:01:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16123 states. [2019-10-22 09:01:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16123 states to 16123 states and 49514 transitions. [2019-10-22 09:01:10,297 INFO L78 Accepts]: Start accepts. Automaton has 16123 states and 49514 transitions. Word has length 63 [2019-10-22 09:01:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:10,297 INFO L462 AbstractCegarLoop]: Abstraction has 16123 states and 49514 transitions. [2019-10-22 09:01:10,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 16123 states and 49514 transitions. [2019-10-22 09:01:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:01:10,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:10,308 INFO L380 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] [2019-10-22 09:01:10,308 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:10,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:10,308 INFO L82 PathProgramCache]: Analyzing trace with hash 844233709, now seen corresponding path program 1 times [2019-10-22 09:01:10,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:10,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194201898] [2019-10-22 09:01:10,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:10,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:10,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:10,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194201898] [2019-10-22 09:01:10,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:10,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:01:10,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463199161] [2019-10-22 09:01:10,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:01:10,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:10,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:10,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:10,425 INFO L87 Difference]: Start difference. First operand 16123 states and 49514 transitions. Second operand 6 states. [2019-10-22 09:01:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:10,844 INFO L93 Difference]: Finished difference Result 17575 states and 53333 transitions. [2019-10-22 09:01:10,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:10,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-22 09:01:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:10,867 INFO L225 Difference]: With dead ends: 17575 [2019-10-22 09:01:10,867 INFO L226 Difference]: Without dead ends: 17575 [2019-10-22 09:01:10,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:01:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17575 states. [2019-10-22 09:01:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17575 to 17006. [2019-10-22 09:01:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17006 states. [2019-10-22 09:01:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17006 states to 17006 states and 51780 transitions. [2019-10-22 09:01:11,085 INFO L78 Accepts]: Start accepts. Automaton has 17006 states and 51780 transitions. Word has length 65 [2019-10-22 09:01:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:11,085 INFO L462 AbstractCegarLoop]: Abstraction has 17006 states and 51780 transitions. [2019-10-22 09:01:11,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:01:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 17006 states and 51780 transitions. [2019-10-22 09:01:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:01:11,096 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:11,096 INFO L380 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] [2019-10-22 09:01:11,097 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:11,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1232975634, now seen corresponding path program 1 times [2019-10-22 09:01:11,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:11,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708717620] [2019-10-22 09:01:11,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:11,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:11,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708717620] [2019-10-22 09:01:11,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:11,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:01:11,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000165948] [2019-10-22 09:01:11,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:01:11,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:11,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:11,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:11,192 INFO L87 Difference]: Start difference. First operand 17006 states and 51780 transitions. Second operand 6 states. [2019-10-22 09:01:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:11,502 INFO L93 Difference]: Finished difference Result 19871 states and 58890 transitions. [2019-10-22 09:01:11,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:01:11,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-22 09:01:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:11,528 INFO L225 Difference]: With dead ends: 19871 [2019-10-22 09:01:11,528 INFO L226 Difference]: Without dead ends: 19871 [2019-10-22 09:01:11,528 INFO L600 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 [2019-10-22 09:01:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19871 states. [2019-10-22 09:01:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19871 to 17682. [2019-10-22 09:01:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17682 states. [2019-10-22 09:01:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17682 states to 17682 states and 52846 transitions. [2019-10-22 09:01:12,102 INFO L78 Accepts]: Start accepts. Automaton has 17682 states and 52846 transitions. Word has length 65 [2019-10-22 09:01:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:12,102 INFO L462 AbstractCegarLoop]: Abstraction has 17682 states and 52846 transitions. [2019-10-22 09:01:12,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:01:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 17682 states and 52846 transitions. [2019-10-22 09:01:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:01:12,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:12,113 INFO L380 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] [2019-10-22 09:01:12,113 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:12,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:12,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1021624721, now seen corresponding path program 1 times [2019-10-22 09:01:12,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:12,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890819811] [2019-10-22 09:01:12,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:12,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:12,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:12,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890819811] [2019-10-22 09:01:12,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:12,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:12,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309252714] [2019-10-22 09:01:12,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:12,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:12,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:12,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:12,181 INFO L87 Difference]: Start difference. First operand 17682 states and 52846 transitions. Second operand 5 states. [2019-10-22 09:01:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:12,480 INFO L93 Difference]: Finished difference Result 22456 states and 66794 transitions. [2019-10-22 09:01:12,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:01:12,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 09:01:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:12,529 INFO L225 Difference]: With dead ends: 22456 [2019-10-22 09:01:12,529 INFO L226 Difference]: Without dead ends: 22456 [2019-10-22 09:01:12,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22456 states. [2019-10-22 09:01:12,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22456 to 18976. [2019-10-22 09:01:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18976 states. [2019-10-22 09:01:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18976 states to 18976 states and 56242 transitions. [2019-10-22 09:01:12,876 INFO L78 Accepts]: Start accepts. Automaton has 18976 states and 56242 transitions. Word has length 65 [2019-10-22 09:01:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:12,877 INFO L462 AbstractCegarLoop]: Abstraction has 18976 states and 56242 transitions. [2019-10-22 09:01:12,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 18976 states and 56242 transitions. [2019-10-22 09:01:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:01:12,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:12,887 INFO L380 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] [2019-10-22 09:01:12,887 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:12,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1532158898, now seen corresponding path program 1 times [2019-10-22 09:01:12,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:12,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880211767] [2019-10-22 09:01:12,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:12,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:12,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:12,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880211767] [2019-10-22 09:01:12,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:12,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:12,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010489931] [2019-10-22 09:01:12,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:12,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:12,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:12,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:12,965 INFO L87 Difference]: Start difference. First operand 18976 states and 56242 transitions. Second operand 5 states. [2019-10-22 09:01:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:13,342 INFO L93 Difference]: Finished difference Result 25570 states and 75562 transitions. [2019-10-22 09:01:13,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:13,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 09:01:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:13,381 INFO L225 Difference]: With dead ends: 25570 [2019-10-22 09:01:13,381 INFO L226 Difference]: Without dead ends: 25570 [2019-10-22 09:01:13,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:01:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25570 states. [2019-10-22 09:01:13,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25570 to 20142. [2019-10-22 09:01:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20142 states. [2019-10-22 09:01:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20142 states to 20142 states and 59686 transitions. [2019-10-22 09:01:13,683 INFO L78 Accepts]: Start accepts. Automaton has 20142 states and 59686 transitions. Word has length 65 [2019-10-22 09:01:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:13,683 INFO L462 AbstractCegarLoop]: Abstraction has 20142 states and 59686 transitions. [2019-10-22 09:01:13,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 20142 states and 59686 transitions. [2019-10-22 09:01:13,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:01:13,694 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:13,694 INFO L380 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] [2019-10-22 09:01:13,695 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:13,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:13,695 INFO L82 PathProgramCache]: Analyzing trace with hash 955353935, now seen corresponding path program 1 times [2019-10-22 09:01:13,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:13,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834655462] [2019-10-22 09:01:13,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:13,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:13,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:13,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834655462] [2019-10-22 09:01:13,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:13,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:13,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093893015] [2019-10-22 09:01:13,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:13,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:13,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:13,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:13,744 INFO L87 Difference]: Start difference. First operand 20142 states and 59686 transitions. Second operand 4 states. [2019-10-22 09:01:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:14,133 INFO L93 Difference]: Finished difference Result 26770 states and 79457 transitions. [2019-10-22 09:01:14,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:14,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-22 09:01:14,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:14,179 INFO L225 Difference]: With dead ends: 26770 [2019-10-22 09:01:14,179 INFO L226 Difference]: Without dead ends: 26390 [2019-10-22 09:01:14,179 INFO L600 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 [2019-10-22 09:01:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26390 states. [2019-10-22 09:01:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26390 to 24446. [2019-10-22 09:01:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24446 states. [2019-10-22 09:01:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24446 states to 24446 states and 72598 transitions. [2019-10-22 09:01:14,508 INFO L78 Accepts]: Start accepts. Automaton has 24446 states and 72598 transitions. Word has length 65 [2019-10-22 09:01:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:14,508 INFO L462 AbstractCegarLoop]: Abstraction has 24446 states and 72598 transitions. [2019-10-22 09:01:14,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand 24446 states and 72598 transitions. [2019-10-22 09:01:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:01:14,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:14,523 INFO L380 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] [2019-10-22 09:01:14,523 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:14,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:14,524 INFO L82 PathProgramCache]: Analyzing trace with hash -841597424, now seen corresponding path program 1 times [2019-10-22 09:01:14,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:14,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452709655] [2019-10-22 09:01:14,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:14,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:14,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452709655] [2019-10-22 09:01:14,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:14,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:01:14,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280346238] [2019-10-22 09:01:14,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:01:14,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:14,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:01:14,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:14,624 INFO L87 Difference]: Start difference. First operand 24446 states and 72598 transitions. Second operand 7 states. [2019-10-22 09:01:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:14,930 INFO L93 Difference]: Finished difference Result 23034 states and 65224 transitions. [2019-10-22 09:01:14,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:01:14,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-10-22 09:01:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:14,957 INFO L225 Difference]: With dead ends: 23034 [2019-10-22 09:01:14,957 INFO L226 Difference]: Without dead ends: 23034 [2019-10-22 09:01:14,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:01:14,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23034 states. [2019-10-22 09:01:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23034 to 15897. [2019-10-22 09:01:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15897 states. [2019-10-22 09:01:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15897 states to 15897 states and 45246 transitions. [2019-10-22 09:01:15,189 INFO L78 Accepts]: Start accepts. Automaton has 15897 states and 45246 transitions. Word has length 65 [2019-10-22 09:01:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:15,189 INFO L462 AbstractCegarLoop]: Abstraction has 15897 states and 45246 transitions. [2019-10-22 09:01:15,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:01:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 15897 states and 45246 transitions. [2019-10-22 09:01:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:01:15,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:15,197 INFO L380 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] [2019-10-22 09:01:15,198 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:15,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash 45906257, now seen corresponding path program 1 times [2019-10-22 09:01:15,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:15,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328105076] [2019-10-22 09:01:15,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:15,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:15,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:15,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328105076] [2019-10-22 09:01:15,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:15,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:15,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013853138] [2019-10-22 09:01:15,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:15,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:15,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:15,258 INFO L87 Difference]: Start difference. First operand 15897 states and 45246 transitions. Second operand 5 states. [2019-10-22 09:01:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:15,299 INFO L93 Difference]: Finished difference Result 4637 states and 11013 transitions. [2019-10-22 09:01:15,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:01:15,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 09:01:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:15,304 INFO L225 Difference]: With dead ends: 4637 [2019-10-22 09:01:15,304 INFO L226 Difference]: Without dead ends: 3763 [2019-10-22 09:01:15,305 INFO L600 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 [2019-10-22 09:01:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2019-10-22 09:01:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3476. [2019-10-22 09:01:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3476 states. [2019-10-22 09:01:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 8052 transitions. [2019-10-22 09:01:15,349 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 8052 transitions. Word has length 65 [2019-10-22 09:01:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:15,349 INFO L462 AbstractCegarLoop]: Abstraction has 3476 states and 8052 transitions. [2019-10-22 09:01:15,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 8052 transitions. [2019-10-22 09:01:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:01:15,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:15,353 INFO L380 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] [2019-10-22 09:01:15,353 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:15,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:15,354 INFO L82 PathProgramCache]: Analyzing trace with hash 529305649, now seen corresponding path program 1 times [2019-10-22 09:01:15,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:15,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268372277] [2019-10-22 09:01:15,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:15,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:15,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:15,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268372277] [2019-10-22 09:01:15,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:15,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:01:15,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276169984] [2019-10-22 09:01:15,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:01:15,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:15,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:01:15,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:15,439 INFO L87 Difference]: Start difference. First operand 3476 states and 8052 transitions. Second operand 7 states. [2019-10-22 09:01:15,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:15,947 INFO L93 Difference]: Finished difference Result 4226 states and 9680 transitions. [2019-10-22 09:01:15,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 09:01:15,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-10-22 09:01:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:15,952 INFO L225 Difference]: With dead ends: 4226 [2019-10-22 09:01:15,952 INFO L226 Difference]: Without dead ends: 4192 [2019-10-22 09:01:15,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:01:15,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2019-10-22 09:01:15,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 3648. [2019-10-22 09:01:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3648 states. [2019-10-22 09:01:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 8413 transitions. [2019-10-22 09:01:15,988 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 8413 transitions. Word has length 82 [2019-10-22 09:01:15,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:15,988 INFO L462 AbstractCegarLoop]: Abstraction has 3648 states and 8413 transitions. [2019-10-22 09:01:15,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:01:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 8413 transitions. [2019-10-22 09:01:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:01:15,991 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:15,991 INFO L380 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] [2019-10-22 09:01:15,991 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:15,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:15,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1547903694, now seen corresponding path program 1 times [2019-10-22 09:01:15,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:15,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345636224] [2019-10-22 09:01:15,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:15,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:15,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:16,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345636224] [2019-10-22 09:01:16,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:16,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:01:16,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27426133] [2019-10-22 09:01:16,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:01:16,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:16,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:16,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:16,102 INFO L87 Difference]: Start difference. First operand 3648 states and 8413 transitions. Second operand 6 states. [2019-10-22 09:01:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:16,185 INFO L93 Difference]: Finished difference Result 6224 states and 14461 transitions. [2019-10-22 09:01:16,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:01:16,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 09:01:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:16,192 INFO L225 Difference]: With dead ends: 6224 [2019-10-22 09:01:16,192 INFO L226 Difference]: Without dead ends: 5382 [2019-10-22 09:01:16,192 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:01:16,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5382 states. [2019-10-22 09:01:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5382 to 3552. [2019-10-22 09:01:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3552 states. [2019-10-22 09:01:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 8205 transitions. [2019-10-22 09:01:16,251 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 8205 transitions. Word has length 82 [2019-10-22 09:01:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:16,251 INFO L462 AbstractCegarLoop]: Abstraction has 3552 states and 8205 transitions. [2019-10-22 09:01:16,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:01:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 8205 transitions. [2019-10-22 09:01:16,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:01:16,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:16,256 INFO L380 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] [2019-10-22 09:01:16,256 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:16,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:16,256 INFO L82 PathProgramCache]: Analyzing trace with hash -469329194, now seen corresponding path program 2 times [2019-10-22 09:01:16,257 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:16,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095590016] [2019-10-22 09:01:16,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:16,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:16,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:16,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095590016] [2019-10-22 09:01:16,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:16,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:01:16,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077004925] [2019-10-22 09:01:16,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:01:16,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:16,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:16,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:16,344 INFO L87 Difference]: Start difference. First operand 3552 states and 8205 transitions. Second operand 6 states. [2019-10-22 09:01:16,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:16,421 INFO L93 Difference]: Finished difference Result 6104 states and 14199 transitions. [2019-10-22 09:01:16,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:01:16,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 09:01:16,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:16,425 INFO L225 Difference]: With dead ends: 6104 [2019-10-22 09:01:16,425 INFO L226 Difference]: Without dead ends: 2656 [2019-10-22 09:01:16,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:01:16,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2019-10-22 09:01:16,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2656. [2019-10-22 09:01:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2656 states. [2019-10-22 09:01:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 6183 transitions. [2019-10-22 09:01:16,459 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 6183 transitions. Word has length 82 [2019-10-22 09:01:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:16,459 INFO L462 AbstractCegarLoop]: Abstraction has 2656 states and 6183 transitions. [2019-10-22 09:01:16,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:01:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 6183 transitions. [2019-10-22 09:01:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:01:16,462 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:16,462 INFO L380 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] [2019-10-22 09:01:16,462 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:16,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:16,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2042911069, now seen corresponding path program 2 times [2019-10-22 09:01:16,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:16,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610219376] [2019-10-22 09:01:16,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:16,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:16,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:16,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610219376] [2019-10-22 09:01:16,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:16,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:01:16,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670047649] [2019-10-22 09:01:16,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:01:16,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:16,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:16,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:16,575 INFO L87 Difference]: Start difference. First operand 2656 states and 6183 transitions. Second operand 6 states. [2019-10-22 09:01:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:16,741 INFO L93 Difference]: Finished difference Result 2935 states and 6774 transitions. [2019-10-22 09:01:16,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:01:16,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 09:01:16,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:16,745 INFO L225 Difference]: With dead ends: 2935 [2019-10-22 09:01:16,746 INFO L226 Difference]: Without dead ends: 2893 [2019-10-22 09:01:16,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2019-10-22 09:01:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2607. [2019-10-22 09:01:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2019-10-22 09:01:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 6035 transitions. [2019-10-22 09:01:16,786 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 6035 transitions. Word has length 82 [2019-10-22 09:01:16,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:16,786 INFO L462 AbstractCegarLoop]: Abstraction has 2607 states and 6035 transitions. [2019-10-22 09:01:16,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:01:16,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 6035 transitions. [2019-10-22 09:01:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:01:16,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:16,790 INFO L380 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] [2019-10-22 09:01:16,790 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:16,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:16,791 INFO L82 PathProgramCache]: Analyzing trace with hash -34298274, now seen corresponding path program 3 times [2019-10-22 09:01:16,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:16,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727938858] [2019-10-22 09:01:16,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:16,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:16,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:16,904 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:16,905 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:01:17,044 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 09:01:17,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:01:17 BasicIcfg [2019-10-22 09:01:17,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:01:17,046 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:17,046 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:17,046 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:17,047 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:50" (3/4) ... [2019-10-22 09:01:17,049 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 09:01:17,141 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_034ec302-3f6f-42fc-97fa-b7fc368385ae/bin/uautomizer/witness.graphml [2019-10-22 09:01:17,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:17,143 INFO L168 Benchmark]: Toolchain (without parser) took 28251.80 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 939.3 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 824.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:17,143 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:17,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 650.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:17,144 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.94 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. [2019-10-22 09:01:17,144 INFO L168 Benchmark]: Boogie Preprocessor took 34.86 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. [2019-10-22 09:01:17,144 INFO L168 Benchmark]: RCFGBuilder took 620.63 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: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:17,144 INFO L168 Benchmark]: TraceAbstraction took 26798.55 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 732.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:17,145 INFO L168 Benchmark]: Witness Printer took 94.71 ms. Allocated memory is still 3.8 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:17,146 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 650.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.94 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. * Boogie Preprocessor took 34.86 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. * RCFGBuilder took 620.63 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: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26798.55 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 732.2 MB. Max. memory is 11.5 GB. * Witness Printer took 94.71 ms. Allocated memory is still 3.8 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 0 pthread_t t2563; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK 0 pthread_create(&t2563, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] 0 pthread_t t2564; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2564, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L733] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 197 locations, 3 error locations. Result: UNSAFE, OverallTime: 26.6s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6105 SDtfs, 7269 SDslu, 12371 SDs, 0 SdLazy, 4928 SolverSat, 376 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 56 SyntacticMatches, 11 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61470occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 71918 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1489 NumberOfCodeBlocks, 1489 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1384 ConstructedInterpolants, 0 QuantifiedInterpolants, 229867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...