/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/safe026_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:02:59,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:02:59,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:02:59,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:02:59,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:02:59,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:02:59,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:02:59,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:02:59,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:02:59,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:02:59,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:02:59,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:02:59,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:02:59,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:02:59,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:02:59,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:02:59,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:02:59,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:02:59,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:02:59,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:02:59,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:02:59,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:02:59,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:02:59,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:02:59,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:02:59,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:02:59,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:02:59,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:02:59,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:02:59,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:02:59,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:02:59,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:02:59,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:02:59,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:02:59,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:02:59,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:02:59,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:02:59,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:02:59,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:02:59,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:02:59,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:02:59,542 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-27 04:02:59,557 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:02:59,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:02:59,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:02:59,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:02:59,558 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:02:59,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:02:59,559 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:02:59,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:02:59,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:02:59,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:02:59,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:02:59,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:02:59,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:02:59,562 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:02:59,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:02:59,563 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:02:59,563 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:02:59,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:02:59,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:02:59,563 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:02:59,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:02:59,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:02:59,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:02:59,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:02:59,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:02:59,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:02:59,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:02:59,567 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:02:59,567 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:02:59,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:02:59,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:02:59,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:02:59,848 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:02:59,848 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:02:59,849 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_rmo.oepc.i [2019-12-27 04:02:59,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2cdac56/839178830a6245a388b11539047a9fc7/FLAGeaa760a21 [2019-12-27 04:03:00,502 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:03:00,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_rmo.oepc.i [2019-12-27 04:03:00,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2cdac56/839178830a6245a388b11539047a9fc7/FLAGeaa760a21 [2019-12-27 04:03:00,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2cdac56/839178830a6245a388b11539047a9fc7 [2019-12-27 04:03:00,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:03:00,832 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:03:00,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:03:00,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:03:00,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:03:00,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:03:00" (1/1) ... [2019-12-27 04:03:00,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c2a1e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:00, skipping insertion in model container [2019-12-27 04:03:00,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:03:00" (1/1) ... [2019-12-27 04:03:00,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:03:00,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:03:01,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:03:01,422 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:03:01,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:03:01,596 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:03:01,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:01 WrapperNode [2019-12-27 04:03:01,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:03:01,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:03:01,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:03:01,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:03:01,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:01" (1/1) ... [2019-12-27 04:03:01,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:01" (1/1) ... [2019-12-27 04:03:01,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:03:01,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:03:01,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:03:01,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:03:01,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:01" (1/1) ... [2019-12-27 04:03:01,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:01" (1/1) ... [2019-12-27 04:03:01,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:01" (1/1) ... [2019-12-27 04:03:01,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:01" (1/1) ... [2019-12-27 04:03:01,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:01" (1/1) ... [2019-12-27 04:03:01,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:01" (1/1) ... [2019-12-27 04:03:01,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:01" (1/1) ... [2019-12-27 04:03:01,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:03:01,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:03:01,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:03:01,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:03:01,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:01" (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-27 04:03:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:03:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 04:03:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:03:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:03:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 04:03:01,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 04:03:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 04:03:01,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 04:03:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 04:03:01,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 04:03:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 04:03:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:03:01,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:03:01,819 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 04:03:02,665 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:03:02,665 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 04:03:02,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:03:02 BoogieIcfgContainer [2019-12-27 04:03:02,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:03:02,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:03:02,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:03:02,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:03:02,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:03:00" (1/3) ... [2019-12-27 04:03:02,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c95347b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:03:02, skipping insertion in model container [2019-12-27 04:03:02,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:01" (2/3) ... [2019-12-27 04:03:02,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c95347b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:03:02, skipping insertion in model container [2019-12-27 04:03:02,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:03:02" (3/3) ... [2019-12-27 04:03:02,676 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_rmo.oepc.i [2019-12-27 04:03:02,684 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:03:02,684 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:03:02,691 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 04:03:02,693 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:03:02,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,746 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,746 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,746 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,747 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,747 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,771 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,771 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,779 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,779 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,827 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,828 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,828 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,831 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,831 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,836 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,845 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:03:02,868 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 04:03:02,893 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:03:02,893 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:03:02,893 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:03:02,894 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:03:02,894 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:03:02,894 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:03:02,894 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:03:02,895 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:03:02,916 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 04:03:02,918 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 04:03:03,034 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 04:03:03,034 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:03:03,054 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 04:03:03,077 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 04:03:03,158 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 04:03:03,159 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:03:03,167 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 04:03:03,188 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 04:03:03,189 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:03:08,213 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 04:03:08,327 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 04:03:08,686 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 04:03:08,800 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 04:03:08,823 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78269 [2019-12-27 04:03:08,823 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 04:03:08,826 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-27 04:03:25,490 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-27 04:03:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-27 04:03:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:03:25,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:03:25,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:03:25,499 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:03:25,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:03:25,506 INFO L82 PathProgramCache]: Analyzing trace with hash 909914, now seen corresponding path program 1 times [2019-12-27 04:03:25,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:03:25,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111210139] [2019-12-27 04:03:25,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:03:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:03:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:03:25,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111210139] [2019-12-27 04:03:25,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:03:25,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:03:25,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374757411] [2019-12-27 04:03:25,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:03:25,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:03:25,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:03:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:03:25,771 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-27 04:03:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:03:29,319 INFO L93 Difference]: Finished difference Result 108680 states and 463562 transitions. [2019-12-27 04:03:29,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:03:29,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:03:29,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:03:30,020 INFO L225 Difference]: With dead ends: 108680 [2019-12-27 04:03:30,021 INFO L226 Difference]: Without dead ends: 102440 [2019-12-27 04:03:30,022 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-27 04:03:34,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102440 states. [2019-12-27 04:03:38,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102440 to 102440. [2019-12-27 04:03:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102440 states. [2019-12-27 04:03:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102440 states to 102440 states and 436366 transitions. [2019-12-27 04:03:42,479 INFO L78 Accepts]: Start accepts. Automaton has 102440 states and 436366 transitions. Word has length 3 [2019-12-27 04:03:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:03:42,480 INFO L462 AbstractCegarLoop]: Abstraction has 102440 states and 436366 transitions. [2019-12-27 04:03:42,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:03:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 102440 states and 436366 transitions. [2019-12-27 04:03:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:03:42,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:03:42,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:03:42,485 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:03:42,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:03:42,485 INFO L82 PathProgramCache]: Analyzing trace with hash -975068220, now seen corresponding path program 1 times [2019-12-27 04:03:42,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:03:42,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716360809] [2019-12-27 04:03:42,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:03:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:03:42,612 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-27 04:03:42,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716360809] [2019-12-27 04:03:42,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:03:42,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:03:42,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587582125] [2019-12-27 04:03:42,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:03:42,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:03:42,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:03:42,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:03:42,615 INFO L87 Difference]: Start difference. First operand 102440 states and 436366 transitions. Second operand 4 states. [2019-12-27 04:03:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:03:43,768 INFO L93 Difference]: Finished difference Result 163248 states and 665679 transitions. [2019-12-27 04:03:43,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:03:43,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 04:03:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:03:49,221 INFO L225 Difference]: With dead ends: 163248 [2019-12-27 04:03:49,222 INFO L226 Difference]: Without dead ends: 163199 [2019-12-27 04:03:49,223 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-27 04:03:53,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163199 states. [2019-12-27 04:03:56,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163199 to 148639. [2019-12-27 04:03:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148639 states. [2019-12-27 04:03:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148639 states to 148639 states and 614105 transitions. [2019-12-27 04:03:57,977 INFO L78 Accepts]: Start accepts. Automaton has 148639 states and 614105 transitions. Word has length 11 [2019-12-27 04:03:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:03:57,977 INFO L462 AbstractCegarLoop]: Abstraction has 148639 states and 614105 transitions. [2019-12-27 04:03:57,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:03:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 148639 states and 614105 transitions. [2019-12-27 04:03:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:03:57,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:03:57,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:03:57,985 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:03:57,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:03:57,985 INFO L82 PathProgramCache]: Analyzing trace with hash -112330344, now seen corresponding path program 1 times [2019-12-27 04:03:57,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:03:57,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549686553] [2019-12-27 04:03:57,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:03:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:03:58,088 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-27 04:03:58,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549686553] [2019-12-27 04:03:58,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:03:58,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:03:58,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494595958] [2019-12-27 04:03:58,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:03:58,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:03:58,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:03:58,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:03:58,090 INFO L87 Difference]: Start difference. First operand 148639 states and 614105 transitions. Second operand 4 states. [2019-12-27 04:03:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:03:58,361 INFO L93 Difference]: Finished difference Result 43706 states and 149507 transitions. [2019-12-27 04:03:58,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:03:58,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 04:03:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:03:58,442 INFO L225 Difference]: With dead ends: 43706 [2019-12-27 04:03:58,442 INFO L226 Difference]: Without dead ends: 33577 [2019-12-27 04:03:58,443 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-27 04:03:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33577 states. [2019-12-27 04:03:59,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33577 to 33481. [2019-12-27 04:03:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33481 states. [2019-12-27 04:03:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33481 states to 33481 states and 108822 transitions. [2019-12-27 04:03:59,111 INFO L78 Accepts]: Start accepts. Automaton has 33481 states and 108822 transitions. Word has length 13 [2019-12-27 04:03:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:03:59,112 INFO L462 AbstractCegarLoop]: Abstraction has 33481 states and 108822 transitions. [2019-12-27 04:03:59,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:03:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 33481 states and 108822 transitions. [2019-12-27 04:03:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 04:03:59,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:03:59,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:03:59,117 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:03:59,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:03:59,117 INFO L82 PathProgramCache]: Analyzing trace with hash -790185689, now seen corresponding path program 1 times [2019-12-27 04:03:59,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:03:59,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741400999] [2019-12-27 04:03:59,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:00,212 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-27 04:04:00,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741400999] [2019-12-27 04:04:00,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:00,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:04:00,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583246199] [2019-12-27 04:04:00,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:04:00,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:00,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:04:00,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:04:00,218 INFO L87 Difference]: Start difference. First operand 33481 states and 108822 transitions. Second operand 5 states. [2019-12-27 04:04:00,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:00,732 INFO L93 Difference]: Finished difference Result 45175 states and 144711 transitions. [2019-12-27 04:04:00,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:04:00,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 04:04:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:00,803 INFO L225 Difference]: With dead ends: 45175 [2019-12-27 04:04:00,804 INFO L226 Difference]: Without dead ends: 45175 [2019-12-27 04:04:00,804 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-27 04:04:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45175 states. [2019-12-27 04:04:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45175 to 38347. [2019-12-27 04:04:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38347 states. [2019-12-27 04:04:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38347 states to 38347 states and 123865 transitions. [2019-12-27 04:04:01,484 INFO L78 Accepts]: Start accepts. Automaton has 38347 states and 123865 transitions. Word has length 16 [2019-12-27 04:04:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:01,484 INFO L462 AbstractCegarLoop]: Abstraction has 38347 states and 123865 transitions. [2019-12-27 04:04:01,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:04:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 38347 states and 123865 transitions. [2019-12-27 04:04:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 04:04:01,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:01,494 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] [2019-12-27 04:04:01,494 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:01,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:01,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2079194331, now seen corresponding path program 1 times [2019-12-27 04:04:01,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:01,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946698684] [2019-12-27 04:04:01,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:01,632 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-27 04:04:01,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946698684] [2019-12-27 04:04:01,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:01,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:04:01,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806324986] [2019-12-27 04:04:01,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:04:01,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:01,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:04:01,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:04:01,635 INFO L87 Difference]: Start difference. First operand 38347 states and 123865 transitions. Second operand 6 states. [2019-12-27 04:04:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:02,992 INFO L93 Difference]: Finished difference Result 58112 states and 182585 transitions. [2019-12-27 04:04:02,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:04:02,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 04:04:02,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:03,088 INFO L225 Difference]: With dead ends: 58112 [2019-12-27 04:04:03,089 INFO L226 Difference]: Without dead ends: 58056 [2019-12-27 04:04:03,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:04:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58056 states. [2019-12-27 04:04:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58056 to 38947. [2019-12-27 04:04:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38947 states. [2019-12-27 04:04:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38947 states to 38947 states and 124912 transitions. [2019-12-27 04:04:03,863 INFO L78 Accepts]: Start accepts. Automaton has 38947 states and 124912 transitions. Word has length 22 [2019-12-27 04:04:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:03,863 INFO L462 AbstractCegarLoop]: Abstraction has 38947 states and 124912 transitions. [2019-12-27 04:04:03,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:04:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 38947 states and 124912 transitions. [2019-12-27 04:04:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:04:03,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:03,878 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-27 04:04:03,878 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:03,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:03,878 INFO L82 PathProgramCache]: Analyzing trace with hash -356343789, now seen corresponding path program 1 times [2019-12-27 04:04:03,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:03,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116690790] [2019-12-27 04:04:03,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:04,007 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-27 04:04:04,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116690790] [2019-12-27 04:04:04,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:04,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:04:04,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860317003] [2019-12-27 04:04:04,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:04:04,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:04,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:04:04,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:04:04,009 INFO L87 Difference]: Start difference. First operand 38947 states and 124912 transitions. Second operand 5 states. [2019-12-27 04:04:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:04,118 INFO L93 Difference]: Finished difference Result 17807 states and 53973 transitions. [2019-12-27 04:04:04,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:04:04,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 04:04:04,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:04,141 INFO L225 Difference]: With dead ends: 17807 [2019-12-27 04:04:04,141 INFO L226 Difference]: Without dead ends: 15537 [2019-12-27 04:04:04,141 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-27 04:04:04,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15537 states. [2019-12-27 04:04:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15537 to 15208. [2019-12-27 04:04:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-27 04:04:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 46078 transitions. [2019-12-27 04:04:04,642 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 46078 transitions. Word has length 25 [2019-12-27 04:04:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:04,642 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 46078 transitions. [2019-12-27 04:04:04,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:04:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 46078 transitions. [2019-12-27 04:04:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:04:04,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:04,653 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] [2019-12-27 04:04:04,653 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:04,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:04,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1041381309, now seen corresponding path program 1 times [2019-12-27 04:04:04,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:04,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777193106] [2019-12-27 04:04:04,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:04,821 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-27 04:04:04,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777193106] [2019-12-27 04:04:04,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:04,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:04:04,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951626271] [2019-12-27 04:04:04,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:04:04,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:04,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:04:04,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:04:04,825 INFO L87 Difference]: Start difference. First operand 15208 states and 46078 transitions. Second operand 7 states. [2019-12-27 04:04:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:05,469 INFO L93 Difference]: Finished difference Result 20223 states and 59927 transitions. [2019-12-27 04:04:05,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:04:05,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-12-27 04:04:05,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:05,497 INFO L225 Difference]: With dead ends: 20223 [2019-12-27 04:04:05,497 INFO L226 Difference]: Without dead ends: 19969 [2019-12-27 04:04:05,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:04:05,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19969 states. [2019-12-27 04:04:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19969 to 17340. [2019-12-27 04:04:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17340 states. [2019-12-27 04:04:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17340 states to 17340 states and 51993 transitions. [2019-12-27 04:04:05,762 INFO L78 Accepts]: Start accepts. Automaton has 17340 states and 51993 transitions. Word has length 27 [2019-12-27 04:04:05,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:05,762 INFO L462 AbstractCegarLoop]: Abstraction has 17340 states and 51993 transitions. [2019-12-27 04:04:05,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:04:05,762 INFO L276 IsEmpty]: Start isEmpty. Operand 17340 states and 51993 transitions. [2019-12-27 04:04:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 04:04:05,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:05,779 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] [2019-12-27 04:04:05,779 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:05,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:05,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1993081713, now seen corresponding path program 1 times [2019-12-27 04:04:05,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:05,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704641847] [2019-12-27 04:04:05,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:05,896 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-27 04:04:05,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704641847] [2019-12-27 04:04:05,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:05,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:04:05,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711445399] [2019-12-27 04:04:05,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:04:05,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:05,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:04:05,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:04:05,899 INFO L87 Difference]: Start difference. First operand 17340 states and 51993 transitions. Second operand 7 states. [2019-12-27 04:04:07,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:07,101 INFO L93 Difference]: Finished difference Result 24233 states and 70715 transitions. [2019-12-27 04:04:07,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:04:07,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 04:04:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:07,134 INFO L225 Difference]: With dead ends: 24233 [2019-12-27 04:04:07,134 INFO L226 Difference]: Without dead ends: 23546 [2019-12-27 04:04:07,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:04:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23546 states. [2019-12-27 04:04:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23546 to 16133. [2019-12-27 04:04:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16133 states. [2019-12-27 04:04:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16133 states to 16133 states and 48316 transitions. [2019-12-27 04:04:07,421 INFO L78 Accepts]: Start accepts. Automaton has 16133 states and 48316 transitions. Word has length 33 [2019-12-27 04:04:07,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:07,422 INFO L462 AbstractCegarLoop]: Abstraction has 16133 states and 48316 transitions. [2019-12-27 04:04:07,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:04:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 16133 states and 48316 transitions. [2019-12-27 04:04:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 04:04:07,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:07,441 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] [2019-12-27 04:04:07,442 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:07,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:07,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2090975987, now seen corresponding path program 1 times [2019-12-27 04:04:07,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:07,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418007602] [2019-12-27 04:04:07,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:07,512 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-27 04:04:07,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418007602] [2019-12-27 04:04:07,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:07,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:04:07,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791592648] [2019-12-27 04:04:07,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:04:07,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:04:07,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:04:07,517 INFO L87 Difference]: Start difference. First operand 16133 states and 48316 transitions. Second operand 3 states. [2019-12-27 04:04:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:07,566 INFO L93 Difference]: Finished difference Result 16132 states and 48314 transitions. [2019-12-27 04:04:07,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:04:07,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 04:04:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:07,588 INFO L225 Difference]: With dead ends: 16132 [2019-12-27 04:04:07,588 INFO L226 Difference]: Without dead ends: 16132 [2019-12-27 04:04:07,588 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-27 04:04:07,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16132 states. [2019-12-27 04:04:07,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16132 to 16132. [2019-12-27 04:04:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16132 states. [2019-12-27 04:04:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16132 states to 16132 states and 48314 transitions. [2019-12-27 04:04:07,919 INFO L78 Accepts]: Start accepts. Automaton has 16132 states and 48314 transitions. Word has length 39 [2019-12-27 04:04:07,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:07,919 INFO L462 AbstractCegarLoop]: Abstraction has 16132 states and 48314 transitions. [2019-12-27 04:04:07,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:04:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 16132 states and 48314 transitions. [2019-12-27 04:04:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 04:04:07,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:07,940 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] [2019-12-27 04:04:07,940 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:07,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:07,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1209723158, now seen corresponding path program 1 times [2019-12-27 04:04:07,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:07,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230695594] [2019-12-27 04:04:07,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:08,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-27 04:04:08,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230695594] [2019-12-27 04:04:08,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:08,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:04:08,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965536832] [2019-12-27 04:04:08,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:04:08,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:08,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:04:08,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:04:08,025 INFO L87 Difference]: Start difference. First operand 16132 states and 48314 transitions. Second operand 5 states. [2019-12-27 04:04:08,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:08,666 INFO L93 Difference]: Finished difference Result 23123 states and 68845 transitions. [2019-12-27 04:04:08,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:04:08,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 04:04:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:08,703 INFO L225 Difference]: With dead ends: 23123 [2019-12-27 04:04:08,704 INFO L226 Difference]: Without dead ends: 23123 [2019-12-27 04:04:08,704 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-27 04:04:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23123 states. [2019-12-27 04:04:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23123 to 21537. [2019-12-27 04:04:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21537 states. [2019-12-27 04:04:09,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21537 states to 21537 states and 64517 transitions. [2019-12-27 04:04:09,024 INFO L78 Accepts]: Start accepts. Automaton has 21537 states and 64517 transitions. Word has length 40 [2019-12-27 04:04:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:09,024 INFO L462 AbstractCegarLoop]: Abstraction has 21537 states and 64517 transitions. [2019-12-27 04:04:09,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:04:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 21537 states and 64517 transitions. [2019-12-27 04:04:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 04:04:09,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:09,051 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] [2019-12-27 04:04:09,052 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:09,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:09,052 INFO L82 PathProgramCache]: Analyzing trace with hash -739159160, now seen corresponding path program 2 times [2019-12-27 04:04:09,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:09,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222091725] [2019-12-27 04:04:09,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:09,120 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-27 04:04:09,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222091725] [2019-12-27 04:04:09,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:09,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:04:09,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451500745] [2019-12-27 04:04:09,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:04:09,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:09,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:04:09,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:04:09,122 INFO L87 Difference]: Start difference. First operand 21537 states and 64517 transitions. Second operand 3 states. [2019-12-27 04:04:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:09,198 INFO L93 Difference]: Finished difference Result 21537 states and 63844 transitions. [2019-12-27 04:04:09,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:04:09,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 04:04:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:09,226 INFO L225 Difference]: With dead ends: 21537 [2019-12-27 04:04:09,226 INFO L226 Difference]: Without dead ends: 21537 [2019-12-27 04:04:09,226 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-27 04:04:09,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21537 states. [2019-12-27 04:04:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21537 to 21421. [2019-12-27 04:04:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21421 states. [2019-12-27 04:04:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21421 states to 21421 states and 63522 transitions. [2019-12-27 04:04:09,524 INFO L78 Accepts]: Start accepts. Automaton has 21421 states and 63522 transitions. Word has length 40 [2019-12-27 04:04:09,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:09,524 INFO L462 AbstractCegarLoop]: Abstraction has 21421 states and 63522 transitions. [2019-12-27 04:04:09,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:04:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 21421 states and 63522 transitions. [2019-12-27 04:04:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:04:09,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:09,548 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] [2019-12-27 04:04:09,548 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:09,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:09,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1835008453, now seen corresponding path program 1 times [2019-12-27 04:04:09,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:09,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721389376] [2019-12-27 04:04:09,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:09,629 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-27 04:04:09,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721389376] [2019-12-27 04:04:09,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:09,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:04:09,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753579302] [2019-12-27 04:04:09,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:04:09,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:09,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:04:09,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:04:09,632 INFO L87 Difference]: Start difference. First operand 21421 states and 63522 transitions. Second operand 3 states. [2019-12-27 04:04:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:09,732 INFO L93 Difference]: Finished difference Result 21346 states and 63289 transitions. [2019-12-27 04:04:09,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:04:09,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 04:04:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:09,768 INFO L225 Difference]: With dead ends: 21346 [2019-12-27 04:04:09,769 INFO L226 Difference]: Without dead ends: 21346 [2019-12-27 04:04:09,769 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-27 04:04:09,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21346 states. [2019-12-27 04:04:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21346 to 17850. [2019-12-27 04:04:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17850 states. [2019-12-27 04:04:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17850 states to 17850 states and 53557 transitions. [2019-12-27 04:04:10,234 INFO L78 Accepts]: Start accepts. Automaton has 17850 states and 53557 transitions. Word has length 41 [2019-12-27 04:04:10,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:10,234 INFO L462 AbstractCegarLoop]: Abstraction has 17850 states and 53557 transitions. [2019-12-27 04:04:10,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:04:10,234 INFO L276 IsEmpty]: Start isEmpty. Operand 17850 states and 53557 transitions. [2019-12-27 04:04:10,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 04:04:10,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:10,256 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] [2019-12-27 04:04:10,257 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:10,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:10,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1386848900, now seen corresponding path program 1 times [2019-12-27 04:04:10,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:10,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040565270] [2019-12-27 04:04:10,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:10,334 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-27 04:04:10,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040565270] [2019-12-27 04:04:10,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:10,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:04:10,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001187988] [2019-12-27 04:04:10,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:04:10,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:10,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:04:10,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:04:10,336 INFO L87 Difference]: Start difference. First operand 17850 states and 53557 transitions. Second operand 6 states. [2019-12-27 04:04:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:10,476 INFO L93 Difference]: Finished difference Result 16802 states and 51226 transitions. [2019-12-27 04:04:10,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:04:10,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 04:04:10,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:10,505 INFO L225 Difference]: With dead ends: 16802 [2019-12-27 04:04:10,505 INFO L226 Difference]: Without dead ends: 16672 [2019-12-27 04:04:10,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:04:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-12-27 04:04:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16672. [2019-12-27 04:04:10,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-27 04:04:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 50949 transitions. [2019-12-27 04:04:10,776 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 50949 transitions. Word has length 42 [2019-12-27 04:04:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:10,776 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 50949 transitions. [2019-12-27 04:04:10,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:04:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 50949 transitions. [2019-12-27 04:04:10,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:04:10,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:10,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:10,799 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:10,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:10,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1128251409, now seen corresponding path program 1 times [2019-12-27 04:04:10,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:10,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273802857] [2019-12-27 04:04:10,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:10,839 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-27 04:04:10,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273802857] [2019-12-27 04:04:10,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:10,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:04:10,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465828651] [2019-12-27 04:04:10,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:04:10,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:10,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:04:10,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:04:10,841 INFO L87 Difference]: Start difference. First operand 16672 states and 50949 transitions. Second operand 3 states. [2019-12-27 04:04:10,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:10,963 INFO L93 Difference]: Finished difference Result 23766 states and 72975 transitions. [2019-12-27 04:04:10,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:04:10,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 04:04:10,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:10,996 INFO L225 Difference]: With dead ends: 23766 [2019-12-27 04:04:10,996 INFO L226 Difference]: Without dead ends: 23766 [2019-12-27 04:04:10,997 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-27 04:04:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23766 states. [2019-12-27 04:04:11,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23766 to 18908. [2019-12-27 04:04:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18908 states. [2019-12-27 04:04:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18908 states to 18908 states and 58542 transitions. [2019-12-27 04:04:11,307 INFO L78 Accepts]: Start accepts. Automaton has 18908 states and 58542 transitions. Word has length 66 [2019-12-27 04:04:11,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:11,307 INFO L462 AbstractCegarLoop]: Abstraction has 18908 states and 58542 transitions. [2019-12-27 04:04:11,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:04:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 18908 states and 58542 transitions. [2019-12-27 04:04:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:04:11,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:11,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:11,327 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:11,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:11,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1486247926, now seen corresponding path program 1 times [2019-12-27 04:04:11,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:11,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125604979] [2019-12-27 04:04:11,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:11,376 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-27 04:04:11,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125604979] [2019-12-27 04:04:11,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:11,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:04:11,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966061210] [2019-12-27 04:04:11,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:04:11,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:11,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:04:11,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:04:11,378 INFO L87 Difference]: Start difference. First operand 18908 states and 58542 transitions. Second operand 3 states. [2019-12-27 04:04:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:11,499 INFO L93 Difference]: Finished difference Result 22628 states and 67954 transitions. [2019-12-27 04:04:11,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:04:11,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 04:04:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:11,538 INFO L225 Difference]: With dead ends: 22628 [2019-12-27 04:04:11,539 INFO L226 Difference]: Without dead ends: 22628 [2019-12-27 04:04:11,539 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-27 04:04:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22628 states. [2019-12-27 04:04:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22628 to 17579. [2019-12-27 04:04:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17579 states. [2019-12-27 04:04:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17579 states to 17579 states and 52993 transitions. [2019-12-27 04:04:12,017 INFO L78 Accepts]: Start accepts. Automaton has 17579 states and 52993 transitions. Word has length 66 [2019-12-27 04:04:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:12,017 INFO L462 AbstractCegarLoop]: Abstraction has 17579 states and 52993 transitions. [2019-12-27 04:04:12,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:04:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 17579 states and 52993 transitions. [2019-12-27 04:04:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:04:12,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:12,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:12,034 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:12,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2105019115, now seen corresponding path program 1 times [2019-12-27 04:04:12,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:12,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491371323] [2019-12-27 04:04:12,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:12,136 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-27 04:04:12,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491371323] [2019-12-27 04:04:12,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:12,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:04:12,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538504956] [2019-12-27 04:04:12,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:04:12,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:12,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:04:12,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:04:12,138 INFO L87 Difference]: Start difference. First operand 17579 states and 52993 transitions. Second operand 7 states. [2019-12-27 04:04:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:12,612 INFO L93 Difference]: Finished difference Result 51897 states and 154354 transitions. [2019-12-27 04:04:12,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:04:12,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 04:04:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:12,663 INFO L225 Difference]: With dead ends: 51897 [2019-12-27 04:04:12,663 INFO L226 Difference]: Without dead ends: 37071 [2019-12-27 04:04:12,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:04:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37071 states. [2019-12-27 04:04:13,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37071 to 21234. [2019-12-27 04:04:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21234 states. [2019-12-27 04:04:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21234 states to 21234 states and 63310 transitions. [2019-12-27 04:04:13,099 INFO L78 Accepts]: Start accepts. Automaton has 21234 states and 63310 transitions. Word has length 66 [2019-12-27 04:04:13,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:13,099 INFO L462 AbstractCegarLoop]: Abstraction has 21234 states and 63310 transitions. [2019-12-27 04:04:13,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:04:13,099 INFO L276 IsEmpty]: Start isEmpty. Operand 21234 states and 63310 transitions. [2019-12-27 04:04:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:04:13,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:13,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:13,123 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:13,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:13,123 INFO L82 PathProgramCache]: Analyzing trace with hash 659069437, now seen corresponding path program 2 times [2019-12-27 04:04:13,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:13,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993953715] [2019-12-27 04:04:13,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:13,186 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-27 04:04:13,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993953715] [2019-12-27 04:04:13,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:13,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:04:13,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171786001] [2019-12-27 04:04:13,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:04:13,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:13,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:04:13,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:04:13,189 INFO L87 Difference]: Start difference. First operand 21234 states and 63310 transitions. Second operand 3 states. [2019-12-27 04:04:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:13,350 INFO L93 Difference]: Finished difference Result 24161 states and 72276 transitions. [2019-12-27 04:04:13,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:04:13,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 04:04:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:13,408 INFO L225 Difference]: With dead ends: 24161 [2019-12-27 04:04:13,408 INFO L226 Difference]: Without dead ends: 24161 [2019-12-27 04:04:13,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:04:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24161 states. [2019-12-27 04:04:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24161 to 19144. [2019-12-27 04:04:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19144 states. [2019-12-27 04:04:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19144 states to 19144 states and 57732 transitions. [2019-12-27 04:04:13,941 INFO L78 Accepts]: Start accepts. Automaton has 19144 states and 57732 transitions. Word has length 66 [2019-12-27 04:04:13,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:13,942 INFO L462 AbstractCegarLoop]: Abstraction has 19144 states and 57732 transitions. [2019-12-27 04:04:13,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:04:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 19144 states and 57732 transitions. [2019-12-27 04:04:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:13,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:13,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:13,980 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:13,981 INFO L82 PathProgramCache]: Analyzing trace with hash -881684233, now seen corresponding path program 1 times [2019-12-27 04:04:13,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:13,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976251049] [2019-12-27 04:04:13,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:14,078 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-27 04:04:14,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976251049] [2019-12-27 04:04:14,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:14,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:04:14,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125773387] [2019-12-27 04:04:14,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:04:14,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:14,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:04:14,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:04:14,080 INFO L87 Difference]: Start difference. First operand 19144 states and 57732 transitions. Second operand 7 states. [2019-12-27 04:04:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:15,215 INFO L93 Difference]: Finished difference Result 29749 states and 87814 transitions. [2019-12-27 04:04:15,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 04:04:15,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 04:04:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:15,252 INFO L225 Difference]: With dead ends: 29749 [2019-12-27 04:04:15,252 INFO L226 Difference]: Without dead ends: 29749 [2019-12-27 04:04:15,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:04:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29749 states. [2019-12-27 04:04:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29749 to 18979. [2019-12-27 04:04:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18979 states. [2019-12-27 04:04:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18979 states to 18979 states and 57282 transitions. [2019-12-27 04:04:15,595 INFO L78 Accepts]: Start accepts. Automaton has 18979 states and 57282 transitions. Word has length 67 [2019-12-27 04:04:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:15,595 INFO L462 AbstractCegarLoop]: Abstraction has 18979 states and 57282 transitions. [2019-12-27 04:04:15,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:04:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 18979 states and 57282 transitions. [2019-12-27 04:04:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:15,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:15,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:15,616 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:15,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:15,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1394509299, now seen corresponding path program 2 times [2019-12-27 04:04:15,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:15,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781557766] [2019-12-27 04:04:15,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:15,703 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-27 04:04:15,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781557766] [2019-12-27 04:04:15,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:15,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:04:15,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459047803] [2019-12-27 04:04:15,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:04:15,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:15,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:04:15,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:04:15,706 INFO L87 Difference]: Start difference. First operand 18979 states and 57282 transitions. Second operand 4 states. [2019-12-27 04:04:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:15,871 INFO L93 Difference]: Finished difference Result 18807 states and 56569 transitions. [2019-12-27 04:04:15,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:04:15,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 04:04:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:15,907 INFO L225 Difference]: With dead ends: 18807 [2019-12-27 04:04:15,907 INFO L226 Difference]: Without dead ends: 18807 [2019-12-27 04:04:15,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:04:15,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18807 states. [2019-12-27 04:04:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18807 to 17052. [2019-12-27 04:04:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17052 states. [2019-12-27 04:04:16,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17052 states to 17052 states and 51361 transitions. [2019-12-27 04:04:16,312 INFO L78 Accepts]: Start accepts. Automaton has 17052 states and 51361 transitions. Word has length 67 [2019-12-27 04:04:16,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:16,312 INFO L462 AbstractCegarLoop]: Abstraction has 17052 states and 51361 transitions. [2019-12-27 04:04:16,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:04:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 17052 states and 51361 transitions. [2019-12-27 04:04:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:16,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:16,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:16,333 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:16,333 INFO L82 PathProgramCache]: Analyzing trace with hash -825405888, now seen corresponding path program 1 times [2019-12-27 04:04:16,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:16,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71801855] [2019-12-27 04:04:16,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:16,857 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-27 04:04:16,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71801855] [2019-12-27 04:04:16,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:16,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 04:04:16,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460112839] [2019-12-27 04:04:16,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 04:04:16,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:16,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 04:04:16,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:04:16,859 INFO L87 Difference]: Start difference. First operand 17052 states and 51361 transitions. Second operand 17 states. [2019-12-27 04:04:19,614 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-12-27 04:04:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:28,305 INFO L93 Difference]: Finished difference Result 43937 states and 128865 transitions. [2019-12-27 04:04:28,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-12-27 04:04:28,308 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 04:04:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:28,344 INFO L225 Difference]: With dead ends: 43937 [2019-12-27 04:04:28,344 INFO L226 Difference]: Without dead ends: 28113 [2019-12-27 04:04:28,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6319 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1708, Invalid=14804, Unknown=0, NotChecked=0, Total=16512 [2019-12-27 04:04:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28113 states. [2019-12-27 04:04:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28113 to 18643. [2019-12-27 04:04:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18643 states. [2019-12-27 04:04:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18643 states to 18643 states and 55326 transitions. [2019-12-27 04:04:28,666 INFO L78 Accepts]: Start accepts. Automaton has 18643 states and 55326 transitions. Word has length 67 [2019-12-27 04:04:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:28,666 INFO L462 AbstractCegarLoop]: Abstraction has 18643 states and 55326 transitions. [2019-12-27 04:04:28,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 04:04:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 18643 states and 55326 transitions. [2019-12-27 04:04:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:28,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:28,686 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:28,686 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:28,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:28,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1102267118, now seen corresponding path program 2 times [2019-12-27 04:04:28,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:28,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53057984] [2019-12-27 04:04:28,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:29,359 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-27 04:04:29,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53057984] [2019-12-27 04:04:29,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:29,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 04:04:29,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670177141] [2019-12-27 04:04:29,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 04:04:29,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:29,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 04:04:29,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:04:29,361 INFO L87 Difference]: Start difference. First operand 18643 states and 55326 transitions. Second operand 17 states. [2019-12-27 04:04:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:34,271 INFO L93 Difference]: Finished difference Result 24982 states and 73136 transitions. [2019-12-27 04:04:34,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 04:04:34,271 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 04:04:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:34,301 INFO L225 Difference]: With dead ends: 24982 [2019-12-27 04:04:34,301 INFO L226 Difference]: Without dead ends: 21773 [2019-12-27 04:04:34,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=507, Invalid=3275, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 04:04:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21773 states. [2019-12-27 04:04:34,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21773 to 19016. [2019-12-27 04:04:34,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19016 states. [2019-12-27 04:04:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19016 states to 19016 states and 56392 transitions. [2019-12-27 04:04:34,721 INFO L78 Accepts]: Start accepts. Automaton has 19016 states and 56392 transitions. Word has length 67 [2019-12-27 04:04:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:34,721 INFO L462 AbstractCegarLoop]: Abstraction has 19016 states and 56392 transitions. [2019-12-27 04:04:34,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 04:04:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 19016 states and 56392 transitions. [2019-12-27 04:04:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:34,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:34,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:34,742 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:34,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:34,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1118376300, now seen corresponding path program 3 times [2019-12-27 04:04:34,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:34,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676743740] [2019-12-27 04:04:34,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:35,025 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-27 04:04:35,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676743740] [2019-12-27 04:04:35,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:35,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:04:35,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716898117] [2019-12-27 04:04:35,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:04:35,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:35,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:04:35,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:04:35,027 INFO L87 Difference]: Start difference. First operand 19016 states and 56392 transitions. Second operand 13 states. [2019-12-27 04:04:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:37,301 INFO L93 Difference]: Finished difference Result 30163 states and 88588 transitions. [2019-12-27 04:04:37,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 04:04:37,302 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 04:04:37,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:37,334 INFO L225 Difference]: With dead ends: 30163 [2019-12-27 04:04:37,334 INFO L226 Difference]: Without dead ends: 23918 [2019-12-27 04:04:37,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2019-12-27 04:04:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23918 states. [2019-12-27 04:04:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23918 to 19152. [2019-12-27 04:04:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19152 states. [2019-12-27 04:04:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19152 states to 19152 states and 56596 transitions. [2019-12-27 04:04:37,639 INFO L78 Accepts]: Start accepts. Automaton has 19152 states and 56596 transitions. Word has length 67 [2019-12-27 04:04:37,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:37,639 INFO L462 AbstractCegarLoop]: Abstraction has 19152 states and 56596 transitions. [2019-12-27 04:04:37,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:04:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 19152 states and 56596 transitions. [2019-12-27 04:04:37,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:37,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:37,660 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:37,661 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:37,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:37,661 INFO L82 PathProgramCache]: Analyzing trace with hash 974434770, now seen corresponding path program 4 times [2019-12-27 04:04:37,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:37,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610046721] [2019-12-27 04:04:37,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:38,320 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-27 04:04:38,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610046721] [2019-12-27 04:04:38,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:38,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 04:04:38,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019175858] [2019-12-27 04:04:38,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 04:04:38,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:38,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 04:04:38,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:04:38,322 INFO L87 Difference]: Start difference. First operand 19152 states and 56596 transitions. Second operand 17 states. [2019-12-27 04:04:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:41,598 INFO L93 Difference]: Finished difference Result 23115 states and 67541 transitions. [2019-12-27 04:04:41,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 04:04:41,599 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 04:04:41,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:41,627 INFO L225 Difference]: With dead ends: 23115 [2019-12-27 04:04:41,627 INFO L226 Difference]: Without dead ends: 21884 [2019-12-27 04:04:41,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=259, Invalid=1463, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 04:04:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21884 states. [2019-12-27 04:04:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21884 to 19399. [2019-12-27 04:04:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19399 states. [2019-12-27 04:04:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19399 states to 19399 states and 57279 transitions. [2019-12-27 04:04:41,918 INFO L78 Accepts]: Start accepts. Automaton has 19399 states and 57279 transitions. Word has length 67 [2019-12-27 04:04:41,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:41,918 INFO L462 AbstractCegarLoop]: Abstraction has 19399 states and 57279 transitions. [2019-12-27 04:04:41,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 04:04:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 19399 states and 57279 transitions. [2019-12-27 04:04:41,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:41,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:41,942 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:41,942 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:41,943 INFO L82 PathProgramCache]: Analyzing trace with hash -17549224, now seen corresponding path program 5 times [2019-12-27 04:04:41,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:41,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062875702] [2019-12-27 04:04:41,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:42,213 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-27 04:04:42,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062875702] [2019-12-27 04:04:42,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:42,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:04:42,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355649933] [2019-12-27 04:04:42,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:04:42,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:42,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:04:42,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:04:42,217 INFO L87 Difference]: Start difference. First operand 19399 states and 57279 transitions. Second operand 13 states. [2019-12-27 04:04:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:44,213 INFO L93 Difference]: Finished difference Result 27429 states and 80212 transitions. [2019-12-27 04:04:44,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 04:04:44,213 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 04:04:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:44,244 INFO L225 Difference]: With dead ends: 27429 [2019-12-27 04:04:44,245 INFO L226 Difference]: Without dead ends: 23492 [2019-12-27 04:04:44,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2019-12-27 04:04:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23492 states. [2019-12-27 04:04:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23492 to 18882. [2019-12-27 04:04:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18882 states. [2019-12-27 04:04:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18882 states to 18882 states and 55863 transitions. [2019-12-27 04:04:44,544 INFO L78 Accepts]: Start accepts. Automaton has 18882 states and 55863 transitions. Word has length 67 [2019-12-27 04:04:44,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:44,544 INFO L462 AbstractCegarLoop]: Abstraction has 18882 states and 55863 transitions. [2019-12-27 04:04:44,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:04:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 18882 states and 55863 transitions. [2019-12-27 04:04:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:44,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:44,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:44,564 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:44,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:44,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1856599730, now seen corresponding path program 6 times [2019-12-27 04:04:44,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:44,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698906055] [2019-12-27 04:04:44,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:45,049 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-27 04:04:45,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698906055] [2019-12-27 04:04:45,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:45,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:04:45,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124443343] [2019-12-27 04:04:45,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:04:45,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:45,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:04:45,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:04:45,051 INFO L87 Difference]: Start difference. First operand 18882 states and 55863 transitions. Second operand 10 states. [2019-12-27 04:04:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:46,159 INFO L93 Difference]: Finished difference Result 36694 states and 108099 transitions. [2019-12-27 04:04:46,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 04:04:46,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 04:04:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:46,206 INFO L225 Difference]: With dead ends: 36694 [2019-12-27 04:04:46,206 INFO L226 Difference]: Without dead ends: 34779 [2019-12-27 04:04:46,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-27 04:04:46,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34779 states. [2019-12-27 04:04:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34779 to 21154. [2019-12-27 04:04:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21154 states. [2019-12-27 04:04:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21154 states to 21154 states and 62233 transitions. [2019-12-27 04:04:46,608 INFO L78 Accepts]: Start accepts. Automaton has 21154 states and 62233 transitions. Word has length 67 [2019-12-27 04:04:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:46,608 INFO L462 AbstractCegarLoop]: Abstraction has 21154 states and 62233 transitions. [2019-12-27 04:04:46,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:04:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 21154 states and 62233 transitions. [2019-12-27 04:04:46,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:46,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:46,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:46,631 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:46,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:46,631 INFO L82 PathProgramCache]: Analyzing trace with hash -741329620, now seen corresponding path program 7 times [2019-12-27 04:04:46,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:46,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712014198] [2019-12-27 04:04:46,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:46,905 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-27 04:04:46,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712014198] [2019-12-27 04:04:46,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:46,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:04:46,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127251321] [2019-12-27 04:04:46,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:04:46,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:46,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:04:46,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:04:46,907 INFO L87 Difference]: Start difference. First operand 21154 states and 62233 transitions. Second operand 10 states. [2019-12-27 04:04:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:47,833 INFO L93 Difference]: Finished difference Result 35289 states and 103311 transitions. [2019-12-27 04:04:47,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 04:04:47,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 04:04:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:47,872 INFO L225 Difference]: With dead ends: 35289 [2019-12-27 04:04:47,872 INFO L226 Difference]: Without dead ends: 30054 [2019-12-27 04:04:47,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 04:04:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30054 states. [2019-12-27 04:04:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30054 to 17751. [2019-12-27 04:04:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17751 states. [2019-12-27 04:04:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17751 states to 17751 states and 52684 transitions. [2019-12-27 04:04:48,210 INFO L78 Accepts]: Start accepts. Automaton has 17751 states and 52684 transitions. Word has length 67 [2019-12-27 04:04:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:48,210 INFO L462 AbstractCegarLoop]: Abstraction has 17751 states and 52684 transitions. [2019-12-27 04:04:48,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:04:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 17751 states and 52684 transitions. [2019-12-27 04:04:48,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:48,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:48,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:48,227 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:48,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:48,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1080421452, now seen corresponding path program 8 times [2019-12-27 04:04:48,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:48,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006159147] [2019-12-27 04:04:48,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:04:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:04:48,345 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:04:48,346 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:04:48,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= v_~y$read_delayed~0_7 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2405~0.base_39| 1)) (= v_~y$r_buff1_thd0~0_201 0) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2405~0.base_39| 4)) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (= (select .cse0 |v_ULTIMATE.start_main_~#t2405~0.base_39|) 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2405~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2405~0.base_39|) |v_ULTIMATE.start_main_~#t2405~0.offset_26| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 |v_ULTIMATE.start_main_~#t2405~0.offset_26|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2405~0.base_39|) (= 0 v_~x~0_158) (= 0 v_~y$r_buff1_thd2~0_197) (= v_~y~0_189 0) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_~#t2406~0.base=|v_ULTIMATE.start_main_~#t2406~0.base_37|, ULTIMATE.start_main_~#t2406~0.offset=|v_ULTIMATE.start_main_~#t2406~0.offset_25|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2407~0.offset=|v_ULTIMATE.start_main_~#t2407~0.offset_20|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~y~0=v_~y~0_189, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t2405~0.base=|v_ULTIMATE.start_main_~#t2405~0.base_39|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t2407~0.base=|v_ULTIMATE.start_main_~#t2407~0.base_27|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ULTIMATE.start_main_~#t2405~0.offset=|v_ULTIMATE.start_main_~#t2405~0.offset_26|, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2406~0.base, ULTIMATE.start_main_~#t2406~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_~#t2407~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t2405~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2407~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t2405~0.offset, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 04:04:48,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_15 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|) (= 0 (mod v_~y$w_buff1_used~0_76 256))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_15, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} 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-27 04:04:48,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2406~0.base_11|) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2406~0.base_11| 1) |v_#valid_39|) (not (= |v_ULTIMATE.start_main_~#t2406~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2406~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2406~0.base_11|) |v_ULTIMATE.start_main_~#t2406~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t2406~0.offset_10| 0) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2406~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2406~0.base_11| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2406~0.base=|v_ULTIMATE.start_main_~#t2406~0.base_11|, ULTIMATE.start_main_~#t2406~0.offset=|v_ULTIMATE.start_main_~#t2406~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2406~0.base, ULTIMATE.start_main_~#t2406~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 04:04:48,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2407~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2407~0.base_11|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2407~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2407~0.base_11|) |v_ULTIMATE.start_main_~#t2407~0.offset_10| 2))) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2407~0.base_11|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2407~0.base_11| 4) |v_#length_15|) (= |v_ULTIMATE.start_main_~#t2407~0.offset_10| 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2407~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2407~0.offset=|v_ULTIMATE.start_main_~#t2407~0.offset_10|, ULTIMATE.start_main_~#t2407~0.base=|v_ULTIMATE.start_main_~#t2407~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2407~0.offset, ULTIMATE.start_main_~#t2407~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 04:04:48,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In209018167 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In209018167 256)))) (or (and (= 0 (mod ~y$r_buff1_thd3~0_In209018167 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In209018167 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In209018167 256))))) (= |P2Thread1of1ForFork2_#t~ite23_Out209018167| ~y$w_buff1~0_In209018167) (= |P2Thread1of1ForFork2_#t~ite24_Out209018167| |P2Thread1of1ForFork2_#t~ite23_Out209018167|)) (and (= |P2Thread1of1ForFork2_#t~ite24_Out209018167| ~y$w_buff1~0_In209018167) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In209018167| |P2Thread1of1ForFork2_#t~ite23_Out209018167|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In209018167|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In209018167, ~y$w_buff1~0=~y$w_buff1~0_In209018167, ~y$w_buff0_used~0=~y$w_buff0_used~0_In209018167, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In209018167, ~weak$$choice2~0=~weak$$choice2~0_In209018167, ~y$w_buff1_used~0=~y$w_buff1_used~0_In209018167} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out209018167|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out209018167|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In209018167, ~y$w_buff1~0=~y$w_buff1~0_In209018167, ~y$w_buff0_used~0=~y$w_buff0_used~0_In209018167, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In209018167, ~weak$$choice2~0=~weak$$choice2~0_In209018167, ~y$w_buff1_used~0=~y$w_buff1_used~0_In209018167} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 04:04:48,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-163165011 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_In-163165011| |P2Thread1of1ForFork2_#t~ite26_Out-163165011|) (= ~y$w_buff0_used~0_In-163165011 |P2Thread1of1ForFork2_#t~ite27_Out-163165011|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite26_Out-163165011| ~y$w_buff0_used~0_In-163165011) (= |P2Thread1of1ForFork2_#t~ite26_Out-163165011| |P2Thread1of1ForFork2_#t~ite27_Out-163165011|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-163165011 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-163165011 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-163165011 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In-163165011 256) 0))))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-163165011, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-163165011|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-163165011, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-163165011, ~weak$$choice2~0=~weak$$choice2~0_In-163165011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-163165011} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-163165011|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-163165011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-163165011, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-163165011, ~weak$$choice2~0=~weak$$choice2~0_In-163165011, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-163165011|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-163165011} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 04:04:48,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2133861002 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_In-2133861002| |P2Thread1of1ForFork2_#t~ite29_Out-2133861002|) (= |P2Thread1of1ForFork2_#t~ite30_Out-2133861002| ~y$w_buff1_used~0_In-2133861002) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out-2133861002| ~y$w_buff1_used~0_In-2133861002) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2133861002 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-2133861002 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-2133861002 256))) (= (mod ~y$w_buff0_used~0_In-2133861002 256) 0))) (= |P2Thread1of1ForFork2_#t~ite29_Out-2133861002| |P2Thread1of1ForFork2_#t~ite30_Out-2133861002|) .cse0))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2133861002, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2133861002, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2133861002, ~weak$$choice2~0=~weak$$choice2~0_In-2133861002, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-2133861002|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2133861002} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2133861002, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2133861002, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-2133861002|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2133861002, ~weak$$choice2~0=~weak$$choice2~0_In-2133861002, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-2133861002|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2133861002} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 04:04:48,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_10|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 04:04:48,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 04:04:48,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1999424992 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1999424992 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1999424992 |P2Thread1of1ForFork2_#t~ite38_Out-1999424992|) (not .cse1)) (and (= ~y~0_In-1999424992 |P2Thread1of1ForFork2_#t~ite38_Out-1999424992|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1999424992, ~y$w_buff1~0=~y$w_buff1~0_In-1999424992, ~y~0=~y~0_In-1999424992, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1999424992} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1999424992, ~y$w_buff1~0=~y$w_buff1~0_In-1999424992, ~y~0=~y~0_In-1999424992, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1999424992|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1999424992} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 04:04:48,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In157370137 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In157370137 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In157370137 |P0Thread1of1ForFork0_#t~ite5_Out157370137|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out157370137|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In157370137, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In157370137} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out157370137|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In157370137, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In157370137} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 04:04:48,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In163726515 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In163726515 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In163726515 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In163726515 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out163726515| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out163726515| ~y$w_buff1_used~0_In163726515) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In163726515, ~y$w_buff0_used~0=~y$w_buff0_used~0_In163726515, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In163726515, ~y$w_buff1_used~0=~y$w_buff1_used~0_In163726515} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out163726515|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In163726515, ~y$w_buff0_used~0=~y$w_buff0_used~0_In163726515, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In163726515, ~y$w_buff1_used~0=~y$w_buff1_used~0_In163726515} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 04:04:48,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1365800527 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite10_Out1365800527| |P1Thread1of1ForFork1_#t~ite9_Out1365800527|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1365800527 256)))) (or (and (= ~y~0_In1365800527 |P1Thread1of1ForFork1_#t~ite9_Out1365800527|) .cse0 (or .cse1 .cse2)) (and (not .cse2) .cse0 (= ~y$w_buff1~0_In1365800527 |P1Thread1of1ForFork1_#t~ite9_Out1365800527|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1365800527, ~y$w_buff1~0=~y$w_buff1~0_In1365800527, ~y~0=~y~0_In1365800527, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1365800527} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1365800527, ~y$w_buff1~0=~y$w_buff1~0_In1365800527, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1365800527|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1365800527|, ~y~0=~y~0_In1365800527, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1365800527} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 04:04:48,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_12|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_12|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_7|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_11|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 04:04:48,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2070063156 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2070063156 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out-2070063156| ~y$w_buff0_used~0_In-2070063156)) (and (= |P2Thread1of1ForFork2_#t~ite40_Out-2070063156| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2070063156, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2070063156} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2070063156, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2070063156, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-2070063156|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 04:04:48,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-1816884098 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1816884098 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1816884098 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-1816884098 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out-1816884098| ~y$w_buff1_used~0_In-1816884098) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-1816884098|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1816884098, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1816884098, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1816884098, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1816884098} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1816884098, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1816884098, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1816884098|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1816884098, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1816884098} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 04:04:48,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-151376607 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-151376607 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-151376607|) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out-151376607| ~y$r_buff0_thd3~0_In-151376607) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-151376607, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-151376607} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-151376607, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-151376607|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-151376607} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 04:04:48,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In2121631340 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In2121631340 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In2121631340 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2121631340 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out2121631340|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In2121631340 |P2Thread1of1ForFork2_#t~ite43_Out2121631340|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2121631340, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2121631340, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2121631340, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121631340} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2121631340, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2121631340, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2121631340, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out2121631340|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121631340} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 04:04:48,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1687231959 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1687231959 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out1687231959) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1687231959 ~y$r_buff0_thd1~0_Out1687231959)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1687231959, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1687231959} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1687231959, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1687231959|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1687231959} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 04:04:48,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1602454818 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1602454818 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1602454818 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1602454818 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1602454818| ~y$r_buff1_thd1~0_In1602454818) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1602454818| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1602454818, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1602454818, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1602454818, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1602454818} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1602454818, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1602454818, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1602454818|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1602454818, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1602454818} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 04:04:48,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} 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-27 04:04:48,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_34| v_~y$r_buff1_thd3~0_152) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_33|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 04:04:48,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1989106534 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1989106534 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1989106534| ~y$w_buff0_used~0_In-1989106534) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1989106534| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1989106534, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1989106534} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1989106534, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1989106534, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1989106534|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 04:04:48,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2115090384 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-2115090384 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-2115090384 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2115090384 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-2115090384|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-2115090384 |P1Thread1of1ForFork1_#t~ite12_Out-2115090384|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2115090384, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2115090384, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2115090384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2115090384} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2115090384, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2115090384, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2115090384, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-2115090384|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2115090384} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 04:04:48,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1642434580 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1642434580 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1642434580|) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In1642434580 |P1Thread1of1ForFork1_#t~ite13_Out1642434580|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1642434580, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1642434580} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1642434580, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1642434580, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1642434580|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 04:04:48,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In-369265340 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-369265340 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-369265340 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-369265340 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-369265340|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In-369265340 |P1Thread1of1ForFork1_#t~ite14_Out-369265340|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-369265340, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-369265340, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-369265340, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-369265340} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-369265340, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-369265340, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-369265340, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-369265340|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-369265340} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 04:04:48,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, 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-27 04:04:48,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 04:04:48,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1038415401 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1038415401 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1038415401| ~y~0_In-1038415401) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out-1038415401| ~y$w_buff1~0_In-1038415401) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1038415401, ~y~0=~y~0_In-1038415401, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1038415401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1038415401} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1038415401, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1038415401|, ~y~0=~y~0_In-1038415401, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1038415401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1038415401} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 04:04:48,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-27 04:04:48,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1606246009 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1606246009 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out1606246009| ~y$w_buff0_used~0_In1606246009) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out1606246009| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1606246009, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1606246009} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1606246009, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1606246009, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1606246009|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 04:04:48,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-2068831924 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-2068831924 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-2068831924 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2068831924 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-2068831924|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-2068831924 |ULTIMATE.start_main_#t~ite50_Out-2068831924|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2068831924, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2068831924, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2068831924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2068831924} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2068831924|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2068831924, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2068831924, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2068831924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2068831924} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 04:04:48,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In473817066 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In473817066 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out473817066|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out473817066| ~y$r_buff0_thd0~0_In473817066) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In473817066, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In473817066} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out473817066|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In473817066, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In473817066} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 04:04:48,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1160347643 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1160347643 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1160347643 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1160347643 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1160347643| ~y$r_buff1_thd0~0_In-1160347643) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1160347643| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1160347643, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1160347643, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1160347643, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1160347643} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1160347643|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1160347643, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1160347643, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1160347643, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1160347643} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 04:04:48,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= 2 v_~x~0_130) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 04:04:48,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:04:48 BasicIcfg [2019-12-27 04:04:48,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:04:48,465 INFO L168 Benchmark]: Toolchain (without parser) took 107628.58 ms. Allocated memory was 145.8 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 102.0 MB in the beginning and 562.2 MB in the end (delta: -460.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 04:04:48,466 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 04:04:48,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.83 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 154.9 MB in the end (delta: -53.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 04:04:48,467 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.93 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 04:04:48,467 INFO L168 Benchmark]: Boogie Preprocessor took 64.87 ms. Allocated memory is still 203.4 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 04:04:48,467 INFO L168 Benchmark]: RCFGBuilder took 921.09 ms. Allocated memory is still 203.4 MB. Free memory was 150.1 MB in the beginning and 99.9 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-27 04:04:48,468 INFO L168 Benchmark]: TraceAbstraction took 105787.85 ms. Allocated memory was 203.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.2 MB in the beginning and 562.2 MB in the end (delta: -462.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 04:04:48,473 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.51 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.83 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 154.9 MB in the end (delta: -53.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.93 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.87 ms. Allocated memory is still 203.4 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 921.09 ms. Allocated memory is still 203.4 MB. Free memory was 150.1 MB in the beginning and 99.9 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105787.85 ms. Allocated memory was 203.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.2 MB in the beginning and 562.2 MB in the end (delta: -462.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 252 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 241 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78269 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L815] FCALL, FORK 0 pthread_create(&t2405, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L736] 1 y$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2406, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$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_p2_EAX=0, __unbuffered_p2_EBX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2407, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 3 __unbuffered_p2_EAX = x [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 y$flush_delayed = weak$$choice2 [L779] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 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 [L759] EXPR 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=0] [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 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 [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 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 [L828] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 105.4s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 45.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6073 SDtfs, 7810 SDslu, 24103 SDs, 0 SdLazy, 22959 SolverSat, 427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 487 GetRequests, 33 SyntacticMatches, 28 SemanticMatches, 426 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8138 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148639occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 149464 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1286 NumberOfCodeBlocks, 1286 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1193 ConstructedInterpolants, 0 QuantifiedInterpolants, 373286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...