/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/safe021_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:46:53,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:46:53,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:46:53,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:46:53,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:46:53,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:46:53,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:46:53,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:46:53,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:46:53,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:46:53,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:46:53,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:46:53,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:46:53,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:46:53,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:46:53,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:46:53,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:46:53,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:46:53,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:46:53,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:46:53,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:46:53,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:46:53,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:46:53,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:46:53,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:46:53,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:46:53,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:46:53,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:46:53,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:46:53,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:46:53,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:46:53,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:46:53,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:46:53,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:46:53,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:46:53,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:46:53,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:46:53,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:46:53,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:46:53,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:46:53,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:46:53,649 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-18 22:46:53,683 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:46:53,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:46:53,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:46:53,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:46:53,685 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:46:53,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:46:53,685 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:46:53,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:46:53,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:46:53,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:46:53,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:46:53,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:46:53,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:46:53,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:46:53,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:46:53,691 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:46:53,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:46:53,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:46:53,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:46:53,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:46:53,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:46:53,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:46:53,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:46:53,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:46:53,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:46:53,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:46:53,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:46:53,694 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:46:53,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:46:53,694 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:46:53,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:46:54,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:46:54,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:46:54,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:46:54,012 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:46:54,012 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i [2019-12-18 22:46:54,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a613a1b5e/b1e5c6ab7c8946a58a05fcd30955d7d4/FLAGca7d84b22 [2019-12-18 22:46:54,666 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:46:54,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i [2019-12-18 22:46:54,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a613a1b5e/b1e5c6ab7c8946a58a05fcd30955d7d4/FLAGca7d84b22 [2019-12-18 22:46:54,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a613a1b5e/b1e5c6ab7c8946a58a05fcd30955d7d4 [2019-12-18 22:46:54,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:46:54,935 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:46:54,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:46:54,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:46:54,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:46:54,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:46:54" (1/1) ... [2019-12-18 22:46:54,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:46:54, skipping insertion in model container [2019-12-18 22:46:54,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:46:54" (1/1) ... [2019-12-18 22:46:54,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:46:55,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:46:55,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:46:55,609 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:46:55,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:46:55,748 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:46:55,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:46:55 WrapperNode [2019-12-18 22:46:55,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:46:55,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:46:55,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:46:55,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:46:55,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:46:55" (1/1) ... [2019-12-18 22:46:55,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:46:55" (1/1) ... [2019-12-18 22:46:55,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:46:55,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:46:55,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:46:55,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:46:55,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:46:55" (1/1) ... [2019-12-18 22:46:55,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:46:55" (1/1) ... [2019-12-18 22:46:55,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:46:55" (1/1) ... [2019-12-18 22:46:55,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:46:55" (1/1) ... [2019-12-18 22:46:55,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:46:55" (1/1) ... [2019-12-18 22:46:55,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:46:55" (1/1) ... [2019-12-18 22:46:55,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:46:55" (1/1) ... [2019-12-18 22:46:55,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:46:55,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:46:55,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:46:55,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:46:55,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:46:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:46:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:46:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:46:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:46:55,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:46:55,936 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:46:55,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:46:55,936 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:46:55,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:46:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:46:55,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:46:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:46:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:46:55,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:46:55,940 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:46:56,727 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:46:56,728 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:46:56,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:46:56 BoogieIcfgContainer [2019-12-18 22:46:56,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:46:56,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:46:56,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:46:56,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:46:56,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:46:54" (1/3) ... [2019-12-18 22:46:56,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131dba44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:46:56, skipping insertion in model container [2019-12-18 22:46:56,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:46:55" (2/3) ... [2019-12-18 22:46:56,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131dba44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:46:56, skipping insertion in model container [2019-12-18 22:46:56,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:46:56" (3/3) ... [2019-12-18 22:46:56,739 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_power.opt.i [2019-12-18 22:46:56,750 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:46:56,750 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:46:56,757 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:46:56,758 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:46:56,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,815 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,815 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,824 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,837 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,837 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,852 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,853 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,855 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,855 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,856 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,861 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,861 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:46:56,877 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:46:56,892 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:46:56,892 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:46:56,893 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:46:56,893 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:46:56,893 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:46:56,893 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:46:56,893 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:46:56,893 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:46:56,911 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 22:46:56,913 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 22:46:57,016 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 22:46:57,016 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:46:57,040 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:46:57,067 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 22:46:57,156 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 22:46:57,157 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:46:57,165 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:46:57,184 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 22:46:57,185 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:47:00,414 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-12-18 22:47:00,525 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-18 22:47:00,686 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 22:47:00,805 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 22:47:00,830 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91912 [2019-12-18 22:47:00,831 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 22:47:00,835 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 101 transitions [2019-12-18 22:47:18,371 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115110 states. [2019-12-18 22:47:18,373 INFO L276 IsEmpty]: Start isEmpty. Operand 115110 states. [2019-12-18 22:47:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:47:18,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:47:18,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:47:18,383 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:47:18,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:47:18,388 INFO L82 PathProgramCache]: Analyzing trace with hash 815308427, now seen corresponding path program 1 times [2019-12-18 22:47:18,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:47:18,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994405885] [2019-12-18 22:47:18,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:47:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:47:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:47:18,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994405885] [2019-12-18 22:47:18,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:47:18,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:47:18,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085739000] [2019-12-18 22:47:18,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:47:18,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:47:18,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:47:18,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:47:18,642 INFO L87 Difference]: Start difference. First operand 115110 states. Second operand 3 states. [2019-12-18 22:47:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:47:22,029 INFO L93 Difference]: Finished difference Result 114720 states and 487546 transitions. [2019-12-18 22:47:22,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:47:22,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:47:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:47:22,770 INFO L225 Difference]: With dead ends: 114720 [2019-12-18 22:47:22,770 INFO L226 Difference]: Without dead ends: 112172 [2019-12-18 22:47:22,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:47:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112172 states. [2019-12-18 22:47:31,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112172 to 112172. [2019-12-18 22:47:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112172 states. [2019-12-18 22:47:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112172 states to 112172 states and 477158 transitions. [2019-12-18 22:47:34,815 INFO L78 Accepts]: Start accepts. Automaton has 112172 states and 477158 transitions. Word has length 5 [2019-12-18 22:47:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:47:34,816 INFO L462 AbstractCegarLoop]: Abstraction has 112172 states and 477158 transitions. [2019-12-18 22:47:34,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:47:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 112172 states and 477158 transitions. [2019-12-18 22:47:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:47:34,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:47:34,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:47:34,820 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:47:34,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:47:34,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1970067083, now seen corresponding path program 1 times [2019-12-18 22:47:34,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:47:34,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924355182] [2019-12-18 22:47:34,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:47:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:47:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:47:34,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924355182] [2019-12-18 22:47:34,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:47:34,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:47:34,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721823735] [2019-12-18 22:47:34,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:47:34,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:47:34,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:47:34,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:47:34,914 INFO L87 Difference]: Start difference. First operand 112172 states and 477158 transitions. Second operand 4 states. [2019-12-18 22:47:40,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:47:40,203 INFO L93 Difference]: Finished difference Result 175422 states and 718454 transitions. [2019-12-18 22:47:40,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:47:40,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:47:40,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:47:40,781 INFO L225 Difference]: With dead ends: 175422 [2019-12-18 22:47:40,781 INFO L226 Difference]: Without dead ends: 175373 [2019-12-18 22:47:40,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:47:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175373 states. [2019-12-18 22:47:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175373 to 159145. [2019-12-18 22:47:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159145 states. [2019-12-18 22:47:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159145 states to 159145 states and 659586 transitions. [2019-12-18 22:47:49,909 INFO L78 Accepts]: Start accepts. Automaton has 159145 states and 659586 transitions. Word has length 11 [2019-12-18 22:47:49,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:47:49,909 INFO L462 AbstractCegarLoop]: Abstraction has 159145 states and 659586 transitions. [2019-12-18 22:47:49,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:47:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 159145 states and 659586 transitions. [2019-12-18 22:47:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:47:49,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:47:49,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:47:49,917 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:47:49,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:47:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash -590582251, now seen corresponding path program 1 times [2019-12-18 22:47:49,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:47:49,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032543259] [2019-12-18 22:47:49,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:47:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:47:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:47:50,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032543259] [2019-12-18 22:47:50,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:47:50,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:47:50,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666429147] [2019-12-18 22:47:50,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:47:50,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:47:50,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:47:50,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:47:50,042 INFO L87 Difference]: Start difference. First operand 159145 states and 659586 transitions. Second operand 4 states. [2019-12-18 22:47:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:47:56,687 INFO L93 Difference]: Finished difference Result 228110 states and 923913 transitions. [2019-12-18 22:47:56,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:47:56,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:47:56,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:47:57,562 INFO L225 Difference]: With dead ends: 228110 [2019-12-18 22:47:57,562 INFO L226 Difference]: Without dead ends: 228047 [2019-12-18 22:47:57,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:03,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228047 states. [2019-12-18 22:48:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228047 to 192443. [2019-12-18 22:48:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192443 states. [2019-12-18 22:48:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192443 states to 192443 states and 792052 transitions. [2019-12-18 22:48:18,199 INFO L78 Accepts]: Start accepts. Automaton has 192443 states and 792052 transitions. Word has length 13 [2019-12-18 22:48:18,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:18,200 INFO L462 AbstractCegarLoop]: Abstraction has 192443 states and 792052 transitions. [2019-12-18 22:48:18,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:48:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 192443 states and 792052 transitions. [2019-12-18 22:48:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:48:18,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:18,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:18,204 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:18,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:18,205 INFO L82 PathProgramCache]: Analyzing trace with hash 339341104, now seen corresponding path program 1 times [2019-12-18 22:48:18,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:18,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780120348] [2019-12-18 22:48:18,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:18,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780120348] [2019-12-18 22:48:18,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:18,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:48:18,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282184181] [2019-12-18 22:48:18,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:18,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:18,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:18,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:18,289 INFO L87 Difference]: Start difference. First operand 192443 states and 792052 transitions. Second operand 3 states. [2019-12-18 22:48:18,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:18,422 INFO L93 Difference]: Finished difference Result 37880 states and 121975 transitions. [2019-12-18 22:48:18,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:18,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:48:18,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:18,514 INFO L225 Difference]: With dead ends: 37880 [2019-12-18 22:48:18,514 INFO L226 Difference]: Without dead ends: 37880 [2019-12-18 22:48:18,515 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-18 22:48:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37880 states. [2019-12-18 22:48:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37880 to 37880. [2019-12-18 22:48:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37880 states. [2019-12-18 22:48:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37880 states to 37880 states and 121975 transitions. [2019-12-18 22:48:19,191 INFO L78 Accepts]: Start accepts. Automaton has 37880 states and 121975 transitions. Word has length 13 [2019-12-18 22:48:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:19,192 INFO L462 AbstractCegarLoop]: Abstraction has 37880 states and 121975 transitions. [2019-12-18 22:48:19,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 37880 states and 121975 transitions. [2019-12-18 22:48:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:48:19,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:19,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] [2019-12-18 22:48:19,196 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:19,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:19,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1793457831, now seen corresponding path program 1 times [2019-12-18 22:48:19,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:19,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920456108] [2019-12-18 22:48:19,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:19,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920456108] [2019-12-18 22:48:19,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:19,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:48:19,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571425378] [2019-12-18 22:48:19,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:48:19,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:19,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:48:19,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:19,295 INFO L87 Difference]: Start difference. First operand 37880 states and 121975 transitions. Second operand 5 states. [2019-12-18 22:48:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:20,051 INFO L93 Difference]: Finished difference Result 51102 states and 161291 transitions. [2019-12-18 22:48:20,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:48:20,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 22:48:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:20,130 INFO L225 Difference]: With dead ends: 51102 [2019-12-18 22:48:20,130 INFO L226 Difference]: Without dead ends: 51089 [2019-12-18 22:48:20,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:48:22,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51089 states. [2019-12-18 22:48:22,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51089 to 38340. [2019-12-18 22:48:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38340 states. [2019-12-18 22:48:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38340 states to 38340 states and 123285 transitions. [2019-12-18 22:48:22,578 INFO L78 Accepts]: Start accepts. Automaton has 38340 states and 123285 transitions. Word has length 19 [2019-12-18 22:48:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:22,579 INFO L462 AbstractCegarLoop]: Abstraction has 38340 states and 123285 transitions. [2019-12-18 22:48:22,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:48:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 38340 states and 123285 transitions. [2019-12-18 22:48:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:48:22,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:22,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:22,593 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:22,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1227724886, now seen corresponding path program 1 times [2019-12-18 22:48:22,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:22,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105350772] [2019-12-18 22:48:22,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:22,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105350772] [2019-12-18 22:48:22,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:22,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:48:22,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934406651] [2019-12-18 22:48:22,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:48:22,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:22,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:48:22,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:48:22,665 INFO L87 Difference]: Start difference. First operand 38340 states and 123285 transitions. Second operand 4 states. [2019-12-18 22:48:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:22,706 INFO L93 Difference]: Finished difference Result 7755 states and 21286 transitions. [2019-12-18 22:48:22,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:48:22,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:48:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:22,719 INFO L225 Difference]: With dead ends: 7755 [2019-12-18 22:48:22,719 INFO L226 Difference]: Without dead ends: 7755 [2019-12-18 22:48:22,720 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-18 22:48:22,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2019-12-18 22:48:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 7615. [2019-12-18 22:48:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7615 states. [2019-12-18 22:48:22,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7615 states to 7615 states and 20886 transitions. [2019-12-18 22:48:22,840 INFO L78 Accepts]: Start accepts. Automaton has 7615 states and 20886 transitions. Word has length 25 [2019-12-18 22:48:22,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:22,840 INFO L462 AbstractCegarLoop]: Abstraction has 7615 states and 20886 transitions. [2019-12-18 22:48:22,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:48:22,840 INFO L276 IsEmpty]: Start isEmpty. Operand 7615 states and 20886 transitions. [2019-12-18 22:48:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 22:48:22,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:22,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:22,852 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:22,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:22,853 INFO L82 PathProgramCache]: Analyzing trace with hash 287382448, now seen corresponding path program 1 times [2019-12-18 22:48:22,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:22,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031865946] [2019-12-18 22:48:22,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:22,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031865946] [2019-12-18 22:48:22,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:22,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:48:22,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103962847] [2019-12-18 22:48:22,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:48:22,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:22,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:48:22,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:22,967 INFO L87 Difference]: Start difference. First operand 7615 states and 20886 transitions. Second operand 5 states. [2019-12-18 22:48:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:23,011 INFO L93 Difference]: Finished difference Result 5711 states and 16438 transitions. [2019-12-18 22:48:23,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:48:23,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 22:48:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:23,021 INFO L225 Difference]: With dead ends: 5711 [2019-12-18 22:48:23,021 INFO L226 Difference]: Without dead ends: 5711 [2019-12-18 22:48:23,021 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-18 22:48:23,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2019-12-18 22:48:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 5298. [2019-12-18 22:48:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5298 states. [2019-12-18 22:48:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 15321 transitions. [2019-12-18 22:48:23,111 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 15321 transitions. Word has length 37 [2019-12-18 22:48:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:23,112 INFO L462 AbstractCegarLoop]: Abstraction has 5298 states and 15321 transitions. [2019-12-18 22:48:23,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:48:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 15321 transitions. [2019-12-18 22:48:23,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:23,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:23,120 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-18 22:48:23,120 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:23,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:23,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2078347018, now seen corresponding path program 1 times [2019-12-18 22:48:23,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:23,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266961551] [2019-12-18 22:48:23,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:23,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266961551] [2019-12-18 22:48:23,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:23,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:48:23,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998964200] [2019-12-18 22:48:23,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:23,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:23,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:23,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:23,197 INFO L87 Difference]: Start difference. First operand 5298 states and 15321 transitions. Second operand 3 states. [2019-12-18 22:48:23,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:23,254 INFO L93 Difference]: Finished difference Result 5309 states and 15335 transitions. [2019-12-18 22:48:23,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:23,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:48:23,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:23,264 INFO L225 Difference]: With dead ends: 5309 [2019-12-18 22:48:23,264 INFO L226 Difference]: Without dead ends: 5309 [2019-12-18 22:48:23,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2019-12-18 22:48:23,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5303. [2019-12-18 22:48:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5303 states. [2019-12-18 22:48:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 15329 transitions. [2019-12-18 22:48:23,363 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 15329 transitions. Word has length 65 [2019-12-18 22:48:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:23,364 INFO L462 AbstractCegarLoop]: Abstraction has 5303 states and 15329 transitions. [2019-12-18 22:48:23,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 15329 transitions. [2019-12-18 22:48:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:23,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:23,373 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-18 22:48:23,374 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:23,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:23,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1997644654, now seen corresponding path program 1 times [2019-12-18 22:48:23,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:23,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272274783] [2019-12-18 22:48:23,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:23,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272274783] [2019-12-18 22:48:23,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:23,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:48:23,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737609645] [2019-12-18 22:48:23,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:48:23,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:23,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:48:23,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:23,475 INFO L87 Difference]: Start difference. First operand 5303 states and 15329 transitions. Second operand 5 states. [2019-12-18 22:48:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:23,796 INFO L93 Difference]: Finished difference Result 8167 states and 23253 transitions. [2019-12-18 22:48:23,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:48:23,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:48:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:23,807 INFO L225 Difference]: With dead ends: 8167 [2019-12-18 22:48:23,807 INFO L226 Difference]: Without dead ends: 8167 [2019-12-18 22:48:23,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:23,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8167 states. [2019-12-18 22:48:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8167 to 6045. [2019-12-18 22:48:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6045 states. [2019-12-18 22:48:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6045 states to 6045 states and 17499 transitions. [2019-12-18 22:48:23,899 INFO L78 Accepts]: Start accepts. Automaton has 6045 states and 17499 transitions. Word has length 65 [2019-12-18 22:48:23,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:23,900 INFO L462 AbstractCegarLoop]: Abstraction has 6045 states and 17499 transitions. [2019-12-18 22:48:23,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:48:23,900 INFO L276 IsEmpty]: Start isEmpty. Operand 6045 states and 17499 transitions. [2019-12-18 22:48:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:23,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:23,908 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-18 22:48:23,908 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:23,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:23,909 INFO L82 PathProgramCache]: Analyzing trace with hash 37838908, now seen corresponding path program 2 times [2019-12-18 22:48:23,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:23,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049745885] [2019-12-18 22:48:23,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:24,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049745885] [2019-12-18 22:48:24,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:24,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:48:24,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227230927] [2019-12-18 22:48:24,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:48:24,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:24,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:48:24,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:48:24,725 INFO L87 Difference]: Start difference. First operand 6045 states and 17499 transitions. Second operand 6 states. [2019-12-18 22:48:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:25,210 INFO L93 Difference]: Finished difference Result 10241 states and 29401 transitions. [2019-12-18 22:48:25,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:48:25,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:48:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:25,222 INFO L225 Difference]: With dead ends: 10241 [2019-12-18 22:48:25,222 INFO L226 Difference]: Without dead ends: 10241 [2019-12-18 22:48:25,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:48:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10241 states. [2019-12-18 22:48:25,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10241 to 6610. [2019-12-18 22:48:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6610 states. [2019-12-18 22:48:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6610 states to 6610 states and 19175 transitions. [2019-12-18 22:48:25,337 INFO L78 Accepts]: Start accepts. Automaton has 6610 states and 19175 transitions. Word has length 65 [2019-12-18 22:48:25,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:25,337 INFO L462 AbstractCegarLoop]: Abstraction has 6610 states and 19175 transitions. [2019-12-18 22:48:25,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:48:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 6610 states and 19175 transitions. [2019-12-18 22:48:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:25,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:25,346 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-18 22:48:25,347 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:25,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:25,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1555359410, now seen corresponding path program 3 times [2019-12-18 22:48:25,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:25,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844441557] [2019-12-18 22:48:25,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:25,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844441557] [2019-12-18 22:48:25,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:25,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:48:25,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685734796] [2019-12-18 22:48:25,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:48:25,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:25,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:48:25,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:48:25,470 INFO L87 Difference]: Start difference. First operand 6610 states and 19175 transitions. Second operand 6 states. [2019-12-18 22:48:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:25,937 INFO L93 Difference]: Finished difference Result 8985 states and 25387 transitions. [2019-12-18 22:48:25,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:48:25,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:48:25,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:25,949 INFO L225 Difference]: With dead ends: 8985 [2019-12-18 22:48:25,949 INFO L226 Difference]: Without dead ends: 8985 [2019-12-18 22:48:25,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:48:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8985 states. [2019-12-18 22:48:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8985 to 7187. [2019-12-18 22:48:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7187 states. [2019-12-18 22:48:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7187 states to 7187 states and 20529 transitions. [2019-12-18 22:48:26,058 INFO L78 Accepts]: Start accepts. Automaton has 7187 states and 20529 transitions. Word has length 65 [2019-12-18 22:48:26,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:26,059 INFO L462 AbstractCegarLoop]: Abstraction has 7187 states and 20529 transitions. [2019-12-18 22:48:26,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:48:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 7187 states and 20529 transitions. [2019-12-18 22:48:26,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:26,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:26,068 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-18 22:48:26,068 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:26,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:26,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1213629052, now seen corresponding path program 4 times [2019-12-18 22:48:26,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:26,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681346900] [2019-12-18 22:48:26,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:26,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681346900] [2019-12-18 22:48:26,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:26,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:48:26,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208499567] [2019-12-18 22:48:26,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:26,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:26,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:26,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:26,149 INFO L87 Difference]: Start difference. First operand 7187 states and 20529 transitions. Second operand 3 states. [2019-12-18 22:48:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:26,185 INFO L93 Difference]: Finished difference Result 6334 states and 17863 transitions. [2019-12-18 22:48:26,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:26,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:48:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:26,195 INFO L225 Difference]: With dead ends: 6334 [2019-12-18 22:48:26,195 INFO L226 Difference]: Without dead ends: 6334 [2019-12-18 22:48:26,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6334 states. [2019-12-18 22:48:26,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6334 to 6166. [2019-12-18 22:48:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6166 states. [2019-12-18 22:48:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6166 states to 6166 states and 17397 transitions. [2019-12-18 22:48:26,312 INFO L78 Accepts]: Start accepts. Automaton has 6166 states and 17397 transitions. Word has length 65 [2019-12-18 22:48:26,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:26,312 INFO L462 AbstractCegarLoop]: Abstraction has 6166 states and 17397 transitions. [2019-12-18 22:48:26,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 6166 states and 17397 transitions. [2019-12-18 22:48:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:48:26,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:26,326 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-18 22:48:26,326 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:26,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash 890066617, now seen corresponding path program 1 times [2019-12-18 22:48:26,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:26,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368549215] [2019-12-18 22:48:26,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:26,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368549215] [2019-12-18 22:48:26,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:26,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:48:26,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012213751] [2019-12-18 22:48:26,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:48:26,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:26,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:48:26,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:48:26,441 INFO L87 Difference]: Start difference. First operand 6166 states and 17397 transitions. Second operand 6 states. [2019-12-18 22:48:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:26,860 INFO L93 Difference]: Finished difference Result 8317 states and 23206 transitions. [2019-12-18 22:48:26,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:48:26,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 22:48:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:26,874 INFO L225 Difference]: With dead ends: 8317 [2019-12-18 22:48:26,875 INFO L226 Difference]: Without dead ends: 8317 [2019-12-18 22:48:26,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:48:26,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8317 states. [2019-12-18 22:48:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8317 to 6558. [2019-12-18 22:48:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6558 states. [2019-12-18 22:48:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6558 states to 6558 states and 18489 transitions. [2019-12-18 22:48:27,013 INFO L78 Accepts]: Start accepts. Automaton has 6558 states and 18489 transitions. Word has length 66 [2019-12-18 22:48:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:27,013 INFO L462 AbstractCegarLoop]: Abstraction has 6558 states and 18489 transitions. [2019-12-18 22:48:27,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:48:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 6558 states and 18489 transitions. [2019-12-18 22:48:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:48:27,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:27,023 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-18 22:48:27,023 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash 384398989, now seen corresponding path program 2 times [2019-12-18 22:48:27,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:27,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144965719] [2019-12-18 22:48:27,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:27,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144965719] [2019-12-18 22:48:27,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:27,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:48:27,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205470768] [2019-12-18 22:48:27,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:27,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:27,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:27,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:27,087 INFO L87 Difference]: Start difference. First operand 6558 states and 18489 transitions. Second operand 3 states. [2019-12-18 22:48:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:27,140 INFO L93 Difference]: Finished difference Result 6558 states and 18488 transitions. [2019-12-18 22:48:27,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:27,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 22:48:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:27,149 INFO L225 Difference]: With dead ends: 6558 [2019-12-18 22:48:27,149 INFO L226 Difference]: Without dead ends: 6558 [2019-12-18 22:48:27,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2019-12-18 22:48:27,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 4171. [2019-12-18 22:48:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4171 states. [2019-12-18 22:48:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 11906 transitions. [2019-12-18 22:48:27,219 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 11906 transitions. Word has length 66 [2019-12-18 22:48:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:27,219 INFO L462 AbstractCegarLoop]: Abstraction has 4171 states and 11906 transitions. [2019-12-18 22:48:27,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 11906 transitions. [2019-12-18 22:48:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:48:27,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:27,225 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-18 22:48:27,226 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:27,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:27,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1991477327, now seen corresponding path program 1 times [2019-12-18 22:48:27,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:27,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894103750] [2019-12-18 22:48:27,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:27,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894103750] [2019-12-18 22:48:27,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:27,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:48:27,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124677492] [2019-12-18 22:48:27,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:48:27,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:27,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:48:27,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:27,371 INFO L87 Difference]: Start difference. First operand 4171 states and 11906 transitions. Second operand 7 states. [2019-12-18 22:48:27,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:27,495 INFO L93 Difference]: Finished difference Result 7832 states and 22397 transitions. [2019-12-18 22:48:27,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:48:27,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-18 22:48:27,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:27,501 INFO L225 Difference]: With dead ends: 7832 [2019-12-18 22:48:27,501 INFO L226 Difference]: Without dead ends: 3847 [2019-12-18 22:48:27,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:48:27,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3847 states. [2019-12-18 22:48:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3847 to 3241. [2019-12-18 22:48:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2019-12-18 22:48:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 9242 transitions. [2019-12-18 22:48:27,548 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 9242 transitions. Word has length 67 [2019-12-18 22:48:27,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:27,549 INFO L462 AbstractCegarLoop]: Abstraction has 3241 states and 9242 transitions. [2019-12-18 22:48:27,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:48:27,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 9242 transitions. [2019-12-18 22:48:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:48:27,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:27,553 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-18 22:48:27,553 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:27,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:27,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1052432089, now seen corresponding path program 2 times [2019-12-18 22:48:27,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:27,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318710662] [2019-12-18 22:48:27,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:27,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318710662] [2019-12-18 22:48:27,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:27,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:48:27,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290153498] [2019-12-18 22:48:27,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:27,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:27,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:27,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:27,623 INFO L87 Difference]: Start difference. First operand 3241 states and 9242 transitions. Second operand 3 states. [2019-12-18 22:48:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:27,646 INFO L93 Difference]: Finished difference Result 2932 states and 8177 transitions. [2019-12-18 22:48:27,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:27,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 22:48:27,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:27,650 INFO L225 Difference]: With dead ends: 2932 [2019-12-18 22:48:27,650 INFO L226 Difference]: Without dead ends: 2932 [2019-12-18 22:48:27,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2019-12-18 22:48:27,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2818. [2019-12-18 22:48:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2019-12-18 22:48:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 7858 transitions. [2019-12-18 22:48:28,995 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 7858 transitions. Word has length 67 [2019-12-18 22:48:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:28,995 INFO L462 AbstractCegarLoop]: Abstraction has 2818 states and 7858 transitions. [2019-12-18 22:48:28,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 7858 transitions. [2019-12-18 22:48:28,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:48:28,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:28,999 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, 1] [2019-12-18 22:48:29,000 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:29,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:29,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1034762219, now seen corresponding path program 1 times [2019-12-18 22:48:29,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:29,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109877097] [2019-12-18 22:48:29,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:48:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:48:29,142 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:48:29,142 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:48:29,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 |v_ULTIMATE.start_main_~#t2284~0.offset_18|) (= 0 v_~x$r_buff0_thd0~0_84) (= v_~__unbuffered_p2_EBX~0_10 0) (= 0 v_~x$w_buff1~0_25) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~x$r_buff0_thd3~0_22) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2284~0.base_24| 4)) (= |v_#NULL.offset_3| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2284~0.base_24|) (= 0 v_~x$r_buff0_thd1~0_22) (= v_~x$flush_delayed~0_16 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$w_buff0~0_26) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~x~0_29 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2284~0.base_24| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2284~0.base_24|) |v_ULTIMATE.start_main_~#t2284~0.offset_18| 0)) |v_#memory_int_19|) (= 0 v_~weak$$choice2~0_36) (= v_~y~0_12 0) (= 0 v_~x$r_buff0_thd2~0_30) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~x$r_buff1_thd1~0_20 0) (= v_~x$mem_tmp~0_10 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t2284~0.base_24| 1)) (= v_~x$w_buff1_used~0_72 0) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~z~0_9) (= 0 v_~x$w_buff0_used~0_118) (= v_~x$r_buff1_thd0~0_54 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2284~0.base_24|) 0) (= v_~x$r_buff1_thd3~0_20 0) (= v_~x$r_buff1_thd2~0_20 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_8|, ~x$w_buff0~0=v_~x$w_buff0~0_26, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_10|, ULTIMATE.start_main_~#t2286~0.base=|v_ULTIMATE.start_main_~#t2286~0.base_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_12|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_10|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t2284~0.offset=|v_ULTIMATE.start_main_~#t2284~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_12|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_29, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_8|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_10|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_~#t2285~0.offset=|v_ULTIMATE.start_main_~#t2285~0.offset_16|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_14|, ~y~0=v_~y~0_12, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_~#t2284~0.base=|v_ULTIMATE.start_main_~#t2284~0.base_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_54, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_12|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118, ULTIMATE.start_main_~#t2285~0.base=|v_ULTIMATE.start_main_~#t2285~0.base_20|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_36, ULTIMATE.start_main_~#t2286~0.offset=|v_ULTIMATE.start_main_~#t2286~0.offset_15|, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2286~0.base, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2284~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t2285~0.offset, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t2284~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2285~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t2286~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:48:29,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2285~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2285~0.base_11|) |v_ULTIMATE.start_main_~#t2285~0.offset_9| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2285~0.base_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2285~0.base_11| 4)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2285~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2285~0.offset_9|) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2285~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t2285~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2285~0.base=|v_ULTIMATE.start_main_~#t2285~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_3|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2285~0.offset=|v_ULTIMATE.start_main_~#t2285~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2285~0.base, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2285~0.offset] because there is no mapped edge [2019-12-18 22:48:29,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L809-1-->L811: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2286~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2286~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2286~0.base_11|) |v_ULTIMATE.start_main_~#t2286~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2286~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2286~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2286~0.base_11| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2286~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t2286~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2286~0.base=|v_ULTIMATE.start_main_~#t2286~0.base_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2286~0.offset=|v_ULTIMATE.start_main_~#t2286~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2286~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2286~0.offset] because there is no mapped edge [2019-12-18 22:48:29,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L4-->L764: Formula: (and (= ~x$r_buff1_thd2~0_Out-311557817 ~x$r_buff0_thd2~0_In-311557817) (= ~x$r_buff0_thd1~0_In-311557817 ~x$r_buff1_thd1~0_Out-311557817) (= ~x$r_buff0_thd3~0_In-311557817 ~x$r_buff1_thd3~0_Out-311557817) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-311557817)) (= 1 ~y~0_Out-311557817) (= 1 ~x$r_buff0_thd2~0_Out-311557817) (= ~x$r_buff1_thd0~0_Out-311557817 ~x$r_buff0_thd0~0_In-311557817)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-311557817, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-311557817, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-311557817, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-311557817, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-311557817} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-311557817, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-311557817, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-311557817, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out-311557817, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-311557817, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-311557817, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-311557817, ~y~0=~y~0_Out-311557817, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-311557817, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-311557817} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 22:48:29,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L784-2-->L784-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1696075634 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1696075634 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-1696075634| ~x$w_buff1~0_In-1696075634)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-1696075634| ~x~0_In-1696075634)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1696075634, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1696075634, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1696075634, ~x~0=~x~0_In-1696075634} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1696075634|, ~x$w_buff1~0=~x$w_buff1~0_In-1696075634, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1696075634, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1696075634, ~x~0=~x~0_In-1696075634} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 22:48:29,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L784-4-->L785: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_18) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 22:48:29,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-475723235 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-475723235 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-475723235| ~x$w_buff0_used~0_In-475723235)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-475723235| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-475723235, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-475723235} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-475723235, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-475723235|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-475723235} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:48:29,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L786-->L786-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1675041780 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1675041780 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1675041780 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1675041780 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out1675041780| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite18_Out1675041780| ~x$w_buff1_used~0_In1675041780) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1675041780, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1675041780, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1675041780, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1675041780} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1675041780, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1675041780, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1675041780, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1675041780|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1675041780} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 22:48:29,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L735-2-->L735-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1698663302 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1698663302 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out1698663302| ~x$w_buff1~0_In1698663302)) (and (= ~x~0_In1698663302 |P0Thread1of1ForFork0_#t~ite3_Out1698663302|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1698663302, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1698663302, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1698663302, ~x~0=~x~0_In1698663302} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1698663302|, ~x$w_buff1~0=~x$w_buff1~0_In1698663302, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1698663302, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1698663302, ~x~0=~x~0_In1698663302} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-18 22:48:29,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L735-4-->L736: Formula: (= v_~x~0_19 |v_P0Thread1of1ForFork0_#t~ite3_8|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_8|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_7|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-18 22:48:29,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-463671262 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-463671262 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-463671262| 0)) (and (= ~x$w_buff0_used~0_In-463671262 |P0Thread1of1ForFork0_#t~ite5_Out-463671262|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-463671262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-463671262} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-463671262|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-463671262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-463671262} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:48:29,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L737-->L737-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1795209375 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1795209375 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-1795209375 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1795209375 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1795209375 |P0Thread1of1ForFork0_#t~ite6_Out-1795209375|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1795209375|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1795209375, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1795209375, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1795209375, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1795209375} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1795209375|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1795209375, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1795209375, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1795209375, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1795209375} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:48:29,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-77184021 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-77184021 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out-77184021| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out-77184021| ~x$r_buff0_thd1~0_In-77184021) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-77184021, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-77184021} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-77184021, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-77184021|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-77184021} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 22:48:29,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1104809676 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1104809676 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-1104809676 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1104809676 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1104809676| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1104809676| ~x$r_buff1_thd1~0_In-1104809676) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1104809676, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1104809676, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1104809676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1104809676} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1104809676, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1104809676|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1104809676, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1104809676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1104809676} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:48:29,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 22:48:29,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In402033867 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In402033867 256) 0))) (or (and (= ~x$w_buff0_used~0_In402033867 |P1Thread1of1ForFork1_#t~ite11_Out402033867|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out402033867| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In402033867, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402033867} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out402033867|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In402033867, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402033867} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:48:29,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In236732506 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In236732506 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In236732506 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In236732506 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out236732506| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out236732506| ~x$w_buff1_used~0_In236732506)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In236732506, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In236732506, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In236732506, ~x$w_buff0_used~0=~x$w_buff0_used~0_In236732506} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In236732506, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In236732506, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out236732506|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In236732506, ~x$w_buff0_used~0=~x$w_buff0_used~0_In236732506} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:48:29,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L767-->L768: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1677827220 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1677827220 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1677827220)) (and (= ~x$r_buff0_thd2~0_In1677827220 ~x$r_buff0_thd2~0_Out1677827220) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1677827220, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1677827220} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1677827220|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1677827220, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1677827220} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:48:29,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In1577727033 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1577727033 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1577727033 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1577727033 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1577727033|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite14_Out1577727033| ~x$r_buff1_thd2~0_In1577727033)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1577727033, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1577727033, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1577727033, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1577727033} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1577727033, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1577727033, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1577727033, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1577727033|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1577727033} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:48:29,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:48:29,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In154841878 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In154841878 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In154841878 |P2Thread1of1ForFork2_#t~ite19_Out154841878|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out154841878|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In154841878, ~x$w_buff0_used~0=~x$w_buff0_used~0_In154841878} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In154841878, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out154841878|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In154841878} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 22:48:29,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L788-->L788-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1182895592 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1182895592 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1182895592 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1182895592 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out-1182895592| 0)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1182895592| ~x$r_buff1_thd3~0_In-1182895592) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1182895592, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1182895592, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1182895592, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1182895592} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1182895592|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1182895592, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1182895592, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1182895592, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1182895592} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 22:48:29,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L788-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_15) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_15, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 22:48:29,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:48:29,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L817-2-->L817-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-772937347 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite24_Out-772937347| |ULTIMATE.start_main_#t~ite25_Out-772937347|)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-772937347 256)))) (or (and .cse0 (= ~x~0_In-772937347 |ULTIMATE.start_main_#t~ite24_Out-772937347|) (or .cse1 .cse2)) (and (not .cse1) .cse0 (= |ULTIMATE.start_main_#t~ite24_Out-772937347| ~x$w_buff1~0_In-772937347) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-772937347, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-772937347, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-772937347, ~x~0=~x~0_In-772937347} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-772937347, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-772937347|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-772937347|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-772937347, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-772937347, ~x~0=~x~0_In-772937347} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 22:48:29,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In722729901 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In722729901 256)))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out722729901| ~x$w_buff0_used~0_In722729901) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite26_Out722729901|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In722729901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In722729901} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In722729901, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out722729901|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In722729901} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 22:48:29,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In734827679 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In734827679 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In734827679 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In734827679 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out734827679| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite27_Out734827679| ~x$w_buff1_used~0_In734827679)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In734827679, ~x$w_buff1_used~0=~x$w_buff1_used~0_In734827679, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In734827679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In734827679} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In734827679, ~x$w_buff1_used~0=~x$w_buff1_used~0_In734827679, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out734827679|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In734827679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In734827679} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 22:48:29,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In60496835 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In60496835 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out60496835|)) (and (= ~x$r_buff0_thd0~0_In60496835 |ULTIMATE.start_main_#t~ite28_Out60496835|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In60496835, ~x$w_buff0_used~0=~x$w_buff0_used~0_In60496835} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In60496835, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out60496835|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In60496835} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 22:48:29,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-324632752 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-324632752 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-324632752 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-324632752 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-324632752| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite29_Out-324632752| ~x$r_buff1_thd0~0_In-324632752) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-324632752, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-324632752, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-324632752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-324632752} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-324632752, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-324632752|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-324632752, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-324632752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-324632752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 22:48:29,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L832-->L832-8: Formula: (let ((.cse4 (= 0 (mod ~x$r_buff1_thd0~0_In-1837616162 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1837616162 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1837616162 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1837616162 256) 0)) (.cse5 (= |ULTIMATE.start_main_#t~ite45_Out-1837616162| |ULTIMATE.start_main_#t~ite44_Out-1837616162|)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1837616162 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_In-1837616162| |ULTIMATE.start_main_#t~ite43_Out-1837616162|) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1837616162| ~x$w_buff1_used~0_In-1837616162) (= |ULTIMATE.start_main_#t~ite44_Out-1837616162| |ULTIMATE.start_main_#t~ite44_In-1837616162|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1837616162| ~x$w_buff1_used~0_In-1837616162) (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4)) .cse0 .cse5))) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse4)) (= |ULTIMATE.start_main_#t~ite44_Out-1837616162| |ULTIMATE.start_main_#t~ite43_Out-1837616162|) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1837616162| 0) .cse0 (or .cse6 (not .cse3)) .cse5)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1837616162, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1837616162, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1837616162, ~weak$$choice2~0=~weak$$choice2~0_In-1837616162, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In-1837616162|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1837616162, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-1837616162|} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1837616162, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1837616162, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1837616162, ~weak$$choice2~0=~weak$$choice2~0_In-1837616162, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1837616162|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1837616162|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1837616162|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1837616162} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:48:29,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L833-->L834: Formula: (and (= v_~x$r_buff0_thd0~0_69 v_~x$r_buff0_thd0~0_70) (not (= 0 (mod v_~weak$$choice2~0_26 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_7|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 22:48:29,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L834-->L834-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-756917289 256) 0)) (.cse4 (= (mod ~x$r_buff1_thd0~0_In-756917289 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite50_Out-756917289| |ULTIMATE.start_main_#t~ite51_Out-756917289|)) (.cse2 (= (mod ~x$w_buff0_used~0_In-756917289 256) 0)) (.cse5 (= 0 (mod ~x$w_buff1_used~0_In-756917289 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-756917289 256)))) (or (and (or (and .cse0 .cse1 (or .cse2 (and .cse3 .cse4) (and .cse3 .cse5)) (= ~x$r_buff1_thd0~0_In-756917289 |ULTIMATE.start_main_#t~ite50_Out-756917289|)) (and (= ~x$r_buff1_thd0~0_In-756917289 |ULTIMATE.start_main_#t~ite51_Out-756917289|) (not .cse0) (= |ULTIMATE.start_main_#t~ite50_In-756917289| |ULTIMATE.start_main_#t~ite50_Out-756917289|))) (= |ULTIMATE.start_main_#t~ite49_In-756917289| |ULTIMATE.start_main_#t~ite49_Out-756917289|)) (let ((.cse6 (not .cse3))) (and .cse0 (or .cse6 (not .cse4)) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite50_Out-756917289| |ULTIMATE.start_main_#t~ite49_Out-756917289|) (= 0 |ULTIMATE.start_main_#t~ite49_Out-756917289|) (or (not .cse5) .cse6))))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In-756917289|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-756917289, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-756917289, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_In-756917289|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-756917289, ~weak$$choice2~0=~weak$$choice2~0_In-756917289, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-756917289} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-756917289|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-756917289, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-756917289|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-756917289, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-756917289|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-756917289, ~weak$$choice2~0=~weak$$choice2~0_In-756917289, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-756917289} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 22:48:29,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L836-->L839-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$mem_tmp~0_6 v_~x~0_24) (= (mod v_~main$tmp_guard1~0_5 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_5, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_5, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:48:29,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L839-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 22:48:29,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:48:29 BasicIcfg [2019-12-18 22:48:29,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:48:29,253 INFO L168 Benchmark]: Toolchain (without parser) took 94318.47 ms. Allocated memory was 146.8 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 102.7 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 304.4 MB. Max. memory is 7.1 GB. [2019-12-18 22:48:29,254 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 22:48:29,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.88 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 102.5 MB in the beginning and 156.7 MB in the end (delta: -54.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:48:29,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.34 ms. Allocated memory is still 205.0 MB. Free memory was 156.7 MB in the beginning and 153.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 22:48:29,256 INFO L168 Benchmark]: Boogie Preprocessor took 39.81 ms. Allocated memory is still 205.0 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:48:29,256 INFO L168 Benchmark]: RCFGBuilder took 872.31 ms. Allocated memory is still 205.0 MB. Free memory was 150.7 MB in the beginning and 100.7 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:48:29,257 INFO L168 Benchmark]: TraceAbstraction took 92519.78 ms. Allocated memory was 205.0 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.7 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 244.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:48:29,261 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.88 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 102.5 MB in the beginning and 156.7 MB in the end (delta: -54.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.34 ms. Allocated memory is still 205.0 MB. Free memory was 156.7 MB in the beginning and 153.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.81 ms. Allocated memory is still 205.0 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 872.31 ms. Allocated memory is still 205.0 MB. Free memory was 150.7 MB in the beginning and 100.7 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92519.78 ms. Allocated memory was 205.0 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.7 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 244.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 175 ProgramPointsBefore, 93 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 33 ChoiceCompositions, 5662 VarBasedMoverChecksPositive, 181 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 91912 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L809] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L749] 2 x$w_buff1 = x$w_buff0 [L750] 2 x$w_buff0 = 2 [L751] 2 x$w_buff1_used = x$w_buff0_used [L752] 2 x$w_buff0_used = (_Bool)1 [L811] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L784] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L786] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L817] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L818] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L819] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L820] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L821] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 x$flush_delayed = weak$$choice2 [L827] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 92.2s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2329 SDtfs, 1980 SDslu, 3467 SDs, 0 SdLazy, 2286 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 31 SyntacticMatches, 12 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192443occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 77725 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 782 NumberOfCodeBlocks, 782 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 698 ConstructedInterpolants, 0 QuantifiedInterpolants, 90774 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...