/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:22:36,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:22:36,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:22:36,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:22:36,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:22:36,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:22:36,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:22:36,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:22:36,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:22:36,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:22:36,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:22:36,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:22:36,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:22:36,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:22:36,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:22:36,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:22:36,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:22:36,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:22:36,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:22:36,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:22:36,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:22:36,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:22:36,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:22:36,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:22:36,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:22:36,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:22:36,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:22:36,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:22:36,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:22:36,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:22:36,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:22:36,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:22:36,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:22:36,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:22:36,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:22:36,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:22:36,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:22:36,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:22:36,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:22:36,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:22:36,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:22:36,562 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-VariableLbe.epf [2019-12-27 05:22:36,597 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:22:36,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:22:36,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:22:36,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:22:36,602 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:22:36,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:22:36,603 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:22:36,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:22:36,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:22:36,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:22:36,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:22:36,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:22:36,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:22:36,604 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:22:36,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:22:36,604 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:22:36,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:22:36,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:22:36,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:22:36,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:22:36,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:22:36,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:22:36,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:22:36,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:22:36,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:22:36,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:22:36,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:22:36,608 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:22:36,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:22:36,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:22:36,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:22:36,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:22:36,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:22:36,927 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:22:36,928 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:22:36,929 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_rmo.oepc.i [2019-12-27 05:22:37,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cd312b4/6d1a1202c0084c11bfbe884ea9d75131/FLAGbf9c8712e [2019-12-27 05:22:37,585 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:22:37,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_rmo.oepc.i [2019-12-27 05:22:37,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cd312b4/6d1a1202c0084c11bfbe884ea9d75131/FLAGbf9c8712e [2019-12-27 05:22:37,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cd312b4/6d1a1202c0084c11bfbe884ea9d75131 [2019-12-27 05:22:37,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:22:37,833 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:22:37,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:22:37,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:22:37,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:22:37,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:22:37" (1/1) ... [2019-12-27 05:22:37,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:22:37, skipping insertion in model container [2019-12-27 05:22:37,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:22:37" (1/1) ... [2019-12-27 05:22:37,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:22:37,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:22:38,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:22:38,431 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:22:38,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:22:38,603 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:22:38,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:22:38 WrapperNode [2019-12-27 05:22:38,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:22:38,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:22:38,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:22:38,604 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:22:38,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:22:38" (1/1) ... [2019-12-27 05:22:38,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:22:38" (1/1) ... [2019-12-27 05:22:38,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:22:38,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:22:38,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:22:38,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:22:38,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:22:38" (1/1) ... [2019-12-27 05:22:38,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:22:38" (1/1) ... [2019-12-27 05:22:38,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:22:38" (1/1) ... [2019-12-27 05:22:38,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:22:38" (1/1) ... [2019-12-27 05:22:38,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:22:38" (1/1) ... [2019-12-27 05:22:38,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:22:38" (1/1) ... [2019-12-27 05:22:38,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:22:38" (1/1) ... [2019-12-27 05:22:38,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:22:38,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:22:38,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:22:38,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:22:38,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:22:38" (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 05:22:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:22:38,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:22:38,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:22:38,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:22:38,784 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:22:38,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:22:38,785 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:22:38,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:22:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:22:38,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:22:38,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:22:38,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:22:38,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:22:38,790 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 05:22:39,686 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:22:39,687 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:22:39,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:22:39 BoogieIcfgContainer [2019-12-27 05:22:39,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:22:39,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:22:39,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:22:39,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:22:39,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:22:37" (1/3) ... [2019-12-27 05:22:39,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7954aa50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:22:39, skipping insertion in model container [2019-12-27 05:22:39,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:22:38" (2/3) ... [2019-12-27 05:22:39,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7954aa50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:22:39, skipping insertion in model container [2019-12-27 05:22:39,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:22:39" (3/3) ... [2019-12-27 05:22:39,697 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_rmo.oepc.i [2019-12-27 05:22:39,707 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:22:39,707 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:22:39,715 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:22:39,716 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:22:39,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,780 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,780 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,780 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,781 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,782 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,788 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,788 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,795 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,796 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,824 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,826 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,850 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,850 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,850 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,853 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,853 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:22:39,882 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:22:39,903 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:22:39,903 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:22:39,903 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:22:39,903 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:22:39,903 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:22:39,903 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:22:39,903 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:22:39,904 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:22:39,929 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 05:22:39,930 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 05:22:40,057 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 05:22:40,058 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:22:40,079 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:22:40,100 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 05:22:40,156 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 05:22:40,156 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:22:40,165 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:22:40,193 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:22:40,195 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:22:43,764 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 05:22:43,886 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 05:22:44,168 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 05:22:44,310 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 05:22:44,344 INFO L206 etLargeBlockEncoding]: Checked pairs total: 94688 [2019-12-27 05:22:44,344 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 05:22:44,348 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 106 transitions [2019-12-27 05:23:09,744 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 134882 states. [2019-12-27 05:23:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 134882 states. [2019-12-27 05:23:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:23:09,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:09,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:23:09,754 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 05:23:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:09,762 INFO L82 PathProgramCache]: Analyzing trace with hash 915989, now seen corresponding path program 1 times [2019-12-27 05:23:09,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:09,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629868235] [2019-12-27 05:23:09,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:10,059 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 05:23:10,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629868235] [2019-12-27 05:23:10,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:10,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:23:10,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901640022] [2019-12-27 05:23:10,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:10,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:10,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:10,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:10,085 INFO L87 Difference]: Start difference. First operand 134882 states. Second operand 3 states. [2019-12-27 05:23:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:11,666 INFO L93 Difference]: Finished difference Result 125324 states and 534602 transitions. [2019-12-27 05:23:11,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:11,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:23:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:15,836 INFO L225 Difference]: With dead ends: 125324 [2019-12-27 05:23:15,840 INFO L226 Difference]: Without dead ends: 118044 [2019-12-27 05:23:15,841 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 05:23:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118044 states. [2019-12-27 05:23:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118044 to 118044. [2019-12-27 05:23:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118044 states. [2019-12-27 05:23:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118044 states to 118044 states and 502920 transitions. [2019-12-27 05:23:24,437 INFO L78 Accepts]: Start accepts. Automaton has 118044 states and 502920 transitions. Word has length 3 [2019-12-27 05:23:24,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:24,438 INFO L462 AbstractCegarLoop]: Abstraction has 118044 states and 502920 transitions. [2019-12-27 05:23:24,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 118044 states and 502920 transitions. [2019-12-27 05:23:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:23:24,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:24,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:23:24,442 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 05:23:24,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:24,443 INFO L82 PathProgramCache]: Analyzing trace with hash -31291973, now seen corresponding path program 1 times [2019-12-27 05:23:24,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:24,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120204175] [2019-12-27 05:23:24,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:24,546 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 05:23:24,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120204175] [2019-12-27 05:23:24,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:24,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:23:24,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424430298] [2019-12-27 05:23:24,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:23:24,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:24,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:23:24,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:23:24,551 INFO L87 Difference]: Start difference. First operand 118044 states and 502920 transitions. Second operand 4 states. [2019-12-27 05:23:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:29,475 INFO L93 Difference]: Finished difference Result 183348 states and 749807 transitions. [2019-12-27 05:23:29,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:23:29,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:23:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:30,247 INFO L225 Difference]: With dead ends: 183348 [2019-12-27 05:23:30,247 INFO L226 Difference]: Without dead ends: 183299 [2019-12-27 05:23:30,249 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 05:23:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183299 states. [2019-12-27 05:23:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183299 to 167419. [2019-12-27 05:23:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167419 states. [2019-12-27 05:23:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167419 states to 167419 states and 693327 transitions. [2019-12-27 05:23:46,484 INFO L78 Accepts]: Start accepts. Automaton has 167419 states and 693327 transitions. Word has length 11 [2019-12-27 05:23:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:46,484 INFO L462 AbstractCegarLoop]: Abstraction has 167419 states and 693327 transitions. [2019-12-27 05:23:46,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:23:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 167419 states and 693327 transitions. [2019-12-27 05:23:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:23:46,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:46,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:23:46,496 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 05:23:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:46,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2078499822, now seen corresponding path program 1 times [2019-12-27 05:23:46,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:46,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364864340] [2019-12-27 05:23:46,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:46,553 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 05:23:46,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364864340] [2019-12-27 05:23:46,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:46,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:23:46,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620804769] [2019-12-27 05:23:46,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:46,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:46,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:46,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:46,555 INFO L87 Difference]: Start difference. First operand 167419 states and 693327 transitions. Second operand 3 states. [2019-12-27 05:23:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:46,685 INFO L93 Difference]: Finished difference Result 35457 states and 115033 transitions. [2019-12-27 05:23:46,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:46,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:23:46,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:46,792 INFO L225 Difference]: With dead ends: 35457 [2019-12-27 05:23:46,792 INFO L226 Difference]: Without dead ends: 35457 [2019-12-27 05:23:46,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 05:23:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35457 states. [2019-12-27 05:23:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35457 to 35457. [2019-12-27 05:23:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35457 states. [2019-12-27 05:23:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35457 states to 35457 states and 115033 transitions. [2019-12-27 05:23:47,446 INFO L78 Accepts]: Start accepts. Automaton has 35457 states and 115033 transitions. Word has length 13 [2019-12-27 05:23:47,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:47,447 INFO L462 AbstractCegarLoop]: Abstraction has 35457 states and 115033 transitions. [2019-12-27 05:23:47,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 35457 states and 115033 transitions. [2019-12-27 05:23:47,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:23:47,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:47,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:23:47,450 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 05:23:47,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:47,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1087155049, now seen corresponding path program 1 times [2019-12-27 05:23:47,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:47,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124545002] [2019-12-27 05:23:47,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:47,531 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 05:23:47,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124545002] [2019-12-27 05:23:47,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:47,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:23:47,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203035387] [2019-12-27 05:23:47,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:23:47,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:47,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:23:47,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:23:47,533 INFO L87 Difference]: Start difference. First operand 35457 states and 115033 transitions. Second operand 5 states. [2019-12-27 05:23:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:50,494 INFO L93 Difference]: Finished difference Result 48336 states and 154905 transitions. [2019-12-27 05:23:50,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:23:50,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 05:23:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:50,628 INFO L225 Difference]: With dead ends: 48336 [2019-12-27 05:23:50,628 INFO L226 Difference]: Without dead ends: 48336 [2019-12-27 05:23:50,629 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 05:23:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-27 05:23:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 40811. [2019-12-27 05:23:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40811 states. [2019-12-27 05:23:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40811 states to 40811 states and 131928 transitions. [2019-12-27 05:23:51,424 INFO L78 Accepts]: Start accepts. Automaton has 40811 states and 131928 transitions. Word has length 16 [2019-12-27 05:23:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:51,426 INFO L462 AbstractCegarLoop]: Abstraction has 40811 states and 131928 transitions. [2019-12-27 05:23:51,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:23:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 40811 states and 131928 transitions. [2019-12-27 05:23:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:23:51,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:51,436 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 05:23:51,436 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 05:23:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:51,436 INFO L82 PathProgramCache]: Analyzing trace with hash 331077478, now seen corresponding path program 1 times [2019-12-27 05:23:51,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:51,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618741660] [2019-12-27 05:23:51,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:51,533 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 05:23:51,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618741660] [2019-12-27 05:23:51,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:51,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:23:51,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171958406] [2019-12-27 05:23:51,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:23:51,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:51,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:23:51,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:23:51,535 INFO L87 Difference]: Start difference. First operand 40811 states and 131928 transitions. Second operand 6 states. [2019-12-27 05:23:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:52,449 INFO L93 Difference]: Finished difference Result 60696 states and 191428 transitions. [2019-12-27 05:23:52,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:23:52,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 05:23:52,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:52,567 INFO L225 Difference]: With dead ends: 60696 [2019-12-27 05:23:52,567 INFO L226 Difference]: Without dead ends: 60689 [2019-12-27 05:23:52,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:23:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60689 states. [2019-12-27 05:23:53,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60689 to 41267. [2019-12-27 05:23:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41267 states. [2019-12-27 05:23:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41267 states to 41267 states and 132739 transitions. [2019-12-27 05:23:53,899 INFO L78 Accepts]: Start accepts. Automaton has 41267 states and 132739 transitions. Word has length 22 [2019-12-27 05:23:53,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:53,900 INFO L462 AbstractCegarLoop]: Abstraction has 41267 states and 132739 transitions. [2019-12-27 05:23:53,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:23:53,900 INFO L276 IsEmpty]: Start isEmpty. Operand 41267 states and 132739 transitions. [2019-12-27 05:23:53,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:23:53,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:53,914 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 05:23:53,915 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 05:23:53,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:53,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1815979917, now seen corresponding path program 1 times [2019-12-27 05:23:53,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:53,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045401451] [2019-12-27 05:23:53,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:53,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045401451] [2019-12-27 05:23:53,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:53,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:23:53,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120093939] [2019-12-27 05:23:53,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:23:53,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:53,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:23:53,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:23:53,984 INFO L87 Difference]: Start difference. First operand 41267 states and 132739 transitions. Second operand 4 states. [2019-12-27 05:23:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:54,057 INFO L93 Difference]: Finished difference Result 16400 states and 49837 transitions. [2019-12-27 05:23:54,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:23:54,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:23:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:54,083 INFO L225 Difference]: With dead ends: 16400 [2019-12-27 05:23:54,083 INFO L226 Difference]: Without dead ends: 16400 [2019-12-27 05:23:54,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:23:54,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16400 states. [2019-12-27 05:23:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16400 to 16107. [2019-12-27 05:23:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16107 states. [2019-12-27 05:23:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16107 states to 16107 states and 49001 transitions. [2019-12-27 05:23:54,368 INFO L78 Accepts]: Start accepts. Automaton has 16107 states and 49001 transitions. Word has length 25 [2019-12-27 05:23:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:54,369 INFO L462 AbstractCegarLoop]: Abstraction has 16107 states and 49001 transitions. [2019-12-27 05:23:54,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:23:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 16107 states and 49001 transitions. [2019-12-27 05:23:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:23:54,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:54,383 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 05:23:54,383 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 05:23:54,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:54,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1743661769, now seen corresponding path program 1 times [2019-12-27 05:23:54,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:54,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375324622] [2019-12-27 05:23:54,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:54,504 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 05:23:54,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375324622] [2019-12-27 05:23:54,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:54,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:23:54,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734318268] [2019-12-27 05:23:54,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:23:54,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:54,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:23:54,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:23:54,506 INFO L87 Difference]: Start difference. First operand 16107 states and 49001 transitions. Second operand 6 states. [2019-12-27 05:23:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:55,040 INFO L93 Difference]: Finished difference Result 23083 states and 68424 transitions. [2019-12-27 05:23:55,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:23:55,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 05:23:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:55,082 INFO L225 Difference]: With dead ends: 23083 [2019-12-27 05:23:55,082 INFO L226 Difference]: Without dead ends: 23083 [2019-12-27 05:23:55,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:23:55,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23083 states. [2019-12-27 05:23:55,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23083 to 18424. [2019-12-27 05:23:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18424 states. [2019-12-27 05:23:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18424 states to 18424 states and 55823 transitions. [2019-12-27 05:23:55,447 INFO L78 Accepts]: Start accepts. Automaton has 18424 states and 55823 transitions. Word has length 27 [2019-12-27 05:23:55,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:55,447 INFO L462 AbstractCegarLoop]: Abstraction has 18424 states and 55823 transitions. [2019-12-27 05:23:55,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:23:55,447 INFO L276 IsEmpty]: Start isEmpty. Operand 18424 states and 55823 transitions. [2019-12-27 05:23:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:23:55,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:55,465 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 05:23:55,465 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 05:23:55,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash 805811820, now seen corresponding path program 1 times [2019-12-27 05:23:55,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:55,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781521527] [2019-12-27 05:23:55,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:55,573 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 05:23:55,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781521527] [2019-12-27 05:23:55,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:55,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:23:55,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222815508] [2019-12-27 05:23:55,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:23:55,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:55,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:23:55,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:23:55,575 INFO L87 Difference]: Start difference. First operand 18424 states and 55823 transitions. Second operand 7 states. [2019-12-27 05:23:56,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:56,677 INFO L93 Difference]: Finished difference Result 25102 states and 74108 transitions. [2019-12-27 05:23:56,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 05:23:56,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 05:23:56,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:56,718 INFO L225 Difference]: With dead ends: 25102 [2019-12-27 05:23:56,718 INFO L226 Difference]: Without dead ends: 25102 [2019-12-27 05:23:56,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 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 05:23:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25102 states. [2019-12-27 05:23:57,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25102 to 17010. [2019-12-27 05:23:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17010 states. [2019-12-27 05:23:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17010 states to 17010 states and 51608 transitions. [2019-12-27 05:23:57,251 INFO L78 Accepts]: Start accepts. Automaton has 17010 states and 51608 transitions. Word has length 33 [2019-12-27 05:23:57,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:57,251 INFO L462 AbstractCegarLoop]: Abstraction has 17010 states and 51608 transitions. [2019-12-27 05:23:57,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:23:57,252 INFO L276 IsEmpty]: Start isEmpty. Operand 17010 states and 51608 transitions. [2019-12-27 05:23:57,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:23:57,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:57,276 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 05:23:57,276 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 05:23:57,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:57,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1882924927, now seen corresponding path program 1 times [2019-12-27 05:23:57,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:57,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660853827] [2019-12-27 05:23:57,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:57,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660853827] [2019-12-27 05:23:57,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:57,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:23:57,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341199445] [2019-12-27 05:23:57,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:57,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:57,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:57,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:57,345 INFO L87 Difference]: Start difference. First operand 17010 states and 51608 transitions. Second operand 3 states. [2019-12-27 05:23:57,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:57,431 INFO L93 Difference]: Finished difference Result 28822 states and 87795 transitions. [2019-12-27 05:23:57,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:57,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:23:57,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:57,452 INFO L225 Difference]: With dead ends: 28822 [2019-12-27 05:23:57,452 INFO L226 Difference]: Without dead ends: 14466 [2019-12-27 05:23:57,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 05:23:57,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14466 states. [2019-12-27 05:23:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14466 to 14406. [2019-12-27 05:23:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14406 states. [2019-12-27 05:23:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14406 states to 14406 states and 43046 transitions. [2019-12-27 05:23:57,666 INFO L78 Accepts]: Start accepts. Automaton has 14406 states and 43046 transitions. Word has length 39 [2019-12-27 05:23:57,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:57,666 INFO L462 AbstractCegarLoop]: Abstraction has 14406 states and 43046 transitions. [2019-12-27 05:23:57,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 14406 states and 43046 transitions. [2019-12-27 05:23:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:23:57,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:57,683 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 05:23:57,683 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 05:23:57,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1781220711, now seen corresponding path program 2 times [2019-12-27 05:23:57,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:57,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374701553] [2019-12-27 05:23:57,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:57,756 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 05:23:57,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374701553] [2019-12-27 05:23:57,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:57,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:23:57,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607138668] [2019-12-27 05:23:57,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:57,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:57,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:57,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:57,759 INFO L87 Difference]: Start difference. First operand 14406 states and 43046 transitions. Second operand 3 states. [2019-12-27 05:23:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:57,798 INFO L93 Difference]: Finished difference Result 14405 states and 43044 transitions. [2019-12-27 05:23:57,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:57,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:23:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:57,817 INFO L225 Difference]: With dead ends: 14405 [2019-12-27 05:23:57,817 INFO L226 Difference]: Without dead ends: 14405 [2019-12-27 05:23:57,818 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 05:23:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14405 states. [2019-12-27 05:23:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14405 to 14405. [2019-12-27 05:23:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14405 states. [2019-12-27 05:23:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14405 states to 14405 states and 43044 transitions. [2019-12-27 05:23:58,030 INFO L78 Accepts]: Start accepts. Automaton has 14405 states and 43044 transitions. Word has length 39 [2019-12-27 05:23:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:58,030 INFO L462 AbstractCegarLoop]: Abstraction has 14405 states and 43044 transitions. [2019-12-27 05:23:58,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 14405 states and 43044 transitions. [2019-12-27 05:23:58,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:23:58,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:58,048 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 05:23:58,048 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 05:23:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:58,049 INFO L82 PathProgramCache]: Analyzing trace with hash -918298112, now seen corresponding path program 1 times [2019-12-27 05:23:58,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:58,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820452357] [2019-12-27 05:23:58,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:58,152 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 05:23:58,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820452357] [2019-12-27 05:23:58,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:58,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:23:58,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549928165] [2019-12-27 05:23:58,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:58,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:58,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:58,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:58,154 INFO L87 Difference]: Start difference. First operand 14405 states and 43044 transitions. Second operand 3 states. [2019-12-27 05:23:58,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:58,236 INFO L93 Difference]: Finished difference Result 13533 states and 39774 transitions. [2019-12-27 05:23:58,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:58,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 05:23:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:58,262 INFO L225 Difference]: With dead ends: 13533 [2019-12-27 05:23:58,262 INFO L226 Difference]: Without dead ends: 13533 [2019-12-27 05:23:58,263 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 05:23:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13533 states. [2019-12-27 05:23:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13533 to 13525. [2019-12-27 05:23:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13525 states. [2019-12-27 05:23:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13525 states to 13525 states and 39758 transitions. [2019-12-27 05:23:58,592 INFO L78 Accepts]: Start accepts. Automaton has 13525 states and 39758 transitions. Word has length 40 [2019-12-27 05:23:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:58,593 INFO L462 AbstractCegarLoop]: Abstraction has 13525 states and 39758 transitions. [2019-12-27 05:23:58,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 13525 states and 39758 transitions. [2019-12-27 05:23:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 05:23:58,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:58,611 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 05:23:58,611 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 05:23:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:58,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1966351791, now seen corresponding path program 1 times [2019-12-27 05:23:58,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:58,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272509626] [2019-12-27 05:23:58,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:58,716 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 05:23:58,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272509626] [2019-12-27 05:23:58,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:58,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:23:58,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036383426] [2019-12-27 05:23:58,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:23:58,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:58,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:23:58,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:23:58,718 INFO L87 Difference]: Start difference. First operand 13525 states and 39758 transitions. Second operand 5 states. [2019-12-27 05:23:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:58,781 INFO L93 Difference]: Finished difference Result 12473 states and 37353 transitions. [2019-12-27 05:23:58,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:23:58,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 05:23:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:58,801 INFO L225 Difference]: With dead ends: 12473 [2019-12-27 05:23:58,802 INFO L226 Difference]: Without dead ends: 10988 [2019-12-27 05:23:58,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:23:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10988 states. [2019-12-27 05:23:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10988 to 10575. [2019-12-27 05:23:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10575 states. [2019-12-27 05:23:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10575 states to 10575 states and 32609 transitions. [2019-12-27 05:23:58,983 INFO L78 Accepts]: Start accepts. Automaton has 10575 states and 32609 transitions. Word has length 41 [2019-12-27 05:23:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:58,984 INFO L462 AbstractCegarLoop]: Abstraction has 10575 states and 32609 transitions. [2019-12-27 05:23:58,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:23:58,984 INFO L276 IsEmpty]: Start isEmpty. Operand 10575 states and 32609 transitions. [2019-12-27 05:23:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:23:58,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:58,995 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] [2019-12-27 05:23:58,995 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 05:23:58,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:58,996 INFO L82 PathProgramCache]: Analyzing trace with hash -93789766, now seen corresponding path program 1 times [2019-12-27 05:23:58,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:58,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617494128] [2019-12-27 05:23:58,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:59,043 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 05:23:59,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617494128] [2019-12-27 05:23:59,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:59,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:23:59,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165302415] [2019-12-27 05:23:59,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:59,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:59,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:59,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:59,045 INFO L87 Difference]: Start difference. First operand 10575 states and 32609 transitions. Second operand 3 states. [2019-12-27 05:23:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:59,133 INFO L93 Difference]: Finished difference Result 16833 states and 50823 transitions. [2019-12-27 05:23:59,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:59,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:23:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:59,161 INFO L225 Difference]: With dead ends: 16833 [2019-12-27 05:23:59,161 INFO L226 Difference]: Without dead ends: 16833 [2019-12-27 05:23:59,161 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 05:23:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16833 states. [2019-12-27 05:23:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16833 to 12205. [2019-12-27 05:23:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12205 states. [2019-12-27 05:23:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12205 states to 12205 states and 37323 transitions. [2019-12-27 05:23:59,396 INFO L78 Accepts]: Start accepts. Automaton has 12205 states and 37323 transitions. Word has length 65 [2019-12-27 05:23:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:59,397 INFO L462 AbstractCegarLoop]: Abstraction has 12205 states and 37323 transitions. [2019-12-27 05:23:59,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 12205 states and 37323 transitions. [2019-12-27 05:23:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:23:59,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:59,410 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] [2019-12-27 05:23:59,410 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 05:23:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:59,410 INFO L82 PathProgramCache]: Analyzing trace with hash 435603939, now seen corresponding path program 1 times [2019-12-27 05:23:59,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:59,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391967356] [2019-12-27 05:23:59,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:59,490 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 05:23:59,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391967356] [2019-12-27 05:23:59,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:59,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:23:59,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122988469] [2019-12-27 05:23:59,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:59,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:59,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:59,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:59,494 INFO L87 Difference]: Start difference. First operand 12205 states and 37323 transitions. Second operand 3 states. [2019-12-27 05:23:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:59,619 INFO L93 Difference]: Finished difference Result 16062 states and 48757 transitions. [2019-12-27 05:23:59,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:59,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:23:59,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:59,649 INFO L225 Difference]: With dead ends: 16062 [2019-12-27 05:23:59,649 INFO L226 Difference]: Without dead ends: 16062 [2019-12-27 05:23:59,651 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 05:23:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16062 states. [2019-12-27 05:24:00,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16062 to 13225. [2019-12-27 05:24:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13225 states. [2019-12-27 05:24:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13225 states to 13225 states and 40546 transitions. [2019-12-27 05:24:00,096 INFO L78 Accepts]: Start accepts. Automaton has 13225 states and 40546 transitions. Word has length 65 [2019-12-27 05:24:00,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:00,096 INFO L462 AbstractCegarLoop]: Abstraction has 13225 states and 40546 transitions. [2019-12-27 05:24:00,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:24:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 13225 states and 40546 transitions. [2019-12-27 05:24:00,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:24:00,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:00,118 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 05:24:00,118 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 05:24:00,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash -317681746, now seen corresponding path program 1 times [2019-12-27 05:24:00,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:00,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173971244] [2019-12-27 05:24:00,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:00,338 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 05:24:00,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173971244] [2019-12-27 05:24:00,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:00,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:24:00,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936068775] [2019-12-27 05:24:00,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:24:00,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:00,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:24:00,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:24:00,340 INFO L87 Difference]: Start difference. First operand 13225 states and 40546 transitions. Second operand 10 states. [2019-12-27 05:24:02,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:02,589 INFO L93 Difference]: Finished difference Result 32806 states and 100872 transitions. [2019-12-27 05:24:02,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 05:24:02,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 05:24:02,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:02,634 INFO L225 Difference]: With dead ends: 32806 [2019-12-27 05:24:02,634 INFO L226 Difference]: Without dead ends: 21421 [2019-12-27 05:24:02,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:24:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21421 states. [2019-12-27 05:24:02,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21421 to 15776. [2019-12-27 05:24:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15776 states. [2019-12-27 05:24:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15776 states to 15776 states and 48134 transitions. [2019-12-27 05:24:02,927 INFO L78 Accepts]: Start accepts. Automaton has 15776 states and 48134 transitions. Word has length 66 [2019-12-27 05:24:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:02,927 INFO L462 AbstractCegarLoop]: Abstraction has 15776 states and 48134 transitions. [2019-12-27 05:24:02,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:24:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 15776 states and 48134 transitions. [2019-12-27 05:24:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:24:02,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:02,950 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 05:24:02,950 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 05:24:02,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:02,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1982899770, now seen corresponding path program 2 times [2019-12-27 05:24:02,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:02,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868766345] [2019-12-27 05:24:02,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:03,149 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 05:24:03,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868766345] [2019-12-27 05:24:03,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:03,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:24:03,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778411982] [2019-12-27 05:24:03,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:24:03,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:03,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:24:03,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:24:03,151 INFO L87 Difference]: Start difference. First operand 15776 states and 48134 transitions. Second operand 11 states. [2019-12-27 05:24:05,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:05,004 INFO L93 Difference]: Finished difference Result 27946 states and 84903 transitions. [2019-12-27 05:24:05,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 05:24:05,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 05:24:05,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:05,035 INFO L225 Difference]: With dead ends: 27946 [2019-12-27 05:24:05,035 INFO L226 Difference]: Without dead ends: 22257 [2019-12-27 05:24:05,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-27 05:24:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22257 states. [2019-12-27 05:24:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22257 to 15784. [2019-12-27 05:24:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15784 states. [2019-12-27 05:24:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15784 states to 15784 states and 48020 transitions. [2019-12-27 05:24:05,329 INFO L78 Accepts]: Start accepts. Automaton has 15784 states and 48020 transitions. Word has length 66 [2019-12-27 05:24:05,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:05,329 INFO L462 AbstractCegarLoop]: Abstraction has 15784 states and 48020 transitions. [2019-12-27 05:24:05,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:24:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 15784 states and 48020 transitions. [2019-12-27 05:24:05,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:24:05,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:05,353 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 05:24:05,354 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 05:24:05,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:05,354 INFO L82 PathProgramCache]: Analyzing trace with hash -708091410, now seen corresponding path program 3 times [2019-12-27 05:24:05,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:05,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113281909] [2019-12-27 05:24:05,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:05,451 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 05:24:05,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113281909] [2019-12-27 05:24:05,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:05,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:24:05,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878352784] [2019-12-27 05:24:05,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:24:05,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:05,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:24:05,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:05,453 INFO L87 Difference]: Start difference. First operand 15784 states and 48020 transitions. Second operand 3 states. [2019-12-27 05:24:05,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:05,622 INFO L93 Difference]: Finished difference Result 15783 states and 48018 transitions. [2019-12-27 05:24:05,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:24:05,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:24:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:05,655 INFO L225 Difference]: With dead ends: 15783 [2019-12-27 05:24:05,655 INFO L226 Difference]: Without dead ends: 15783 [2019-12-27 05:24:05,655 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 05:24:05,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15783 states. [2019-12-27 05:24:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15783 to 12668. [2019-12-27 05:24:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12668 states. [2019-12-27 05:24:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12668 states to 12668 states and 39192 transitions. [2019-12-27 05:24:05,991 INFO L78 Accepts]: Start accepts. Automaton has 12668 states and 39192 transitions. Word has length 66 [2019-12-27 05:24:05,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:05,991 INFO L462 AbstractCegarLoop]: Abstraction has 12668 states and 39192 transitions. [2019-12-27 05:24:05,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:24:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 12668 states and 39192 transitions. [2019-12-27 05:24:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:24:06,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:06,012 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 05:24:06,012 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 05:24:06,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:06,012 INFO L82 PathProgramCache]: Analyzing trace with hash -408447633, now seen corresponding path program 1 times [2019-12-27 05:24:06,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:06,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302132286] [2019-12-27 05:24:06,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:06,691 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 05:24:06,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302132286] [2019-12-27 05:24:06,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:06,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 05:24:06,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904669040] [2019-12-27 05:24:06,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 05:24:06,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:06,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 05:24:06,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:24:06,694 INFO L87 Difference]: Start difference. First operand 12668 states and 39192 transitions. Second operand 16 states. [2019-12-27 05:24:16,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:16,282 INFO L93 Difference]: Finished difference Result 34334 states and 101787 transitions. [2019-12-27 05:24:16,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-12-27 05:24:16,282 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 05:24:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:16,317 INFO L225 Difference]: With dead ends: 34334 [2019-12-27 05:24:16,317 INFO L226 Difference]: Without dead ends: 27755 [2019-12-27 05:24:16,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2703 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=985, Invalid=7025, Unknown=0, NotChecked=0, Total=8010 [2019-12-27 05:24:16,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27755 states. [2019-12-27 05:24:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27755 to 14436. [2019-12-27 05:24:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14436 states. [2019-12-27 05:24:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14436 states to 14436 states and 44024 transitions. [2019-12-27 05:24:16,617 INFO L78 Accepts]: Start accepts. Automaton has 14436 states and 44024 transitions. Word has length 67 [2019-12-27 05:24:16,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:16,618 INFO L462 AbstractCegarLoop]: Abstraction has 14436 states and 44024 transitions. [2019-12-27 05:24:16,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 05:24:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 14436 states and 44024 transitions. [2019-12-27 05:24:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:24:16,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:16,633 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 05:24:16,633 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 05:24:16,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:16,633 INFO L82 PathProgramCache]: Analyzing trace with hash 874529647, now seen corresponding path program 2 times [2019-12-27 05:24:16,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:16,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071692289] [2019-12-27 05:24:16,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:17,314 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 05:24:17,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071692289] [2019-12-27 05:24:17,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:17,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 05:24:17,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622270436] [2019-12-27 05:24:17,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 05:24:17,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:17,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 05:24:17,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-27 05:24:17,316 INFO L87 Difference]: Start difference. First operand 14436 states and 44024 transitions. Second operand 17 states. [2019-12-27 05:24:26,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:26,251 INFO L93 Difference]: Finished difference Result 29339 states and 88055 transitions. [2019-12-27 05:24:26,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 05:24:26,251 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 05:24:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:26,284 INFO L225 Difference]: With dead ends: 29339 [2019-12-27 05:24:26,284 INFO L226 Difference]: Without dead ends: 26108 [2019-12-27 05:24:26,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=441, Invalid=2211, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 05:24:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26108 states. [2019-12-27 05:24:26,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26108 to 14104. [2019-12-27 05:24:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14104 states. [2019-12-27 05:24:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14104 states to 14104 states and 43083 transitions. [2019-12-27 05:24:26,572 INFO L78 Accepts]: Start accepts. Automaton has 14104 states and 43083 transitions. Word has length 67 [2019-12-27 05:24:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:26,573 INFO L462 AbstractCegarLoop]: Abstraction has 14104 states and 43083 transitions. [2019-12-27 05:24:26,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 05:24:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 14104 states and 43083 transitions. [2019-12-27 05:24:26,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:24:26,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:26,588 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 05:24:26,589 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 05:24:26,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:26,589 INFO L82 PathProgramCache]: Analyzing trace with hash 333885369, now seen corresponding path program 3 times [2019-12-27 05:24:26,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:26,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916379420] [2019-12-27 05:24:26,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:26,769 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 05:24:26,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916379420] [2019-12-27 05:24:26,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:26,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:24:26,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829134589] [2019-12-27 05:24:26,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:24:26,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:26,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:24:26,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:24:26,771 INFO L87 Difference]: Start difference. First operand 14104 states and 43083 transitions. Second operand 11 states. [2019-12-27 05:24:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:28,923 INFO L93 Difference]: Finished difference Result 26102 states and 78544 transitions. [2019-12-27 05:24:28,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:24:28,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:24:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:28,957 INFO L225 Difference]: With dead ends: 26102 [2019-12-27 05:24:28,957 INFO L226 Difference]: Without dead ends: 24559 [2019-12-27 05:24:28,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-12-27 05:24:29,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24559 states. [2019-12-27 05:24:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24559 to 14434. [2019-12-27 05:24:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14434 states. [2019-12-27 05:24:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14434 states to 14434 states and 43987 transitions. [2019-12-27 05:24:29,255 INFO L78 Accepts]: Start accepts. Automaton has 14434 states and 43987 transitions. Word has length 67 [2019-12-27 05:24:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:29,256 INFO L462 AbstractCegarLoop]: Abstraction has 14434 states and 43987 transitions. [2019-12-27 05:24:29,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:24:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 14434 states and 43987 transitions. [2019-12-27 05:24:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:24:29,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:29,271 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 05:24:29,271 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 05:24:29,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:29,271 INFO L82 PathProgramCache]: Analyzing trace with hash 938963833, now seen corresponding path program 4 times [2019-12-27 05:24:29,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:29,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900517128] [2019-12-27 05:24:29,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:29,752 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 05:24:29,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900517128] [2019-12-27 05:24:29,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:29,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 05:24:29,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183053166] [2019-12-27 05:24:29,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 05:24:29,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:29,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 05:24:29,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 05:24:29,754 INFO L87 Difference]: Start difference. First operand 14434 states and 43987 transitions. Second operand 17 states. [2019-12-27 05:24:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:31,941 INFO L93 Difference]: Finished difference Result 15758 states and 46928 transitions. [2019-12-27 05:24:31,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 05:24:31,942 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 05:24:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:31,964 INFO L225 Difference]: With dead ends: 15758 [2019-12-27 05:24:31,964 INFO L226 Difference]: Without dead ends: 14647 [2019-12-27 05:24:31,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 05:24:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14647 states. [2019-12-27 05:24:32,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14647 to 13298. [2019-12-27 05:24:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2019-12-27 05:24:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 40393 transitions. [2019-12-27 05:24:32,181 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 40393 transitions. Word has length 67 [2019-12-27 05:24:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:32,181 INFO L462 AbstractCegarLoop]: Abstraction has 13298 states and 40393 transitions. [2019-12-27 05:24:32,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 05:24:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 40393 transitions. [2019-12-27 05:24:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:24:32,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:32,196 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 05:24:32,196 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 05:24:32,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:32,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1964426721, now seen corresponding path program 1 times [2019-12-27 05:24:32,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:32,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701246861] [2019-12-27 05:24:32,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:32,249 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 05:24:32,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701246861] [2019-12-27 05:24:32,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:32,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:32,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128583480] [2019-12-27 05:24:32,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:24:32,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:32,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:24:32,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:32,251 INFO L87 Difference]: Start difference. First operand 13298 states and 40393 transitions. Second operand 3 states. [2019-12-27 05:24:32,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:32,443 INFO L93 Difference]: Finished difference Result 18363 states and 55815 transitions. [2019-12-27 05:24:32,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:24:32,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 05:24:32,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:32,470 INFO L225 Difference]: With dead ends: 18363 [2019-12-27 05:24:32,470 INFO L226 Difference]: Without dead ends: 18363 [2019-12-27 05:24:32,470 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 05:24:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18363 states. [2019-12-27 05:24:32,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18363 to 13566. [2019-12-27 05:24:32,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13566 states. [2019-12-27 05:24:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13566 states to 13566 states and 41271 transitions. [2019-12-27 05:24:32,790 INFO L78 Accepts]: Start accepts. Automaton has 13566 states and 41271 transitions. Word has length 67 [2019-12-27 05:24:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:32,790 INFO L462 AbstractCegarLoop]: Abstraction has 13566 states and 41271 transitions. [2019-12-27 05:24:32,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:24:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 13566 states and 41271 transitions. [2019-12-27 05:24:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:24:32,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:32,805 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 05:24:32,805 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 05:24:32,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:32,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1121491725, now seen corresponding path program 2 times [2019-12-27 05:24:32,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:32,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248401909] [2019-12-27 05:24:32,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:32,863 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 05:24:32,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248401909] [2019-12-27 05:24:32,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:32,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:32,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157551066] [2019-12-27 05:24:32,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:24:32,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:32,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:24:32,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:24:32,865 INFO L87 Difference]: Start difference. First operand 13566 states and 41271 transitions. Second operand 4 states. [2019-12-27 05:24:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:32,977 INFO L93 Difference]: Finished difference Result 13409 states and 40650 transitions. [2019-12-27 05:24:32,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:24:32,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 05:24:32,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:33,003 INFO L225 Difference]: With dead ends: 13409 [2019-12-27 05:24:33,003 INFO L226 Difference]: Without dead ends: 13409 [2019-12-27 05:24:33,003 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 05:24:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13409 states. [2019-12-27 05:24:33,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13409 to 11743. [2019-12-27 05:24:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11743 states. [2019-12-27 05:24:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11743 states to 11743 states and 35623 transitions. [2019-12-27 05:24:33,274 INFO L78 Accepts]: Start accepts. Automaton has 11743 states and 35623 transitions. Word has length 67 [2019-12-27 05:24:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:33,275 INFO L462 AbstractCegarLoop]: Abstraction has 11743 states and 35623 transitions. [2019-12-27 05:24:33,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:24:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 11743 states and 35623 transitions. [2019-12-27 05:24:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:24:33,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:33,288 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 05:24:33,288 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 05:24:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:33,288 INFO L82 PathProgramCache]: Analyzing trace with hash -2085543057, now seen corresponding path program 5 times [2019-12-27 05:24:33,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:33,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150376082] [2019-12-27 05:24:33,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:33,523 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 05:24:33,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150376082] [2019-12-27 05:24:33,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:33,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 05:24:33,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069119608] [2019-12-27 05:24:33,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 05:24:33,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 05:24:33,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:24:33,525 INFO L87 Difference]: Start difference. First operand 11743 states and 35623 transitions. Second operand 13 states. [2019-12-27 05:24:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:36,335 INFO L93 Difference]: Finished difference Result 18007 states and 54138 transitions. [2019-12-27 05:24:36,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 05:24:36,335 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 05:24:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:36,359 INFO L225 Difference]: With dead ends: 18007 [2019-12-27 05:24:36,359 INFO L226 Difference]: Without dead ends: 15865 [2019-12-27 05:24:36,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=357, Invalid=2093, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 05:24:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15865 states. [2019-12-27 05:24:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15865 to 12680. [2019-12-27 05:24:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12680 states. [2019-12-27 05:24:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12680 states to 12680 states and 38539 transitions. [2019-12-27 05:24:36,576 INFO L78 Accepts]: Start accepts. Automaton has 12680 states and 38539 transitions. Word has length 67 [2019-12-27 05:24:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:36,577 INFO L462 AbstractCegarLoop]: Abstraction has 12680 states and 38539 transitions. [2019-12-27 05:24:36,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 05:24:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 12680 states and 38539 transitions. [2019-12-27 05:24:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:24:36,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:36,591 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 05:24:36,591 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 05:24:36,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:36,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1507165159, now seen corresponding path program 6 times [2019-12-27 05:24:36,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:36,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029531621] [2019-12-27 05:24:36,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:36,776 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 05:24:36,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029531621] [2019-12-27 05:24:36,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:36,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 05:24:36,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491976436] [2019-12-27 05:24:36,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 05:24:36,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:36,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 05:24:36,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:24:36,778 INFO L87 Difference]: Start difference. First operand 12680 states and 38539 transitions. Second operand 13 states. [2019-12-27 05:24:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:38,927 INFO L93 Difference]: Finished difference Result 16986 states and 51077 transitions. [2019-12-27 05:24:38,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 05:24:38,927 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 05:24:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:38,945 INFO L225 Difference]: With dead ends: 16986 [2019-12-27 05:24:38,945 INFO L226 Difference]: Without dead ends: 12718 [2019-12-27 05:24:38,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=1354, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 05:24:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12718 states. [2019-12-27 05:24:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12718 to 10858. [2019-12-27 05:24:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10858 states. [2019-12-27 05:24:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10858 states to 10858 states and 33198 transitions. [2019-12-27 05:24:39,129 INFO L78 Accepts]: Start accepts. Automaton has 10858 states and 33198 transitions. Word has length 67 [2019-12-27 05:24:39,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:39,129 INFO L462 AbstractCegarLoop]: Abstraction has 10858 states and 33198 transitions. [2019-12-27 05:24:39,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 05:24:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 10858 states and 33198 transitions. [2019-12-27 05:24:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:24:39,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:39,140 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 05:24:39,140 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 05:24:39,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:39,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1704185659, now seen corresponding path program 7 times [2019-12-27 05:24:39,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:39,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395566119] [2019-12-27 05:24:39,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:24:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:24:39,404 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:24:39,404 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:24:39,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [897] [897] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~a$r_buff1_thd3~0_51) (= 0 v_~a$w_buff1_used~0_72) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~a$w_buff0_used~0_114) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_8) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t293~0.base_25|) (= |v_ULTIMATE.start_main_~#t293~0.offset_20| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t293~0.base_25|)) (= 0 v_~a$r_buff1_thd1~0_16) (= 0 v_~__unbuffered_cnt~0_21) (= v_~z~0_10 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t293~0.base_25| 1)) (= v_~a$flush_delayed~0_12 0) (= 0 v_~weak$$choice2~0_32) (= v_~a$r_buff0_thd3~0_76 0) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t293~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t293~0.base_25|) |v_ULTIMATE.start_main_~#t293~0.offset_20| 0)) |v_#memory_int_23|) (= 0 v_~__unbuffered_p2_EAX~0_17) (= v_~__unbuffered_p2_EBX~0_18 0) (= v_~a$r_buff0_thd2~0_20 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice0~0_7) (= v_~a$mem_tmp~0_10 0) (= v_~a~0_29 0) (= 0 v_~a$r_buff1_thd0~0_22) (= |v_#NULL.offset_4| 0) (= v_~a$r_buff0_thd1~0_25 0) (= v_~main$tmp_guard0~0_11 0) (= v_~a$read_delayed_var~0.offset_8 0) (= 0 v_~a$w_buff1~0_25) (= v_~x~0_19 0) (= 0 v_~a$r_buff1_thd2~0_18) (= 0 v_~__unbuffered_p1_EAX~0_16) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t293~0.base_25| 4)) (= 0 v_~a$w_buff0~0_25) (= 0 v_~a$read_delayed~0_8) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_29, ULTIMATE.start_main_~#t293~0.offset=|v_ULTIMATE.start_main_~#t293~0.offset_20|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_main_~#t294~0.base=|v_ULTIMATE.start_main_~#t294~0.base_26|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_18, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_114, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_25, ULTIMATE.start_main_~#t295~0.base=|v_ULTIMATE.start_main_~#t295~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t295~0.offset=|v_ULTIMATE.start_main_~#t295~0.offset_16|, ~a$w_buff0~0=v_~a$w_buff0~0_25, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_19, ULTIMATE.start_main_~#t294~0.offset=|v_ULTIMATE.start_main_~#t294~0.offset_20|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~y~0=v_~y~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_16, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_76, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_10, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t293~0.base=|v_ULTIMATE.start_main_~#t293~0.base_25|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_~#t293~0.offset, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t294~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t295~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t295~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t294~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t293~0.base] because there is no mapped edge [2019-12-27 05:24:39,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L835-1-->L837: Formula: (and (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t294~0.base_13|) 0) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t294~0.base_13| 1) |v_#valid_40|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t294~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t294~0.base_13|) |v_ULTIMATE.start_main_~#t294~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t294~0.base_13|)) (= |v_ULTIMATE.start_main_~#t294~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t294~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t294~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t294~0.offset=|v_ULTIMATE.start_main_~#t294~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, ULTIMATE.start_main_~#t294~0.base=|v_ULTIMATE.start_main_~#t294~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t294~0.offset, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t294~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 05:24:39,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L750: Formula: (and (= 1 v_~x~0_5) (= v_~a$r_buff0_thd1~0_16 v_~a$r_buff1_thd1~0_11) (= v_~a$r_buff0_thd1~0_15 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~a$r_buff0_thd2~0_14 v_~a$r_buff1_thd2~0_10) (= v_~a$r_buff0_thd3~0_48 v_~a$r_buff1_thd3~0_28) (= v_~a$r_buff0_thd0~0_14 v_~a$r_buff1_thd0~0_11)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_14, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_16, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_14} OutVars{~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_11, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_10, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_14, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_11, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_15, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_14, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 05:24:39,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L776-2-->L776-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1690562821 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1690562821 256)))) (or (and (= ~a~0_In-1690562821 |P1Thread1of1ForFork2_#t~ite9_Out-1690562821|) (or .cse0 .cse1)) (and (= ~a$w_buff1~0_In-1690562821 |P1Thread1of1ForFork2_#t~ite9_Out-1690562821|) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In-1690562821, ~a$w_buff1~0=~a$w_buff1~0_In-1690562821, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1690562821, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1690562821} OutVars{~a~0=~a~0_In-1690562821, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1690562821|, ~a$w_buff1~0=~a$w_buff1~0_In-1690562821, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1690562821, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1690562821} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 05:24:39,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L776-4-->L777: Formula: (= v_~a~0_20 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_20, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 05:24:39,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-884995555 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-884995555 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-884995555 |P0Thread1of1ForFork1_#t~ite5_Out-884995555|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-884995555|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-884995555, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-884995555} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-884995555|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-884995555, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-884995555} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 05:24:39,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd1~0_In2144601133 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In2144601133 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In2144601133 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In2144601133 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out2144601133| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite6_Out2144601133| ~a$w_buff1_used~0_In2144601133) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2144601133, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2144601133, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2144601133, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2144601133} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out2144601133|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2144601133, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2144601133, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2144601133, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2144601133} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 05:24:39,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L753-->L754: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In2117596950 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2117596950 256)))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out2117596950 0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_Out2117596950 ~a$r_buff0_thd1~0_In2117596950) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2117596950, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2117596950} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2117596950|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2117596950, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out2117596950} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:24:39,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-2074407024 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-2074407024 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-2074407024 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-2074407024 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-2074407024| ~a$r_buff1_thd1~0_In-2074407024) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-2074407024|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2074407024, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2074407024, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2074407024, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2074407024} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-2074407024|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2074407024, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2074407024, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2074407024, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2074407024} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 05:24:39,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:24:39,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t295~0.base_12| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t295~0.base_12|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t295~0.base_12|)) (= |v_ULTIMATE.start_main_~#t295~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t295~0.base_12| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t295~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t295~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t295~0.base_12|) |v_ULTIMATE.start_main_~#t295~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t295~0.offset=|v_ULTIMATE.start_main_~#t295~0.offset_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t295~0.base=|v_ULTIMATE.start_main_~#t295~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t295~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t295~0.base] because there is no mapped edge [2019-12-27 05:24:39,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-221997283 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In-221997283| |P2Thread1of1ForFork0_#t~ite20_Out-221997283|) (not .cse0) (= ~a$w_buff0~0_In-221997283 |P2Thread1of1ForFork0_#t~ite21_Out-221997283|)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-221997283 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-221997283 256)) .cse1) (= (mod ~a$w_buff0_used~0_In-221997283 256) 0) (and (= 0 (mod ~a$w_buff1_used~0_In-221997283 256)) .cse1))) .cse0 (= ~a$w_buff0~0_In-221997283 |P2Thread1of1ForFork0_#t~ite20_Out-221997283|) (= |P2Thread1of1ForFork0_#t~ite20_Out-221997283| |P2Thread1of1ForFork0_#t~ite21_Out-221997283|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-221997283, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-221997283, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-221997283, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-221997283, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-221997283, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-221997283|, ~weak$$choice2~0=~weak$$choice2~0_In-221997283} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-221997283|, ~a$w_buff0~0=~a$w_buff0~0_In-221997283, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-221997283, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-221997283, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-221997283, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-221997283|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-221997283, ~weak$$choice2~0=~weak$$choice2~0_In-221997283} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 05:24:39,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L803-->L803-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In187955541 256)))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In187955541 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In187955541 256)) .cse0) (= (mod ~a$w_buff0_used~0_In187955541 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In187955541 256)) .cse0))) (= ~a$w_buff0_used~0_In187955541 |P2Thread1of1ForFork0_#t~ite26_Out187955541|) .cse1 (= |P2Thread1of1ForFork0_#t~ite27_Out187955541| |P2Thread1of1ForFork0_#t~ite26_Out187955541|)) (and (= |P2Thread1of1ForFork0_#t~ite26_In187955541| |P2Thread1of1ForFork0_#t~ite26_Out187955541|) (not .cse1) (= ~a$w_buff0_used~0_In187955541 |P2Thread1of1ForFork0_#t~ite27_Out187955541|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In187955541|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In187955541, ~a$w_buff0_used~0=~a$w_buff0_used~0_In187955541, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In187955541, ~a$w_buff1_used~0=~a$w_buff1_used~0_In187955541, ~weak$$choice2~0=~weak$$choice2~0_In187955541} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out187955541|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out187955541|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In187955541, ~a$w_buff0_used~0=~a$w_buff0_used~0_In187955541, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In187955541, ~a$w_buff1_used~0=~a$w_buff1_used~0_In187955541, ~weak$$choice2~0=~weak$$choice2~0_In187955541} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 05:24:39,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1345398142 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite30_Out-1345398142| ~a$w_buff1_used~0_In-1345398142) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite29_In-1345398142| |P2Thread1of1ForFork0_#t~ite29_Out-1345398142|)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1345398142 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-1345398142 256)) .cse1) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1345398142 256) 0)) (= (mod ~a$w_buff0_used~0_In-1345398142 256) 0))) .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out-1345398142| |P2Thread1of1ForFork0_#t~ite30_Out-1345398142|) (= |P2Thread1of1ForFork0_#t~ite29_Out-1345398142| ~a$w_buff1_used~0_In-1345398142)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1345398142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345398142, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1345398142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1345398142, ~weak$$choice2~0=~weak$$choice2~0_In-1345398142, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1345398142|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1345398142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345398142, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1345398142, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1345398142|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1345398142, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1345398142|, ~weak$$choice2~0=~weak$$choice2~0_In-1345398142} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 05:24:39,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 05:24:39,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L808-->L812: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a$flush_delayed~0_6 0) (= v_~a~0_21 v_~a$mem_tmp~0_4)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_21, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 05:24:39,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L812-2-->L812-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-1962226583 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1962226583 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1962226583| ~a~0_In-1962226583) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1962226583| ~a$w_buff1~0_In-1962226583) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In-1962226583, ~a$w_buff1~0=~a$w_buff1~0_In-1962226583, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1962226583, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1962226583} OutVars{~a~0=~a~0_In-1962226583, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1962226583|, ~a$w_buff1~0=~a$w_buff1~0_In-1962226583, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1962226583, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1962226583} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:24:39,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L812-4-->L813: Formula: (= v_~a~0_16 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_16, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:24:39,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1655904143 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1655904143 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1655904143|) (not .cse1)) (and (= ~a$w_buff0_used~0_In-1655904143 |P2Thread1of1ForFork0_#t~ite40_Out-1655904143|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1655904143, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1655904143} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1655904143|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1655904143, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1655904143} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 05:24:39,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-667212213 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-667212213 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-667212213 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-667212213 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-667212213 |P2Thread1of1ForFork0_#t~ite41_Out-667212213|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-667212213|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-667212213, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-667212213, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-667212213, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-667212213} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-667212213, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-667212213, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-667212213, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-667212213, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-667212213|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 05:24:39,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1491025234 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1491025234 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1491025234|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd3~0_In1491025234 |P2Thread1of1ForFork0_#t~ite42_Out1491025234|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1491025234, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1491025234} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1491025234, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1491025234, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1491025234|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:24:39,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1459573853 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1459573853 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-1459573853 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-1459573853 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1459573853| 0)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1459573853| ~a$r_buff1_thd3~0_In-1459573853) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1459573853, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1459573853, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1459573853, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1459573853} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1459573853|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1459573853, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1459573853, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1459573853, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1459573853} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 05:24:39,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_42 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_42, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:24:39,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In892648928 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In892648928 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out892648928|)) (and (= ~a$w_buff0_used~0_In892648928 |P1Thread1of1ForFork2_#t~ite11_Out892648928|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In892648928, ~a$w_buff0_used~0=~a$w_buff0_used~0_In892648928} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In892648928, ~a$w_buff0_used~0=~a$w_buff0_used~0_In892648928, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out892648928|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:24:39,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In451394266 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In451394266 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In451394266 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In451394266 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In451394266 |P1Thread1of1ForFork2_#t~ite12_Out451394266|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out451394266| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In451394266, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In451394266, ~a$w_buff0_used~0=~a$w_buff0_used~0_In451394266, ~a$w_buff1_used~0=~a$w_buff1_used~0_In451394266} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In451394266, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In451394266, ~a$w_buff0_used~0=~a$w_buff0_used~0_In451394266, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out451394266|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In451394266} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 05:24:39,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In171258570 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In171258570 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out171258570| ~a$r_buff0_thd2~0_In171258570) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out171258570| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In171258570, ~a$w_buff0_used~0=~a$w_buff0_used~0_In171258570} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In171258570, ~a$w_buff0_used~0=~a$w_buff0_used~0_In171258570, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out171258570|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 05:24:39,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1465834923 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1465834923 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1465834923 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-1465834923 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In-1465834923 |P1Thread1of1ForFork2_#t~ite14_Out-1465834923|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1465834923|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1465834923, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1465834923, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1465834923, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1465834923} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1465834923, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1465834923, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1465834923, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1465834923, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1465834923|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 05:24:39,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L780-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:24:39,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L839-1-->L845: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:24:39,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In2025689887 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In2025689887 256)))) (or (and (= ~a~0_In2025689887 |ULTIMATE.start_main_#t~ite47_Out2025689887|) (or .cse0 .cse1)) (and (not .cse1) (= ~a$w_buff1~0_In2025689887 |ULTIMATE.start_main_#t~ite47_Out2025689887|) (not .cse0)))) InVars {~a~0=~a~0_In2025689887, ~a$w_buff1~0=~a$w_buff1~0_In2025689887, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2025689887, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2025689887} OutVars{~a~0=~a~0_In2025689887, ~a$w_buff1~0=~a$w_buff1~0_In2025689887, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2025689887|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2025689887, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2025689887} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 05:24:39,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L845-4-->L846: Formula: (= v_~a~0_18 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 05:24:39,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1801076346 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1801076346 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1801076346| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out1801076346| ~a$w_buff0_used~0_In1801076346) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1801076346, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1801076346} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1801076346, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1801076346|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1801076346} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:24:39,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In2042432494 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In2042432494 256))) (.cse2 (= (mod ~a$r_buff0_thd0~0_In2042432494 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In2042432494 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out2042432494| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out2042432494| ~a$w_buff1_used~0_In2042432494)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2042432494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2042432494, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2042432494, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2042432494} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2042432494|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2042432494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2042432494, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2042432494, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2042432494} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:24:39,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-1998026265 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1998026265 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-1998026265| ~a$r_buff0_thd0~0_In-1998026265) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-1998026265| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1998026265, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1998026265} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1998026265|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1998026265, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1998026265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:24:39,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-1683622436 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-1683622436 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1683622436 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1683622436 256)))) (or (and (= ~a$r_buff1_thd0~0_In-1683622436 |ULTIMATE.start_main_#t~ite52_Out-1683622436|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1683622436|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1683622436, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1683622436, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1683622436, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1683622436} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1683622436|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1683622436, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1683622436, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1683622436, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1683622436} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:24:39,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= v_~x~0_10 2) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~__unbuffered_p2_EBX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_14| v_~a$r_buff1_thd0~0_15) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:24:39,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:24:39 BasicIcfg [2019-12-27 05:24:39,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:24:39,558 INFO L168 Benchmark]: Toolchain (without parser) took 121725.66 ms. Allocated memory was 147.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 103.4 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 572.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:39,559 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 147.8 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 05:24:39,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.17 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 103.0 MB in the beginning and 156.7 MB in the end (delta: -53.8 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:39,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.75 ms. Allocated memory is still 204.5 MB. Free memory was 156.7 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:39,560 INFO L168 Benchmark]: Boogie Preprocessor took 41.50 ms. Allocated memory is still 204.5 MB. Free memory was 154.2 MB in the beginning and 151.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:39,560 INFO L168 Benchmark]: RCFGBuilder took 982.21 ms. Allocated memory is still 204.5 MB. Free memory was 151.6 MB in the beginning and 101.4 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:39,561 INFO L168 Benchmark]: TraceAbstraction took 119867.92 ms. Allocated memory was 204.5 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.8 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 513.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:39,564 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41 ms. Allocated memory is still 147.8 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.17 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 103.0 MB in the beginning and 156.7 MB in the end (delta: -53.8 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.75 ms. Allocated memory is still 204.5 MB. Free memory was 156.7 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.50 ms. Allocated memory is still 204.5 MB. Free memory was 154.2 MB in the beginning and 151.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 982.21 ms. Allocated memory is still 204.5 MB. Free memory was 151.6 MB in the beginning and 101.4 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 119867.92 ms. Allocated memory was 204.5 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.8 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 513.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 178 ProgramPointsBefore, 96 ProgramPointsAfterwards, 215 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 7327 VarBasedMoverChecksPositive, 212 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 94688 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t293, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t294, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 2 x = 2 [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y [L773] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L839] FCALL, FORK 0 pthread_create(&t295, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=0] [L790] 3 z = 1 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=2, y=1, z=1] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L812] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L845] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 119.5s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 51.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5939 SDtfs, 6741 SDslu, 24771 SDs, 0 SdLazy, 29098 SolverSat, 443 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 39 SyntacticMatches, 20 SemanticMatches, 385 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4781 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167419occurred 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: 33.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 127355 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1240 NumberOfCodeBlocks, 1240 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1148 ConstructedInterpolants, 0 QuantifiedInterpolants, 273894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...