/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:32:29,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:32:29,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:32:29,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:32:29,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:32:29,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:32:29,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:32:29,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:32:29,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:32:29,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:32:29,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:32:29,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:32:29,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:32:29,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:32:29,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:32:29,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:32:29,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:32:29,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:32:29,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:32:29,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:32:29,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:32:29,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:32:29,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:32:29,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:32:29,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:32:29,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:32:29,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:32:29,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:32:29,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:32:29,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:32:29,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:32:29,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:32:29,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:32:29,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:32:29,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:32:29,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:32:29,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:32:29,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:32:29,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:32:29,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:32:29,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:32:29,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:32:29,526 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:32:29,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:32:29,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:32:29,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:32:29,528 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:32:29,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:32:29,528 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:32:29,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:32:29,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:32:29,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:32:29,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:32:29,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:32:29,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:32:29,531 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:32:29,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:32:29,532 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:32:29,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:32:29,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:32:29,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:32:29,532 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:32:29,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:32:29,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:32:29,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:32:29,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:32:29,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:32:29,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:32:29,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:32:29,534 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:32:29,534 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:32:29,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:32:29,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:32:29,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:32:29,855 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:32:29,855 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:32:29,856 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2019-12-18 18:32:29,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af9284a6/a19641805164474dabb9638d12fc2bf8/FLAG9f1fa1bad [2019-12-18 18:32:30,474 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:32:30,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2019-12-18 18:32:30,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af9284a6/a19641805164474dabb9638d12fc2bf8/FLAG9f1fa1bad [2019-12-18 18:32:30,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af9284a6/a19641805164474dabb9638d12fc2bf8 [2019-12-18 18:32:30,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:32:30,745 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:32:30,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:32:30,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:32:30,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:32:30,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:32:30" (1/1) ... [2019-12-18 18:32:30,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@114282da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:30, skipping insertion in model container [2019-12-18 18:32:30,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:32:30" (1/1) ... [2019-12-18 18:32:30,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:32:30,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:32:31,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:32:31,352 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:32:31,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:32:31,484 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:32:31,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:31 WrapperNode [2019-12-18 18:32:31,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:32:31,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:32:31,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:32:31,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:32:31,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:31" (1/1) ... [2019-12-18 18:32:31,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:31" (1/1) ... [2019-12-18 18:32:31,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:32:31,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:32:31,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:32:31,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:32:31,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:31" (1/1) ... [2019-12-18 18:32:31,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:31" (1/1) ... [2019-12-18 18:32:31,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:31" (1/1) ... [2019-12-18 18:32:31,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:31" (1/1) ... [2019-12-18 18:32:31,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:31" (1/1) ... [2019-12-18 18:32:31,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:31" (1/1) ... [2019-12-18 18:32:31,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:31" (1/1) ... [2019-12-18 18:32:31,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:32:31,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:32:31,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:32:31,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:32:31,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-18 18:32:31,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:32:31,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:32:31,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:32:31,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:32:31,645 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:32:31,646 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:32:31,647 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:32:31,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:32:31,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:32:31,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:32:31,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:32:31,653 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:32:32,308 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:32:32,309 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:32:32,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:32:32 BoogieIcfgContainer [2019-12-18 18:32:32,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:32:32,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:32:32,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:32:32,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:32:32,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:32:30" (1/3) ... [2019-12-18 18:32:32,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0a251a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:32:32, skipping insertion in model container [2019-12-18 18:32:32,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:31" (2/3) ... [2019-12-18 18:32:32,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0a251a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:32:32, skipping insertion in model container [2019-12-18 18:32:32,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:32:32" (3/3) ... [2019-12-18 18:32:32,322 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_rmo.oepc.i [2019-12-18 18:32:32,334 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:32:32,334 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:32:32,347 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:32:32,348 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:32:32,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,405 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,405 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,405 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,415 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,415 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,436 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,440 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,441 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:32,458 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:32:32,482 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:32:32,483 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:32:32,483 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:32:32,483 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:32:32,484 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:32:32,484 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:32:32,484 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:32:32,484 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:32:32,502 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-18 18:32:32,504 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 18:32:32,610 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 18:32:32,611 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:32:32,630 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:32:32,646 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 18:32:32,716 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 18:32:32,716 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:32:32,724 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:32:32,738 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-18 18:32:32,742 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:32:37,435 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 18:32:37,563 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46090 [2019-12-18 18:32:37,564 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 18:32:37,577 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 91 transitions [2019-12-18 18:32:38,008 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8654 states. [2019-12-18 18:32:38,011 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states. [2019-12-18 18:32:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:32:38,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:38,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:32:38,018 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:38,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:38,024 INFO L82 PathProgramCache]: Analyzing trace with hash 722891, now seen corresponding path program 1 times [2019-12-18 18:32:38,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:38,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885143640] [2019-12-18 18:32:38,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:38,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885143640] [2019-12-18 18:32:38,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:38,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:32:38,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581020527] [2019-12-18 18:32:38,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:32:38,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:38,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:32:38,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:32:38,285 INFO L87 Difference]: Start difference. First operand 8654 states. Second operand 3 states. [2019-12-18 18:32:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:38,511 INFO L93 Difference]: Finished difference Result 8604 states and 28108 transitions. [2019-12-18 18:32:38,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:32:38,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:32:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:38,639 INFO L225 Difference]: With dead ends: 8604 [2019-12-18 18:32:38,639 INFO L226 Difference]: Without dead ends: 8436 [2019-12-18 18:32:38,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-18 18:32:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8436 states. [2019-12-18 18:32:39,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8436 to 8436. [2019-12-18 18:32:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-18 18:32:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 27590 transitions. [2019-12-18 18:32:39,124 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 27590 transitions. Word has length 3 [2019-12-18 18:32:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:39,125 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 27590 transitions. [2019-12-18 18:32:39,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:32:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 27590 transitions. [2019-12-18 18:32:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:32:39,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:39,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:32:39,128 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:39,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:39,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1596153002, now seen corresponding path program 1 times [2019-12-18 18:32:39,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:39,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373435514] [2019-12-18 18:32:39,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:39,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373435514] [2019-12-18 18:32:39,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:39,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:32:39,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611985869] [2019-12-18 18:32:39,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:32:39,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:39,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:32:39,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:32:39,246 INFO L87 Difference]: Start difference. First operand 8436 states and 27590 transitions. Second operand 4 states. [2019-12-18 18:32:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:39,600 INFO L93 Difference]: Finished difference Result 13130 states and 41153 transitions. [2019-12-18 18:32:39,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:32:39,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:32:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:39,671 INFO L225 Difference]: With dead ends: 13130 [2019-12-18 18:32:39,672 INFO L226 Difference]: Without dead ends: 13123 [2019-12-18 18:32:39,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-18 18:32:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2019-12-18 18:32:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 11988. [2019-12-18 18:32:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11988 states. [2019-12-18 18:32:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 38075 transitions. [2019-12-18 18:32:40,598 INFO L78 Accepts]: Start accepts. Automaton has 11988 states and 38075 transitions. Word has length 11 [2019-12-18 18:32:40,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:40,599 INFO L462 AbstractCegarLoop]: Abstraction has 11988 states and 38075 transitions. [2019-12-18 18:32:40,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:32:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 11988 states and 38075 transitions. [2019-12-18 18:32:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:32:40,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:40,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:32:40,602 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:40,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:40,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1194917716, now seen corresponding path program 1 times [2019-12-18 18:32:40,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:40,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516401048] [2019-12-18 18:32:40,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:40,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516401048] [2019-12-18 18:32:40,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:40,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:32:40,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283987354] [2019-12-18 18:32:40,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:32:40,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:40,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:32:40,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:32:40,666 INFO L87 Difference]: Start difference. First operand 11988 states and 38075 transitions. Second operand 4 states. [2019-12-18 18:32:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:40,927 INFO L93 Difference]: Finished difference Result 14736 states and 46267 transitions. [2019-12-18 18:32:40,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:32:40,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:32:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:40,974 INFO L225 Difference]: With dead ends: 14736 [2019-12-18 18:32:40,974 INFO L226 Difference]: Without dead ends: 14736 [2019-12-18 18:32:40,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-18 18:32:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2019-12-18 18:32:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 13160. [2019-12-18 18:32:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13160 states. [2019-12-18 18:32:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 41689 transitions. [2019-12-18 18:32:41,520 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 41689 transitions. Word has length 11 [2019-12-18 18:32:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:41,520 INFO L462 AbstractCegarLoop]: Abstraction has 13160 states and 41689 transitions. [2019-12-18 18:32:41,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:32:41,520 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 41689 transitions. [2019-12-18 18:32:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 18:32:41,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:41,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:32:41,525 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:41,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:41,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1502155024, now seen corresponding path program 1 times [2019-12-18 18:32:41,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:41,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032218870] [2019-12-18 18:32:41,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:41,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032218870] [2019-12-18 18:32:41,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:41,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:32:41,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687877706] [2019-12-18 18:32:41,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:32:41,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:41,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:32:41,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:32:41,636 INFO L87 Difference]: Start difference. First operand 13160 states and 41689 transitions. Second operand 5 states. [2019-12-18 18:32:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:42,111 INFO L93 Difference]: Finished difference Result 17572 states and 54523 transitions. [2019-12-18 18:32:42,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:32:42,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 18:32:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:42,155 INFO L225 Difference]: With dead ends: 17572 [2019-12-18 18:32:42,156 INFO L226 Difference]: Without dead ends: 17565 [2019-12-18 18:32:42,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:32:42,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17565 states. [2019-12-18 18:32:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17565 to 13105. [2019-12-18 18:32:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13105 states. [2019-12-18 18:32:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13105 states to 13105 states and 41426 transitions. [2019-12-18 18:32:42,680 INFO L78 Accepts]: Start accepts. Automaton has 13105 states and 41426 transitions. Word has length 17 [2019-12-18 18:32:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:42,680 INFO L462 AbstractCegarLoop]: Abstraction has 13105 states and 41426 transitions. [2019-12-18 18:32:42,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:32:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 13105 states and 41426 transitions. [2019-12-18 18:32:42,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:32:42,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:42,693 INFO L411 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] [2019-12-18 18:32:42,693 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:42,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:42,693 INFO L82 PathProgramCache]: Analyzing trace with hash 933350131, now seen corresponding path program 1 times [2019-12-18 18:32:42,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:42,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573974735] [2019-12-18 18:32:42,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:42,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573974735] [2019-12-18 18:32:42,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:42,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:32:42,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984765575] [2019-12-18 18:32:42,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:32:42,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:32:42,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:32:42,740 INFO L87 Difference]: Start difference. First operand 13105 states and 41426 transitions. Second operand 3 states. [2019-12-18 18:32:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:42,841 INFO L93 Difference]: Finished difference Result 16057 states and 50095 transitions. [2019-12-18 18:32:42,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:32:42,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 18:32:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:42,874 INFO L225 Difference]: With dead ends: 16057 [2019-12-18 18:32:42,874 INFO L226 Difference]: Without dead ends: 16057 [2019-12-18 18:32:42,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:32:42,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16057 states. [2019-12-18 18:32:43,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16057 to 14186. [2019-12-18 18:32:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14186 states. [2019-12-18 18:32:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 44710 transitions. [2019-12-18 18:32:43,914 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 44710 transitions. Word has length 25 [2019-12-18 18:32:43,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:43,915 INFO L462 AbstractCegarLoop]: Abstraction has 14186 states and 44710 transitions. [2019-12-18 18:32:43,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:32:43,915 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 44710 transitions. [2019-12-18 18:32:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:32:43,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:43,928 INFO L411 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] [2019-12-18 18:32:43,929 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:43,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:43,929 INFO L82 PathProgramCache]: Analyzing trace with hash 933194542, now seen corresponding path program 1 times [2019-12-18 18:32:43,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:43,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676900257] [2019-12-18 18:32:43,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:43,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676900257] [2019-12-18 18:32:43,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:43,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:32:44,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437552534] [2019-12-18 18:32:44,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:32:44,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:44,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:32:44,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:32:44,001 INFO L87 Difference]: Start difference. First operand 14186 states and 44710 transitions. Second operand 4 states. [2019-12-18 18:32:44,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:44,033 INFO L93 Difference]: Finished difference Result 2296 states and 5226 transitions. [2019-12-18 18:32:44,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:32:44,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:32:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:44,038 INFO L225 Difference]: With dead ends: 2296 [2019-12-18 18:32:44,038 INFO L226 Difference]: Without dead ends: 2019 [2019-12-18 18:32:44,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-18 18:32:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-12-18 18:32:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2019. [2019-12-18 18:32:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-18 18:32:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4460 transitions. [2019-12-18 18:32:44,075 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4460 transitions. Word has length 25 [2019-12-18 18:32:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:44,075 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4460 transitions. [2019-12-18 18:32:44,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:32:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4460 transitions. [2019-12-18 18:32:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 18:32:44,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:44,079 INFO L411 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] [2019-12-18 18:32:44,079 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:44,079 INFO L82 PathProgramCache]: Analyzing trace with hash -568804126, now seen corresponding path program 1 times [2019-12-18 18:32:44,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:44,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66230762] [2019-12-18 18:32:44,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:44,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66230762] [2019-12-18 18:32:44,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:44,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:32:44,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130305100] [2019-12-18 18:32:44,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:32:44,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:44,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:32:44,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:32:44,221 INFO L87 Difference]: Start difference. First operand 2019 states and 4460 transitions. Second operand 5 states. [2019-12-18 18:32:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:44,265 INFO L93 Difference]: Finished difference Result 416 states and 758 transitions. [2019-12-18 18:32:44,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:32:44,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 18:32:44,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:44,266 INFO L225 Difference]: With dead ends: 416 [2019-12-18 18:32:44,267 INFO L226 Difference]: Without dead ends: 371 [2019-12-18 18:32:44,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-12-18 18:32:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-18 18:32:44,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 343. [2019-12-18 18:32:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-18 18:32:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 618 transitions. [2019-12-18 18:32:44,276 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 618 transitions. Word has length 37 [2019-12-18 18:32:44,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:44,276 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 618 transitions. [2019-12-18 18:32:44,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:32:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 618 transitions. [2019-12-18 18:32:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:32:44,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:44,280 INFO L411 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] [2019-12-18 18:32:44,280 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:44,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:44,281 INFO L82 PathProgramCache]: Analyzing trace with hash -506418728, now seen corresponding path program 1 times [2019-12-18 18:32:44,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:44,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31650755] [2019-12-18 18:32:44,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:44,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31650755] [2019-12-18 18:32:44,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:44,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:32:44,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060775594] [2019-12-18 18:32:44,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:32:44,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:44,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:32:44,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:32:44,379 INFO L87 Difference]: Start difference. First operand 343 states and 618 transitions. Second operand 3 states. [2019-12-18 18:32:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:44,392 INFO L93 Difference]: Finished difference Result 331 states and 582 transitions. [2019-12-18 18:32:44,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:32:44,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 18:32:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:44,393 INFO L225 Difference]: With dead ends: 331 [2019-12-18 18:32:44,393 INFO L226 Difference]: Without dead ends: 331 [2019-12-18 18:32:44,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:32:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-18 18:32:44,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2019-12-18 18:32:44,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-18 18:32:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 582 transitions. [2019-12-18 18:32:44,399 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 582 transitions. Word has length 52 [2019-12-18 18:32:44,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:44,401 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 582 transitions. [2019-12-18 18:32:44,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:32:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 582 transitions. [2019-12-18 18:32:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:32:44,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:44,403 INFO L411 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] [2019-12-18 18:32:44,403 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:44,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:44,403 INFO L82 PathProgramCache]: Analyzing trace with hash -156128935, now seen corresponding path program 1 times [2019-12-18 18:32:44,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:44,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310361085] [2019-12-18 18:32:44,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:44,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:44,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310361085] [2019-12-18 18:32:44,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:44,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:32:44,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554800457] [2019-12-18 18:32:44,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:32:44,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:44,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:32:44,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:32:44,534 INFO L87 Difference]: Start difference. First operand 331 states and 582 transitions. Second operand 5 states. [2019-12-18 18:32:44,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:44,720 INFO L93 Difference]: Finished difference Result 487 states and 864 transitions. [2019-12-18 18:32:44,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:32:44,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-18 18:32:44,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:44,722 INFO L225 Difference]: With dead ends: 487 [2019-12-18 18:32:44,722 INFO L226 Difference]: Without dead ends: 487 [2019-12-18 18:32:44,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:32:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-18 18:32:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 422. [2019-12-18 18:32:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-18 18:32:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 748 transitions. [2019-12-18 18:32:44,730 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 748 transitions. Word has length 53 [2019-12-18 18:32:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:44,731 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 748 transitions. [2019-12-18 18:32:44,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:32:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 748 transitions. [2019-12-18 18:32:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:32:44,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:44,732 INFO L411 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] [2019-12-18 18:32:44,733 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:44,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2022513439, now seen corresponding path program 2 times [2019-12-18 18:32:44,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:44,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879390076] [2019-12-18 18:32:44,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:44,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879390076] [2019-12-18 18:32:44,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:44,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:32:44,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772833629] [2019-12-18 18:32:44,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:32:44,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:44,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:32:44,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:32:44,848 INFO L87 Difference]: Start difference. First operand 422 states and 748 transitions. Second operand 6 states. [2019-12-18 18:32:44,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:44,911 INFO L93 Difference]: Finished difference Result 680 states and 1203 transitions. [2019-12-18 18:32:44,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:32:44,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 18:32:44,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:44,913 INFO L225 Difference]: With dead ends: 680 [2019-12-18 18:32:44,913 INFO L226 Difference]: Without dead ends: 309 [2019-12-18 18:32:44,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:32:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-18 18:32:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2019-12-18 18:32:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-18 18:32:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 552 transitions. [2019-12-18 18:32:44,919 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 552 transitions. Word has length 53 [2019-12-18 18:32:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:44,919 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 552 transitions. [2019-12-18 18:32:44,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:32:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 552 transitions. [2019-12-18 18:32:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:32:44,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:44,921 INFO L411 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] [2019-12-18 18:32:44,921 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:44,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:44,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1828454951, now seen corresponding path program 3 times [2019-12-18 18:32:44,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:44,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794652666] [2019-12-18 18:32:44,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:45,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794652666] [2019-12-18 18:32:45,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:45,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:32:45,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25581452] [2019-12-18 18:32:45,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 18:32:45,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:45,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 18:32:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:32:45,092 INFO L87 Difference]: Start difference. First operand 309 states and 552 transitions. Second operand 8 states. [2019-12-18 18:32:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:45,503 INFO L93 Difference]: Finished difference Result 396 states and 665 transitions. [2019-12-18 18:32:45,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:32:45,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-18 18:32:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:45,505 INFO L225 Difference]: With dead ends: 396 [2019-12-18 18:32:45,505 INFO L226 Difference]: Without dead ends: 396 [2019-12-18 18:32:45,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:32:45,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-12-18 18:32:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 249. [2019-12-18 18:32:45,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-12-18 18:32:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 421 transitions. [2019-12-18 18:32:45,510 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 421 transitions. Word has length 53 [2019-12-18 18:32:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:45,510 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 421 transitions. [2019-12-18 18:32:45,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 18:32:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 421 transitions. [2019-12-18 18:32:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:32:45,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:45,511 INFO L411 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] [2019-12-18 18:32:45,512 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:45,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:45,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1114856101, now seen corresponding path program 4 times [2019-12-18 18:32:45,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:45,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926250568] [2019-12-18 18:32:45,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:45,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926250568] [2019-12-18 18:32:45,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:45,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:32:45,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718637193] [2019-12-18 18:32:45,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:32:45,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:45,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:32:45,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:32:45,581 INFO L87 Difference]: Start difference. First operand 249 states and 421 transitions. Second operand 3 states. [2019-12-18 18:32:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:45,618 INFO L93 Difference]: Finished difference Result 249 states and 420 transitions. [2019-12-18 18:32:45,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:32:45,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 18:32:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:45,619 INFO L225 Difference]: With dead ends: 249 [2019-12-18 18:32:45,619 INFO L226 Difference]: Without dead ends: 249 [2019-12-18 18:32:45,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:32:45,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-12-18 18:32:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 206. [2019-12-18 18:32:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-12-18 18:32:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-12-18 18:32:45,623 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 53 [2019-12-18 18:32:45,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:45,623 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-12-18 18:32:45,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:32:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-12-18 18:32:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:32:45,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:45,624 INFO L411 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] [2019-12-18 18:32:45,625 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:45,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:45,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1034362442, now seen corresponding path program 1 times [2019-12-18 18:32:45,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:45,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93136225] [2019-12-18 18:32:45,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:46,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93136225] [2019-12-18 18:32:46,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:46,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 18:32:46,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484084769] [2019-12-18 18:32:46,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 18:32:46,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:46,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 18:32:46,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-12-18 18:32:46,167 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 19 states. [2019-12-18 18:32:47,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:47,766 INFO L93 Difference]: Finished difference Result 469 states and 794 transitions. [2019-12-18 18:32:47,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 18:32:47,768 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2019-12-18 18:32:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:47,769 INFO L225 Difference]: With dead ends: 469 [2019-12-18 18:32:47,769 INFO L226 Difference]: Without dead ends: 436 [2019-12-18 18:32:47,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=202, Invalid=1058, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 18:32:47,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-12-18 18:32:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 285. [2019-12-18 18:32:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-18 18:32:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 479 transitions. [2019-12-18 18:32:47,774 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 479 transitions. Word has length 54 [2019-12-18 18:32:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:47,775 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 479 transitions. [2019-12-18 18:32:47,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 18:32:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 479 transitions. [2019-12-18 18:32:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:32:47,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:47,776 INFO L411 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] [2019-12-18 18:32:47,776 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:47,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:47,777 INFO L82 PathProgramCache]: Analyzing trace with hash -387634572, now seen corresponding path program 2 times [2019-12-18 18:32:47,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:47,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105397560] [2019-12-18 18:32:47,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:48,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105397560] [2019-12-18 18:32:48,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:48,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 18:32:48,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473850477] [2019-12-18 18:32:48,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 18:32:48,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:48,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 18:32:48,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:32:48,024 INFO L87 Difference]: Start difference. First operand 285 states and 479 transitions. Second operand 14 states. [2019-12-18 18:32:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:48,711 INFO L93 Difference]: Finished difference Result 441 states and 731 transitions. [2019-12-18 18:32:48,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:32:48,712 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-18 18:32:48,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:48,713 INFO L225 Difference]: With dead ends: 441 [2019-12-18 18:32:48,713 INFO L226 Difference]: Without dead ends: 406 [2019-12-18 18:32:48,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:32:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-18 18:32:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 306. [2019-12-18 18:32:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-12-18 18:32:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 518 transitions. [2019-12-18 18:32:48,719 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 518 transitions. Word has length 54 [2019-12-18 18:32:48,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:48,720 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 518 transitions. [2019-12-18 18:32:48,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 18:32:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 518 transitions. [2019-12-18 18:32:48,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:32:48,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:48,722 INFO L411 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] [2019-12-18 18:32:48,722 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:48,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:48,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1326135034, now seen corresponding path program 3 times [2019-12-18 18:32:48,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:48,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710043258] [2019-12-18 18:32:48,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:32:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:32:48,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710043258] [2019-12-18 18:32:48,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:32:48,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:32:48,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32431885] [2019-12-18 18:32:48,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:32:48,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:32:48,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:32:48,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:32:48,975 INFO L87 Difference]: Start difference. First operand 306 states and 518 transitions. Second operand 13 states. [2019-12-18 18:32:49,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:32:49,247 INFO L93 Difference]: Finished difference Result 409 states and 672 transitions. [2019-12-18 18:32:49,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:32:49,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 18:32:49,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:32:49,248 INFO L225 Difference]: With dead ends: 409 [2019-12-18 18:32:49,248 INFO L226 Difference]: Without dead ends: 376 [2019-12-18 18:32:49,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-18 18:32:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-18 18:32:49,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 314. [2019-12-18 18:32:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-18 18:32:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 532 transitions. [2019-12-18 18:32:49,257 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 532 transitions. Word has length 54 [2019-12-18 18:32:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:32:49,257 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 532 transitions. [2019-12-18 18:32:49,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:32:49,257 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 532 transitions. [2019-12-18 18:32:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:32:49,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:32:49,258 INFO L411 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] [2019-12-18 18:32:49,259 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:32:49,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:32:49,259 INFO L82 PathProgramCache]: Analyzing trace with hash -91775718, now seen corresponding path program 4 times [2019-12-18 18:32:49,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:32:49,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195651619] [2019-12-18 18:32:49,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:32:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:32:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:32:49,395 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:32:49,398 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:32:49,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff1_thd0~0_329 0) (= v_~y$w_buff0_used~0_834 0) (= 0 |v_ULTIMATE.start_main_~#t2017~0.offset_19|) (= 0 v_~__unbuffered_cnt~0_61) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2017~0.base_24| 1)) (= 0 v_~weak$$choice0~0_14) (= v_~y$r_buff1_thd1~0_200 0) (= 0 v_~x~0_147) (= |v_#NULL.offset_3| 0) (= v_~main$tmp_guard1~0_27 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2017~0.base_24|) (= 0 v_~y$r_buff1_thd2~0_208) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2017~0.base_24|)) (= 0 v_~y$r_buff0_thd2~0_162) (= v_~y$mem_tmp~0_19 0) (= v_~weak$$choice2~0_141 0) (= v_~y$w_buff1_used~0_547 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2017~0.base_24| 4) |v_#length_13|) (= v_~y$r_buff0_thd1~0_297 0) (= 0 v_~y$flush_delayed~0_36) (= v_~main$tmp_guard0~0_33 0) (= 0 |v_#NULL.base_3|) (= 0 v_~y$w_buff0~0_485) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff0_thd0~0_416 0) (= v_~y~0_146 0) (< 0 |v_#StackHeapBarrier_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2017~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2017~0.base_24|) |v_ULTIMATE.start_main_~#t2017~0.offset_19| 0)) |v_#memory_int_11|) (= v_~y$w_buff1~0_308 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_41|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_145|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_297, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ULTIMATE.start_main_~#t2017~0.base=|v_ULTIMATE.start_main_~#t2017~0.base_24|, #length=|v_#length_13|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_36|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_41|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_44|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_38|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_308, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_329, ~x~0=v_~x~0_147, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_834, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_33|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_200, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y~0=v_~y~0_146, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_27|, ULTIMATE.start_main_~#t2018~0.offset=|v_ULTIMATE.start_main_~#t2018~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_35|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_208, ULTIMATE.start_main_~#t2018~0.base=|v_ULTIMATE.start_main_~#t2018~0.base_19|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_416, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2017~0.offset=|v_ULTIMATE.start_main_~#t2017~0.offset_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_14|, ~weak$$choice2~0=v_~weak$$choice2~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2017~0.base, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t2018~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t2018~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t2017~0.offset, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:32:49,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L779-1-->L781: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2018~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2018~0.base_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2018~0.base_11|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2018~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2018~0.base_11|) |v_ULTIMATE.start_main_~#t2018~0.offset_10| 1))) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2018~0.base_11| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2018~0.base_11| 1) |v_#valid_27|) (= 0 |v_ULTIMATE.start_main_~#t2018~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2018~0.base=|v_ULTIMATE.start_main_~#t2018~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ULTIMATE.start_main_~#t2018~0.offset=|v_ULTIMATE.start_main_~#t2018~0.offset_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2018~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2018~0.offset, #length] because there is no mapped edge [2019-12-18 18:32:49,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1~0_121 v_~y$w_buff0~0_204) (= 2 v_~y$w_buff0~0_203) (= v_P0Thread1of1ForFork0_~arg.base_96 |v_P0Thread1of1ForFork0_#in~arg.base_96|) (= 0 (mod v_~y$w_buff1_used~0_210 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_P0Thread1of1ForFork0_~arg.offset_96 |v_P0Thread1of1ForFork0_#in~arg.offset_96|) (= v_~y$w_buff0_used~0_350 v_~y$w_buff1_used~0_210) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_~y$w_buff0_used~0_349 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_204, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_349, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$w_buff0~0=v_~y$w_buff0~0_203, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_96, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_210} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:32:49,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2037333191 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In2037333191 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out2037333191| ~y$w_buff1~0_In2037333191) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In2037333191 |P1Thread1of1ForFork1_#t~ite9_Out2037333191|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2037333191, ~y$w_buff1~0=~y$w_buff1~0_In2037333191, ~y~0=~y~0_In2037333191, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2037333191} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2037333191, ~y$w_buff1~0=~y$w_buff1~0_In2037333191, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out2037333191|, ~y~0=~y~0_In2037333191, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2037333191} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 18:32:49,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= v_~y~0_41 |v_P1Thread1of1ForFork1_#t~ite9_10|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_10|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_9|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 18:32:49,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-2130509343 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2130509343 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-2130509343|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-2130509343| ~y$w_buff0_used~0_In-2130509343)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2130509343, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2130509343} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2130509343, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2130509343, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2130509343|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:32:49,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-117553335 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-117553335 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-117553335 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-117553335 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-117553335|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-117553335 |P1Thread1of1ForFork1_#t~ite12_Out-117553335|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-117553335, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-117553335, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-117553335, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-117553335} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-117553335, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-117553335, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-117553335, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-117553335|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-117553335} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:32:49,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In412000378 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In412000378 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out412000378|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out412000378| ~y$r_buff0_thd2~0_In412000378)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In412000378, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In412000378} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In412000378, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In412000378, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out412000378|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 18:32:49,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1669893434 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1669893434 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1669893434 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1669893434 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1669893434 |P1Thread1of1ForFork1_#t~ite14_Out-1669893434|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1669893434| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1669893434, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1669893434, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1669893434, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1669893434} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1669893434, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1669893434, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1669893434, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1669893434|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1669893434} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:32:49,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~y$r_buff1_thd2~0_91) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:32:49,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1378568153 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1378568153 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1378568153 |P0Thread1of1ForFork0_#t~ite5_Out-1378568153|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1378568153|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1378568153, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1378568153} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1378568153|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1378568153, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1378568153} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:32:49,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1326777436 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1326777436 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1326777436 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1326777436 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1326777436|)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-1326777436 |P0Thread1of1ForFork0_#t~ite6_Out-1326777436|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1326777436, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1326777436, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1326777436, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1326777436} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1326777436|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1326777436, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1326777436, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1326777436, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1326777436} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:32:49,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1494824795 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1494824795 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out1494824795 ~y$r_buff0_thd1~0_In1494824795) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out1494824795)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1494824795, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1494824795} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1494824795, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1494824795|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1494824795} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:32:49,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1964519427 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1964519427 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1964519427 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1964519427 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1964519427| ~y$r_buff1_thd1~0_In-1964519427) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1964519427| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1964519427, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1964519427, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1964519427, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1964519427} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1964519427, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1964519427, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1964519427|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1964519427, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1964519427} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:32:49,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L740-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 18:32:49,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 18:32:49,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In390132024 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In390132024 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite17_Out390132024| |ULTIMATE.start_main_#t~ite18_Out390132024|))) (or (and (or .cse0 .cse1) (= ~y~0_In390132024 |ULTIMATE.start_main_#t~ite17_Out390132024|) .cse2) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out390132024| ~y$w_buff1~0_In390132024) (not .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In390132024, ~y~0=~y~0_In390132024, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In390132024, ~y$w_buff1_used~0=~y$w_buff1_used~0_In390132024} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out390132024|, ~y$w_buff1~0=~y$w_buff1~0_In390132024, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out390132024|, ~y~0=~y~0_In390132024, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In390132024, ~y$w_buff1_used~0=~y$w_buff1_used~0_In390132024} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 18:32:49,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-233450960 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-233450960 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite19_Out-233450960|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-233450960 |ULTIMATE.start_main_#t~ite19_Out-233450960|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-233450960, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-233450960} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-233450960, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-233450960|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-233450960} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 18:32:49,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-174960764 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-174960764 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-174960764 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-174960764 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-174960764|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-174960764 |ULTIMATE.start_main_#t~ite20_Out-174960764|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-174960764, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-174960764, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-174960764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-174960764} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-174960764, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-174960764, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-174960764|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-174960764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-174960764} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 18:32:49,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In975468222 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In975468222 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out975468222| ~y$r_buff0_thd0~0_In975468222)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out975468222|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In975468222, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In975468222} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In975468222, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In975468222, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out975468222|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 18:32:49,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1011962952 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1011962952 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1011962952 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1011962952 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-1011962952| 0)) (and (= |ULTIMATE.start_main_#t~ite22_Out-1011962952| ~y$r_buff1_thd0~0_In-1011962952) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1011962952, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1011962952, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1011962952, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1011962952} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1011962952, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1011962952, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1011962952, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1011962952|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1011962952} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 18:32:49,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1580732065 256)))) (or (and (= |ULTIMATE.start_main_#t~ite32_Out1580732065| ~y$w_buff1~0_In1580732065) (= |ULTIMATE.start_main_#t~ite31_In1580732065| |ULTIMATE.start_main_#t~ite31_Out1580732065|) (not .cse0)) (and (= ~y$w_buff1~0_In1580732065 |ULTIMATE.start_main_#t~ite31_Out1580732065|) (= |ULTIMATE.start_main_#t~ite32_Out1580732065| |ULTIMATE.start_main_#t~ite31_Out1580732065|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1580732065 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1580732065 256))) (and (= 0 (mod ~y$r_buff1_thd0~0_In1580732065 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1580732065 256) 0)))))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1580732065, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1580732065, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1580732065, ~weak$$choice2~0=~weak$$choice2~0_In1580732065, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In1580732065|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1580732065, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1580732065} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1580732065, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1580732065, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1580732065, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1580732065|, ~weak$$choice2~0=~weak$$choice2~0_In1580732065, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1580732065|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1580732065, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1580732065} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 18:32:49,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (= v_~y$r_buff0_thd0~0_162 v_~y$r_buff0_thd0~0_163) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 18:32:49,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (not (= 0 (mod v_~y$flush_delayed~0_25 256))) (= v_~y~0_106 v_~y$mem_tmp~0_13)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_106, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:32:49,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 18:32:49,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:32:49 BasicIcfg [2019-12-18 18:32:49,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:32:49,532 INFO L168 Benchmark]: Toolchain (without parser) took 18787.28 ms. Allocated memory was 146.3 MB in the beginning and 760.2 MB in the end (delta: 613.9 MB). Free memory was 102.3 MB in the beginning and 438.0 MB in the end (delta: -335.7 MB). Peak memory consumption was 278.2 MB. Max. memory is 7.1 GB. [2019-12-18 18:32:49,532 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 18:32:49,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.18 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 158.6 MB in the end (delta: -56.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:32:49,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.67 ms. Allocated memory is still 203.9 MB. Free memory was 158.6 MB in the beginning and 155.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 18:32:49,535 INFO L168 Benchmark]: Boogie Preprocessor took 36.83 ms. Allocated memory is still 203.9 MB. Free memory was 155.4 MB in the beginning and 153.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:32:49,540 INFO L168 Benchmark]: RCFGBuilder took 720.27 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 109.3 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:32:49,541 INFO L168 Benchmark]: TraceAbstraction took 17218.16 ms. Allocated memory was 203.9 MB in the beginning and 760.2 MB in the end (delta: 556.3 MB). Free memory was 108.6 MB in the beginning and 438.0 MB in the end (delta: -329.4 MB). Peak memory consumption was 226.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:32:49,548 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.46 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 739.18 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 158.6 MB in the end (delta: -56.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.67 ms. Allocated memory is still 203.9 MB. Free memory was 158.6 MB in the beginning and 155.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.83 ms. Allocated memory is still 203.9 MB. Free memory was 155.4 MB in the beginning and 153.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 720.27 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 109.3 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17218.16 ms. Allocated memory was 203.9 MB in the beginning and 760.2 MB in the end (delta: 556.3 MB). Free memory was 108.6 MB in the beginning and 438.0 MB in the end (delta: -329.4 MB). Peak memory consumption was 226.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 146 ProgramPointsBefore, 79 ProgramPointsAfterwards, 180 TransitionsBefore, 91 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 3678 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 69 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 46090 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2017, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2018, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1508 SDtfs, 1426 SDslu, 3983 SDs, 0 SdLazy, 2905 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14186occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 9638 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 540 ConstructedInterpolants, 0 QuantifiedInterpolants, 117571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...