/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:06:09,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:06:09,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:06:09,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:06:09,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:06:09,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:06:09,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:06:09,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:06:09,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:06:09,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:06:09,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:06:09,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:06:09,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:06:09,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:06:09,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:06:09,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:06:09,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:06:09,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:06:09,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:06:09,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:06:09,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:06:09,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:06:09,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:06:09,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:06:09,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:06:09,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:06:09,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:06:09,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:06:09,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:06:09,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:06:09,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:06:09,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:06:09,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:06:09,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:06:09,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:06:09,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:06:09,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:06:09,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:06:09,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:06:09,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:06:09,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:06:09,806 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-MCR.epf [2019-12-27 22:06:09,840 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:06:09,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:06:09,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:06:09,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:06:09,846 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:06:09,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:06:09,846 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:06:09,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:06:09,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:06:09,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:06:09,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:06:09,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:06:09,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:06:09,848 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:06:09,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:06:09,850 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:06:09,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:06:09,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:06:09,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:06:09,851 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:06:09,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:06:09,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:06:09,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:06:09,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:06:09,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:06:09,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:06:09,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:06:09,853 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:06:09,853 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:06:09,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:06:09,853 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:06:09,854 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:06:10,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:06:10,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:06:10,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:06:10,183 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:06:10,184 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:06:10,185 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2019-12-27 22:06:10,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b428218a/4295787c012743b791e026a15182ce54/FLAG6167d869b [2019-12-27 22:06:10,803 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:06:10,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2019-12-27 22:06:10,818 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b428218a/4295787c012743b791e026a15182ce54/FLAG6167d869b [2019-12-27 22:06:11,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b428218a/4295787c012743b791e026a15182ce54 [2019-12-27 22:06:11,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:06:11,106 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:06:11,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:06:11,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:06:11,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:06:11,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:06:11" (1/1) ... [2019-12-27 22:06:11,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7c2a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:06:11, skipping insertion in model container [2019-12-27 22:06:11,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:06:11" (1/1) ... [2019-12-27 22:06:11,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:06:11,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:06:11,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:06:11,654 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:06:11,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:06:11,836 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:06:11,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:06:11 WrapperNode [2019-12-27 22:06:11,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:06:11,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:06:11,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:06:11,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:06:11,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:06:11" (1/1) ... [2019-12-27 22:06:11,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:06:11" (1/1) ... [2019-12-27 22:06:11,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:06:11,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:06:11,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:06:11,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:06:11,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:06:11" (1/1) ... [2019-12-27 22:06:11,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:06:11" (1/1) ... [2019-12-27 22:06:11,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:06:11" (1/1) ... [2019-12-27 22:06:11,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:06:11" (1/1) ... [2019-12-27 22:06:11,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:06:11" (1/1) ... [2019-12-27 22:06:11,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:06:11" (1/1) ... [2019-12-27 22:06:11,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:06:11" (1/1) ... [2019-12-27 22:06:11,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:06:11,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:06:11,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:06:11,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:06:11,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:06:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:06:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:06:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:06:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:06:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:06:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:06:12,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:06:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:06:12,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:06:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:06:12,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:06:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:06:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:06:12,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:06:12,040 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:06:12,836 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:06:12,836 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:06:12,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:06:12 BoogieIcfgContainer [2019-12-27 22:06:12,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:06:12,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:06:12,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:06:12,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:06:12,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:06:11" (1/3) ... [2019-12-27 22:06:12,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beb03c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:06:12, skipping insertion in model container [2019-12-27 22:06:12,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:06:11" (2/3) ... [2019-12-27 22:06:12,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beb03c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:06:12, skipping insertion in model container [2019-12-27 22:06:12,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:06:12" (3/3) ... [2019-12-27 22:06:12,848 INFO L109 eAbstractionObserver]: Analyzing ICFG safe001_pso.oepc.i [2019-12-27 22:06:12,859 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:06:12,859 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:06:12,867 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:06:12,868 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:06:12,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,935 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,935 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,935 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,942 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,942 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,953 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,954 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,961 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,962 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:06:12,977 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:06:12,993 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:06:12,993 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:06:12,993 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:06:12,993 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:06:12,994 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:06:12,994 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:06:12,994 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:06:12,994 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:06:13,012 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 22:06:13,014 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 22:06:13,121 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 22:06:13,121 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:06:13,139 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:06:13,162 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 22:06:13,237 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 22:06:13,237 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:06:13,247 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:06:13,270 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 22:06:13,271 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:06:16,335 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-27 22:06:16,580 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 22:06:16,708 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 22:06:16,735 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82010 [2019-12-27 22:06:16,735 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 22:06:16,739 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-27 22:06:36,931 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117808 states. [2019-12-27 22:06:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 117808 states. [2019-12-27 22:06:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:06:36,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:06:36,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:06:36,940 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-27 22:06:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:06:36,947 INFO L82 PathProgramCache]: Analyzing trace with hash 806008766, now seen corresponding path program 1 times [2019-12-27 22:06:36,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:06:36,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427650558] [2019-12-27 22:06:36,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:06:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:06:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:06:37,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427650558] [2019-12-27 22:06:37,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:06:37,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:06:37,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2106086559] [2019-12-27 22:06:37,234 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:06:37,240 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:06:37,255 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:06:37,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:06:37,260 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:06:37,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:06:37,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:06:37,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:06:37,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:06:37,279 INFO L87 Difference]: Start difference. First operand 117808 states. Second operand 3 states. [2019-12-27 22:06:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:06:41,196 INFO L93 Difference]: Finished difference Result 117244 states and 506404 transitions. [2019-12-27 22:06:41,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:06:41,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:06:41,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:06:41,984 INFO L225 Difference]: With dead ends: 117244 [2019-12-27 22:06:41,985 INFO L226 Difference]: Without dead ends: 114878 [2019-12-27 22:06:41,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:06:46,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114878 states. [2019-12-27 22:06:49,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114878 to 114878. [2019-12-27 22:06:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114878 states. [2019-12-27 22:06:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114878 states to 114878 states and 496758 transitions. [2019-12-27 22:06:49,537 INFO L78 Accepts]: Start accepts. Automaton has 114878 states and 496758 transitions. Word has length 5 [2019-12-27 22:06:49,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:06:49,538 INFO L462 AbstractCegarLoop]: Abstraction has 114878 states and 496758 transitions. [2019-12-27 22:06:49,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:06:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 114878 states and 496758 transitions. [2019-12-27 22:06:49,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:06:49,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:06:49,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:06:49,542 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-27 22:06:49,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:06:49,542 INFO L82 PathProgramCache]: Analyzing trace with hash 702926397, now seen corresponding path program 1 times [2019-12-27 22:06:49,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:06:49,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964226221] [2019-12-27 22:06:49,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:06:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:06:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:06:49,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964226221] [2019-12-27 22:06:49,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:06:49,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:06:49,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1466986544] [2019-12-27 22:06:49,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:06:49,634 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:06:49,642 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 22:06:49,643 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:06:49,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:06:49,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:06:49,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:06:49,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:06:49,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:06:49,648 INFO L87 Difference]: Start difference. First operand 114878 states and 496758 transitions. Second operand 4 states. [2019-12-27 22:06:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:06:55,033 INFO L93 Difference]: Finished difference Result 184188 states and 760222 transitions. [2019-12-27 22:06:55,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:06:55,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:06:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:06:56,363 INFO L225 Difference]: With dead ends: 184188 [2019-12-27 22:06:56,363 INFO L226 Difference]: Without dead ends: 184139 [2019-12-27 22:06:56,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:07:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184139 states. [2019-12-27 22:07:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184139 to 169203. [2019-12-27 22:07:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169203 states. [2019-12-27 22:07:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169203 states to 169203 states and 707190 transitions. [2019-12-27 22:07:13,902 INFO L78 Accepts]: Start accepts. Automaton has 169203 states and 707190 transitions. Word has length 11 [2019-12-27 22:07:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:07:13,902 INFO L462 AbstractCegarLoop]: Abstraction has 169203 states and 707190 transitions. [2019-12-27 22:07:13,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:07:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 169203 states and 707190 transitions. [2019-12-27 22:07:13,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:07:13,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:07:13,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:07:13,911 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-27 22:07:13,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:07:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash 702866747, now seen corresponding path program 1 times [2019-12-27 22:07:13,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:07:13,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9787119] [2019-12-27 22:07:13,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:07:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:07:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:07:13,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9787119] [2019-12-27 22:07:13,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:07:13,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:07:13,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1158335548] [2019-12-27 22:07:13,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:07:14,000 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:07:14,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:07:14,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:07:14,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:07:14,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:07:14,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:07:14,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:07:14,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:07:14,003 INFO L87 Difference]: Start difference. First operand 169203 states and 707190 transitions. Second operand 4 states. [2019-12-27 22:07:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:07:16,737 INFO L93 Difference]: Finished difference Result 240014 states and 977713 transitions. [2019-12-27 22:07:16,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:07:16,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:07:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:07:17,657 INFO L225 Difference]: With dead ends: 240014 [2019-12-27 22:07:17,657 INFO L226 Difference]: Without dead ends: 239951 [2019-12-27 22:07:17,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:07:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239951 states. [2019-12-27 22:07:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239951 to 203645. [2019-12-27 22:07:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203645 states. [2019-12-27 22:07:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203645 states to 203645 states and 844323 transitions. [2019-12-27 22:07:35,093 INFO L78 Accepts]: Start accepts. Automaton has 203645 states and 844323 transitions. Word has length 13 [2019-12-27 22:07:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:07:35,094 INFO L462 AbstractCegarLoop]: Abstraction has 203645 states and 844323 transitions. [2019-12-27 22:07:35,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:07:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 203645 states and 844323 transitions. [2019-12-27 22:07:35,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:07:35,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:07:35,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:07:35,097 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-27 22:07:35,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:07:35,097 INFO L82 PathProgramCache]: Analyzing trace with hash 464803757, now seen corresponding path program 1 times [2019-12-27 22:07:35,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:07:35,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8366398] [2019-12-27 22:07:35,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:07:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:07:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:07:35,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8366398] [2019-12-27 22:07:35,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:07:35,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:07:35,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [940644739] [2019-12-27 22:07:35,151 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:07:35,152 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:07:35,153 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:07:35,153 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:07:35,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:07:35,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:07:35,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:07:35,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:07:35,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:07:35,156 INFO L87 Difference]: Start difference. First operand 203645 states and 844323 transitions. Second operand 3 states. [2019-12-27 22:07:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:07:35,300 INFO L93 Difference]: Finished difference Result 39928 states and 130360 transitions. [2019-12-27 22:07:35,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:07:35,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:07:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:07:35,365 INFO L225 Difference]: With dead ends: 39928 [2019-12-27 22:07:35,365 INFO L226 Difference]: Without dead ends: 39928 [2019-12-27 22:07:35,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:07:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39928 states. [2019-12-27 22:07:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39928 to 39928. [2019-12-27 22:07:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39928 states. [2019-12-27 22:07:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39928 states to 39928 states and 130360 transitions. [2019-12-27 22:07:37,431 INFO L78 Accepts]: Start accepts. Automaton has 39928 states and 130360 transitions. Word has length 13 [2019-12-27 22:07:37,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:07:37,432 INFO L462 AbstractCegarLoop]: Abstraction has 39928 states and 130360 transitions. [2019-12-27 22:07:37,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:07:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 39928 states and 130360 transitions. [2019-12-27 22:07:37,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:07:37,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:07:37,435 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-27 22:07:37,435 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-27 22:07:37,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:07:37,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2009264966, now seen corresponding path program 1 times [2019-12-27 22:07:37,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:07:37,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863022291] [2019-12-27 22:07:37,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:07:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:07:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:07:37,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863022291] [2019-12-27 22:07:37,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:07:37,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:07:37,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1832668456] [2019-12-27 22:07:37,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:07:37,522 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:07:37,528 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 77 transitions. [2019-12-27 22:07:37,528 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:07:37,529 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:07:37,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:07:37,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:07:37,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:07:37,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:07:37,530 INFO L87 Difference]: Start difference. First operand 39928 states and 130360 transitions. Second operand 5 states. [2019-12-27 22:07:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:07:38,405 INFO L93 Difference]: Finished difference Result 53752 states and 171521 transitions. [2019-12-27 22:07:38,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:07:38,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:07:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:07:38,495 INFO L225 Difference]: With dead ends: 53752 [2019-12-27 22:07:38,495 INFO L226 Difference]: Without dead ends: 53739 [2019-12-27 22:07:38,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:07:38,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53739 states. [2019-12-27 22:07:42,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53739 to 40157. [2019-12-27 22:07:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40157 states. [2019-12-27 22:07:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40157 states to 40157 states and 130977 transitions. [2019-12-27 22:07:42,284 INFO L78 Accepts]: Start accepts. Automaton has 40157 states and 130977 transitions. Word has length 19 [2019-12-27 22:07:42,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:07:42,285 INFO L462 AbstractCegarLoop]: Abstraction has 40157 states and 130977 transitions. [2019-12-27 22:07:42,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:07:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 40157 states and 130977 transitions. [2019-12-27 22:07:42,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:07:42,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:07:42,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:07:42,300 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-27 22:07:42,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:07:42,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1059595659, now seen corresponding path program 1 times [2019-12-27 22:07:42,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:07:42,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35751767] [2019-12-27 22:07:42,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:07:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:07:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:07:42,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35751767] [2019-12-27 22:07:42,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:07:42,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:07:42,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [536822077] [2019-12-27 22:07:42,372 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:07:42,376 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:07:42,390 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 121 transitions. [2019-12-27 22:07:42,390 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:07:42,479 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:07:42,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:07:42,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:07:42,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:07:42,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:07:42,481 INFO L87 Difference]: Start difference. First operand 40157 states and 130977 transitions. Second operand 6 states. [2019-12-27 22:07:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:07:42,546 INFO L93 Difference]: Finished difference Result 7224 states and 19739 transitions. [2019-12-27 22:07:42,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:07:42,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 22:07:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:07:42,558 INFO L225 Difference]: With dead ends: 7224 [2019-12-27 22:07:42,558 INFO L226 Difference]: Without dead ends: 7224 [2019-12-27 22:07:42,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:07:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2019-12-27 22:07:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7112. [2019-12-27 22:07:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7112 states. [2019-12-27 22:07:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7112 states to 7112 states and 19419 transitions. [2019-12-27 22:07:42,677 INFO L78 Accepts]: Start accepts. Automaton has 7112 states and 19419 transitions. Word has length 25 [2019-12-27 22:07:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:07:42,677 INFO L462 AbstractCegarLoop]: Abstraction has 7112 states and 19419 transitions. [2019-12-27 22:07:42,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:07:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7112 states and 19419 transitions. [2019-12-27 22:07:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:07:42,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:07:42,688 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-27 22:07:42,688 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-27 22:07:42,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:07:42,689 INFO L82 PathProgramCache]: Analyzing trace with hash -81356198, now seen corresponding path program 1 times [2019-12-27 22:07:42,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:07:42,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136303259] [2019-12-27 22:07:42,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:07:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:07:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:07:42,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136303259] [2019-12-27 22:07:42,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:07:42,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:07:42,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [649364993] [2019-12-27 22:07:42,807 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:07:42,815 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:07:42,844 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 125 transitions. [2019-12-27 22:07:42,845 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:07:42,846 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:07:42,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:07:42,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:07:42,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:07:42,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:07:42,847 INFO L87 Difference]: Start difference. First operand 7112 states and 19419 transitions. Second operand 5 states. [2019-12-27 22:07:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:07:42,886 INFO L93 Difference]: Finished difference Result 5025 states and 14423 transitions. [2019-12-27 22:07:42,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:07:42,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 22:07:42,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:07:42,893 INFO L225 Difference]: With dead ends: 5025 [2019-12-27 22:07:42,894 INFO L226 Difference]: Without dead ends: 5025 [2019-12-27 22:07:42,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:07:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-27 22:07:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-27 22:07:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-27 22:07:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13439 transitions. [2019-12-27 22:07:42,960 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13439 transitions. Word has length 37 [2019-12-27 22:07:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:07:42,960 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13439 transitions. [2019-12-27 22:07:42,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:07:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13439 transitions. [2019-12-27 22:07:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:07:42,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:07:42,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:07:42,969 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-27 22:07:42,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:07:42,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2136434843, now seen corresponding path program 1 times [2019-12-27 22:07:42,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:07:42,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126256939] [2019-12-27 22:07:42,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:07:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:07:43,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-27 22:07:43,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126256939] [2019-12-27 22:07:43,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:07:43,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:07:43,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [527672694] [2019-12-27 22:07:43,086 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:07:43,108 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:07:43,268 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 285 transitions. [2019-12-27 22:07:43,268 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:07:43,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:07:43,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:07:43,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:07:43,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:07:43,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:07:43,270 INFO L87 Difference]: Start difference. First operand 4661 states and 13439 transitions. Second operand 3 states. [2019-12-27 22:07:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:07:43,343 INFO L93 Difference]: Finished difference Result 4670 states and 13453 transitions. [2019-12-27 22:07:43,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:07:43,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:07:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:07:43,351 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 22:07:43,351 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 22:07:43,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:07:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 22:07:43,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 22:07:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 22:07:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13449 transitions. [2019-12-27 22:07:43,444 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13449 transitions. Word has length 65 [2019-12-27 22:07:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:07:43,444 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13449 transitions. [2019-12-27 22:07:43,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:07:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13449 transitions. [2019-12-27 22:07:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:07:43,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:07:43,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:07:43,454 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-27 22:07:43,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:07:43,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1287100776, now seen corresponding path program 1 times [2019-12-27 22:07:43,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:07:43,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158663186] [2019-12-27 22:07:43,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:07:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:07:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:07:43,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158663186] [2019-12-27 22:07:43,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:07:43,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:07:43,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [611905716] [2019-12-27 22:07:43,536 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:07:43,558 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:07:43,697 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 285 transitions. [2019-12-27 22:07:43,698 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:07:43,699 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:07:43,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:07:43,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:07:43,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:07:43,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:07:43,700 INFO L87 Difference]: Start difference. First operand 4666 states and 13449 transitions. Second operand 3 states. [2019-12-27 22:07:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:07:43,926 INFO L93 Difference]: Finished difference Result 4670 states and 13443 transitions. [2019-12-27 22:07:43,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:07:43,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:07:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:07:43,933 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 22:07:43,933 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 22:07:43,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:07:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 22:07:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 22:07:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 22:07:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13439 transitions. [2019-12-27 22:07:44,007 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13439 transitions. Word has length 65 [2019-12-27 22:07:44,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:07:44,008 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13439 transitions. [2019-12-27 22:07:44,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:07:44,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13439 transitions. [2019-12-27 22:07:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:07:44,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:07:44,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:07:44,015 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-27 22:07:44,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:07:44,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1294757063, now seen corresponding path program 1 times [2019-12-27 22:07:44,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:07:44,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509909091] [2019-12-27 22:07:44,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:07:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:07:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:07:44,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509909091] [2019-12-27 22:07:44,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:07:44,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:07:44,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1412882385] [2019-12-27 22:07:44,139 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:07:44,159 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:07:44,256 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 285 transitions. [2019-12-27 22:07:44,256 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:07:44,257 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:07:44,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:07:44,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:07:44,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:07:44,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:07:44,258 INFO L87 Difference]: Start difference. First operand 4666 states and 13439 transitions. Second operand 3 states. [2019-12-27 22:07:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:07:44,281 INFO L93 Difference]: Finished difference Result 4414 states and 12534 transitions. [2019-12-27 22:07:44,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:07:44,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:07:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:07:44,287 INFO L225 Difference]: With dead ends: 4414 [2019-12-27 22:07:44,287 INFO L226 Difference]: Without dead ends: 4414 [2019-12-27 22:07:44,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:07:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2019-12-27 22:07:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 4414. [2019-12-27 22:07:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4414 states. [2019-12-27 22:07:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4414 states to 4414 states and 12534 transitions. [2019-12-27 22:07:44,345 INFO L78 Accepts]: Start accepts. Automaton has 4414 states and 12534 transitions. Word has length 65 [2019-12-27 22:07:44,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:07:44,346 INFO L462 AbstractCegarLoop]: Abstraction has 4414 states and 12534 transitions. [2019-12-27 22:07:44,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:07:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4414 states and 12534 transitions. [2019-12-27 22:07:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:07:44,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:07:44,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:07:44,352 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-27 22:07:44,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:07:44,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1361414887, now seen corresponding path program 1 times [2019-12-27 22:07:44,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:07:44,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832912053] [2019-12-27 22:07:44,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:07:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:07:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:07:44,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832912053] [2019-12-27 22:07:44,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:07:44,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:07:44,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1346286431] [2019-12-27 22:07:44,460 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:07:44,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:07:44,573 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 198 transitions. [2019-12-27 22:07:44,573 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:07:44,581 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:07:44,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:07:44,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:07:44,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:07:44,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:07:44,583 INFO L87 Difference]: Start difference. First operand 4414 states and 12534 transitions. Second operand 5 states. [2019-12-27 22:07:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:07:44,938 INFO L93 Difference]: Finished difference Result 7038 states and 19759 transitions. [2019-12-27 22:07:44,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:07:44,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 22:07:44,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:07:44,948 INFO L225 Difference]: With dead ends: 7038 [2019-12-27 22:07:44,948 INFO L226 Difference]: Without dead ends: 7038 [2019-12-27 22:07:44,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:07:44,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7038 states. [2019-12-27 22:07:45,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7038 to 4840. [2019-12-27 22:07:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4840 states. [2019-12-27 22:07:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4840 states to 4840 states and 13808 transitions. [2019-12-27 22:07:45,025 INFO L78 Accepts]: Start accepts. Automaton has 4840 states and 13808 transitions. Word has length 66 [2019-12-27 22:07:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:07:45,025 INFO L462 AbstractCegarLoop]: Abstraction has 4840 states and 13808 transitions. [2019-12-27 22:07:45,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:07:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4840 states and 13808 transitions. [2019-12-27 22:07:45,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:07:45,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:07:45,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:07:45,032 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-27 22:07:45,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:07:45,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1912682329, now seen corresponding path program 2 times [2019-12-27 22:07:45,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:07:45,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363895294] [2019-12-27 22:07:45,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:07:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:07:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:07:45,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363895294] [2019-12-27 22:07:45,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:07:45,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:07:45,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [495459803] [2019-12-27 22:07:45,163 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:07:45,183 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:07:45,285 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 226 transitions. [2019-12-27 22:07:45,286 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:07:45,287 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:07:45,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:07:45,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:07:45,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:07:45,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:07:45,288 INFO L87 Difference]: Start difference. First operand 4840 states and 13808 transitions. Second operand 3 states. [2019-12-27 22:07:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:07:45,376 INFO L93 Difference]: Finished difference Result 4840 states and 13807 transitions. [2019-12-27 22:07:45,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:07:45,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 22:07:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:07:45,387 INFO L225 Difference]: With dead ends: 4840 [2019-12-27 22:07:45,387 INFO L226 Difference]: Without dead ends: 4840 [2019-12-27 22:07:45,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:07:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4840 states. [2019-12-27 22:07:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4840 to 3325. [2019-12-27 22:07:45,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3325 states. [2019-12-27 22:07:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 3325 states and 9638 transitions. [2019-12-27 22:07:45,497 INFO L78 Accepts]: Start accepts. Automaton has 3325 states and 9638 transitions. Word has length 66 [2019-12-27 22:07:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:07:45,498 INFO L462 AbstractCegarLoop]: Abstraction has 3325 states and 9638 transitions. [2019-12-27 22:07:45,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:07:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3325 states and 9638 transitions. [2019-12-27 22:07:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:07:45,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:07:45,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:07:45,506 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-27 22:07:45,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:07:45,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1093252188, now seen corresponding path program 1 times [2019-12-27 22:07:45,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:07:45,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076084047] [2019-12-27 22:07:45,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:07:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:07:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:07:45,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076084047] [2019-12-27 22:07:45,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:07:45,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:07:45,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1903912313] [2019-12-27 22:07:45,675 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:07:45,696 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:07:45,980 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 225 transitions. [2019-12-27 22:07:45,980 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:07:45,983 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:07:45,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:07:45,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:07:45,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:07:45,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:07:45,990 INFO L87 Difference]: Start difference. First operand 3325 states and 9638 transitions. Second operand 3 states. [2019-12-27 22:07:46,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:07:46,013 INFO L93 Difference]: Finished difference Result 3149 states and 8897 transitions. [2019-12-27 22:07:46,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:07:46,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 22:07:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:07:46,020 INFO L225 Difference]: With dead ends: 3149 [2019-12-27 22:07:46,020 INFO L226 Difference]: Without dead ends: 3149 [2019-12-27 22:07:46,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:07:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states. [2019-12-27 22:07:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 2989. [2019-12-27 22:07:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-27 22:07:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8453 transitions. [2019-12-27 22:07:46,086 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8453 transitions. Word has length 67 [2019-12-27 22:07:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:07:46,087 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8453 transitions. [2019-12-27 22:07:46,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:07:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8453 transitions. [2019-12-27 22:07:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:07:46,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:07:46,093 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-27 22:07:46,093 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-27 22:07:46,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:07:46,093 INFO L82 PathProgramCache]: Analyzing trace with hash -359570990, now seen corresponding path program 1 times [2019-12-27 22:07:46,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:07:46,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766539131] [2019-12-27 22:07:46,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:07:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:07:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:07:46,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766539131] [2019-12-27 22:07:46,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:07:46,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:07:46,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [952555488] [2019-12-27 22:07:46,217 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:07:46,238 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:07:46,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 200 transitions. [2019-12-27 22:07:46,348 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:07:46,350 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:07:46,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:07:46,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:07:46,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:07:46,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:07:46,351 INFO L87 Difference]: Start difference. First operand 2989 states and 8453 transitions. Second operand 6 states. [2019-12-27 22:07:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:07:46,454 INFO L93 Difference]: Finished difference Result 5345 states and 15114 transitions. [2019-12-27 22:07:46,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:07:46,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 22:07:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:07:46,459 INFO L225 Difference]: With dead ends: 5345 [2019-12-27 22:07:46,459 INFO L226 Difference]: Without dead ends: 2844 [2019-12-27 22:07:46,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:07:46,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2019-12-27 22:07:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2448. [2019-12-27 22:07:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2448 states. [2019-12-27 22:07:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 6869 transitions. [2019-12-27 22:07:46,501 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 6869 transitions. Word has length 68 [2019-12-27 22:07:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:07:46,501 INFO L462 AbstractCegarLoop]: Abstraction has 2448 states and 6869 transitions. [2019-12-27 22:07:46,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:07:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 6869 transitions. [2019-12-27 22:07:46,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:07:46,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:07:46,504 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-27 22:07:46,505 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-27 22:07:46,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:07:46,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1765765328, now seen corresponding path program 2 times [2019-12-27 22:07:46,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:07:46,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856148569] [2019-12-27 22:07:46,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:07:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:07:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:07:46,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856148569] [2019-12-27 22:07:46,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:07:46,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:07:46,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [903959791] [2019-12-27 22:07:46,647 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:07:46,666 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:07:46,793 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 317 transitions. [2019-12-27 22:07:46,793 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:07:46,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:07:46,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:07:46,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:07:46,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:07:46,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:07:46,795 INFO L87 Difference]: Start difference. First operand 2448 states and 6869 transitions. Second operand 6 states. [2019-12-27 22:07:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:07:46,882 INFO L93 Difference]: Finished difference Result 4473 states and 12566 transitions. [2019-12-27 22:07:46,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:07:46,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 22:07:46,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:07:46,887 INFO L225 Difference]: With dead ends: 4473 [2019-12-27 22:07:46,888 INFO L226 Difference]: Without dead ends: 2201 [2019-12-27 22:07:46,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:07:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2019-12-27 22:07:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 2201. [2019-12-27 22:07:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2201 states. [2019-12-27 22:07:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2201 states to 2201 states and 6196 transitions. [2019-12-27 22:07:46,944 INFO L78 Accepts]: Start accepts. Automaton has 2201 states and 6196 transitions. Word has length 68 [2019-12-27 22:07:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:07:46,945 INFO L462 AbstractCegarLoop]: Abstraction has 2201 states and 6196 transitions. [2019-12-27 22:07:46,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:07:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 6196 transitions. [2019-12-27 22:07:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:07:46,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:07:46,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:07:46,950 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-27 22:07:46,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:07:46,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1952420056, now seen corresponding path program 3 times [2019-12-27 22:07:46,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:07:46,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327084671] [2019-12-27 22:07:46,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:07:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:07:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:07:47,083 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:07:47,084 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:07:47,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~x$w_buff0_used~0_117) (= v_~x$w_buff1_used~0_74 0) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~x~0_30 0) (= 0 v_~x$r_buff0_thd1~0_20) (= v_~y~0_14 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1807~0.base_20|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1807~0.base_20| 4) |v_#length_25|) (= 0 |v_ULTIMATE.start_main_~#t1807~0.offset_17|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1807~0.base_20|)) (= v_~x$flush_delayed~0_16 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1807~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1807~0.base_20|) |v_ULTIMATE.start_main_~#t1807~0.offset_17| 0)) |v_#memory_int_21|) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1807~0.base_20| 1)) (= v_~x$r_buff1_thd0~0_47 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$r_buff0_thd0~0_79) (= 0 |v_#NULL.base_4|) (= 0 v_~x$w_buff1~0_29) (= 0 v_~__unbuffered_cnt~0_19) (= v_~x$r_buff1_thd2~0_19 0) (= |v_#NULL.offset_4| 0) (= v_~x$mem_tmp~0_11 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0~0_30) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_30, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_~#t1808~0.offset=|v_ULTIMATE.start_main_~#t1808~0.offset_17|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_29, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_30, ULTIMATE.start_main_~#t1807~0.offset=|v_ULTIMATE.start_main_~#t1807~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_~#t1809~0.base=|v_ULTIMATE.start_main_~#t1809~0.base_20|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ULTIMATE.start_main_~#t1809~0.offset=|v_ULTIMATE.start_main_~#t1809~0.offset_16|, ~y~0=v_~y~0_14, ULTIMATE.start_main_~#t1808~0.base=|v_ULTIMATE.start_main_~#t1808~0.base_21|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_47, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ULTIMATE.start_main_~#t1807~0.base=|v_ULTIMATE.start_main_~#t1807~0.base_20|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~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_~#t1808~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~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, ULTIMATE.start_main_~#t1807~0.offset, ~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_~#t1809~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1809~0.offset, ~y~0, ULTIMATE.start_main_~#t1808~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, 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_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1807~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:07:47,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L805-1-->L807: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1808~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1808~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1808~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1808~0.base_11|) |v_ULTIMATE.start_main_~#t1808~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1808~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1808~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1808~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1808~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1808~0.base=|v_ULTIMATE.start_main_~#t1808~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1808~0.offset=|v_ULTIMATE.start_main_~#t1808~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1808~0.base, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1808~0.offset] because there is no mapped edge [2019-12-27 22:07:47,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= |v_ULTIMATE.start_main_~#t1809~0.offset_8| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1809~0.base_9|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1809~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1809~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1809~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1809~0.base_9|) |v_ULTIMATE.start_main_~#t1809~0.offset_8| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1809~0.base_9| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1809~0.base_9| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1809~0.offset=|v_ULTIMATE.start_main_~#t1809~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1809~0.base=|v_ULTIMATE.start_main_~#t1809~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1809~0.offset, #length, ULTIMATE.start_main_~#t1809~0.base] because there is no mapped edge [2019-12-27 22:07:47,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 2 v_~x$w_buff0~0_17) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~x$w_buff0_used~0_80) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff0~0_18 v_~x$w_buff1~0_15) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_49 v_~x$w_buff0_used~0_81) (= (mod v_~x$w_buff1_used~0_49 256) 0)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 22:07:47,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1770198271 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1770198271 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In1770198271 |P2Thread1of1ForFork2_#t~ite15_Out1770198271|)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In1770198271 |P2Thread1of1ForFork2_#t~ite15_Out1770198271|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1770198271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1770198271, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1770198271, ~x~0=~x~0_In1770198271} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1770198271|, ~x$w_buff1~0=~x$w_buff1~0_In1770198271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1770198271, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1770198271, ~x~0=~x~0_In1770198271} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 22:07:47,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) 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_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 22:07:47,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In361517678 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In361517678 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out361517678| ~x$w_buff0_used~0_In361517678)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out361517678| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In361517678, ~x$w_buff0_used~0=~x$w_buff0_used~0_In361517678} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In361517678, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out361517678|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In361517678} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:07:47,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1423220876 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-1423220876 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1423220876 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1423220876 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out-1423220876| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1423220876 |P2Thread1of1ForFork2_#t~ite18_Out-1423220876|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1423220876, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1423220876, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1423220876, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1423220876} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1423220876, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1423220876, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1423220876, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1423220876|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1423220876} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 22:07:47,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-427266714| |P0Thread1of1ForFork0_#t~ite4_Out-427266714|)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-427266714 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-427266714 256)))) (or (and (not .cse0) (not .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-427266714| ~x$w_buff1~0_In-427266714)) (and (= ~x~0_In-427266714 |P0Thread1of1ForFork0_#t~ite3_Out-427266714|) .cse2 (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-427266714, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-427266714, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-427266714, ~x~0=~x~0_In-427266714} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-427266714|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-427266714|, ~x$w_buff1~0=~x$w_buff1~0_In-427266714, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-427266714, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-427266714, ~x~0=~x~0_In-427266714} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 22:07:47,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2045885025 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-2045885025 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2045885025|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-2045885025 |P0Thread1of1ForFork0_#t~ite5_Out-2045885025|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2045885025, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2045885025} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2045885025|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2045885025, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2045885025} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:07:47,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-1986750775 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1986750775 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1986750775 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1986750775 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1986750775|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1986750775 |P0Thread1of1ForFork0_#t~ite6_Out-1986750775|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1986750775, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1986750775, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1986750775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1986750775} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1986750775|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1986750775, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1986750775, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1986750775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1986750775} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:07:47,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-970866767 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-970866767 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-970866767|)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-970866767| ~x$r_buff0_thd3~0_In-970866767) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-970866767, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-970866767} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-970866767, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-970866767|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-970866767} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 22:07:47,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In905136572 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In905136572 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In905136572 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In905136572 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out905136572| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd3~0_In905136572 |P2Thread1of1ForFork2_#t~ite20_Out905136572|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In905136572, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In905136572, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In905136572, ~x$w_buff0_used~0=~x$w_buff0_used~0_In905136572} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out905136572|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In905136572, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In905136572, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In905136572, ~x$w_buff0_used~0=~x$w_buff0_used~0_In905136572} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 22:07:47,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_13)) 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_13, 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-27 22:07:47,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1750082754 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1750082754 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out-1750082754| ~x$r_buff0_thd1~0_In-1750082754) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out-1750082754| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1750082754, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1750082754} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1750082754, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1750082754|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1750082754} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 22:07:47,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1910361739 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1910361739 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1910361739 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1910361739 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1910361739| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1910361739| ~x$r_buff1_thd1~0_In1910361739) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1910361739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1910361739, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1910361739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1910361739} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1910361739, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1910361739|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1910361739, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1910361739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1910361739} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:07:47,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L737-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 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_13} 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_12, ~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-27 22:07:47,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1868294493 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1868294493 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out1868294493| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In1868294493 |P1Thread1of1ForFork1_#t~ite11_Out1868294493|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1868294493, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1868294493} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1868294493|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1868294493, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1868294493} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:07:47,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1434753503 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1434753503 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1434753503 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1434753503 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite12_Out1434753503| ~x$w_buff1_used~0_In1434753503)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out1434753503| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1434753503, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1434753503, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1434753503, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1434753503} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1434753503, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1434753503, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1434753503|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1434753503, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1434753503} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:07:47,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In480576075 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In480576075 256)))) (or (and (= ~x$r_buff0_thd2~0_Out480576075 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In480576075 ~x$r_buff0_thd2~0_Out480576075) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In480576075, ~x$w_buff0_used~0=~x$w_buff0_used~0_In480576075} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out480576075|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out480576075, ~x$w_buff0_used~0=~x$w_buff0_used~0_In480576075} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:07:47,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-850728288 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-850728288 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-850728288 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-850728288 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-850728288|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-850728288| ~x$r_buff1_thd2~0_In-850728288) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-850728288, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-850728288, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-850728288, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-850728288} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-850728288, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-850728288, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-850728288, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-850728288|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-850728288} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:07:47,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, 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_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, 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-27 22:07:47,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: 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-27 22:07:47,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In799522837 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In799522837 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite24_Out799522837| |ULTIMATE.start_main_#t~ite25_Out799522837|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite24_Out799522837| ~x$w_buff1~0_In799522837) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= |ULTIMATE.start_main_#t~ite24_Out799522837| ~x~0_In799522837)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In799522837, ~x$w_buff1_used~0=~x$w_buff1_used~0_In799522837, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In799522837, ~x~0=~x~0_In799522837} OutVars{~x$w_buff1~0=~x$w_buff1~0_In799522837, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out799522837|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out799522837|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In799522837, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In799522837, ~x~0=~x~0_In799522837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 22:07:47,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1303550829 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1303550829 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out-1303550829| 0)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1303550829 |ULTIMATE.start_main_#t~ite26_Out-1303550829|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1303550829, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1303550829} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1303550829, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1303550829|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1303550829} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 22:07:47,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2136361231 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2136361231 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-2136361231 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-2136361231 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out-2136361231|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-2136361231 |ULTIMATE.start_main_#t~ite27_Out-2136361231|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2136361231, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2136361231, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2136361231, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2136361231} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2136361231, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2136361231, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-2136361231|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2136361231, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2136361231} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 22:07:47,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1607344823 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1607344823 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1607344823 |ULTIMATE.start_main_#t~ite28_Out-1607344823|)) (and (= 0 |ULTIMATE.start_main_#t~ite28_Out-1607344823|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1607344823, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1607344823} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1607344823, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1607344823|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1607344823} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 22:07:47,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1141290380 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1141290380 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1141290380 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1141290380 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out1141290380|)) (and (= ~x$r_buff1_thd0~0_In1141290380 |ULTIMATE.start_main_#t~ite29_Out1141290380|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1141290380, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1141290380, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1141290380, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1141290380} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1141290380, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1141290380|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1141290380, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1141290380, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1141290380} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 22:07:47,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_21} 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-27 22:07:47,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$flush_delayed~0_10 0) (= v_~x$mem_tmp~0_7 v_~x~0_25)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} 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-27 22:07:47,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:07:47,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:07:47 BasicIcfg [2019-12-27 22:07:47,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:07:47,238 INFO L168 Benchmark]: Toolchain (without parser) took 96131.95 ms. Allocated memory was 142.1 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 105.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 22:07:47,239 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 142.1 MB. Free memory was 125.2 MB in the beginning and 125.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 22:07:47,241 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.59 ms. Allocated memory was 142.1 MB in the beginning and 205.5 MB in the end (delta: 63.4 MB). Free memory was 104.9 MB in the beginning and 159.1 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:07:47,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.58 ms. Allocated memory is still 205.5 MB. Free memory was 159.1 MB in the beginning and 156.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:07:47,244 INFO L168 Benchmark]: Boogie Preprocessor took 37.24 ms. Allocated memory is still 205.5 MB. Free memory was 156.0 MB in the beginning and 153.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 22:07:47,244 INFO L168 Benchmark]: RCFGBuilder took 879.54 ms. Allocated memory is still 205.5 MB. Free memory was 153.5 MB in the beginning and 103.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:07:47,245 INFO L168 Benchmark]: TraceAbstraction took 94396.92 ms. Allocated memory was 205.5 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 103.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 22:07:47,251 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.26 ms. Allocated memory is still 142.1 MB. Free memory was 125.2 MB in the beginning and 125.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 729.59 ms. Allocated memory was 142.1 MB in the beginning and 205.5 MB in the end (delta: 63.4 MB). Free memory was 104.9 MB in the beginning and 159.1 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.58 ms. Allocated memory is still 205.5 MB. Free memory was 159.1 MB in the beginning and 156.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.24 ms. Allocated memory is still 205.5 MB. Free memory was 156.0 MB in the beginning and 153.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 879.54 ms. Allocated memory is still 205.5 MB. Free memory was 153.5 MB in the beginning and 103.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 94396.92 ms. Allocated memory was 205.5 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 103.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 28 ChoiceCompositions, 5983 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82010 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1807, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L807] FCALL, FORK 0 pthread_create(&t1808, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L809] FCALL, FORK 0 pthread_create(&t1809, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=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] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=2] [L727] 1 __unbuffered_p0_EAX = y [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L782] 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_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L733] EXPR 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_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 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 [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] 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_p0_EAX=2, __unbuffered_p2_EAX=1, 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_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 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 [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 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) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 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 [L815] 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_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L815] 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) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 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 [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 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 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L826] 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_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L826] 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) [L827] 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_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L827] 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)) [L828] 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_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L828] 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)) [L829] 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_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L829] 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)) [L830] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L830] 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)) [L832] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L832] 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)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 94.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2091 SDtfs, 1370 SDslu, 3061 SDs, 0 SdLazy, 1354 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203645occurred 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: 49.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 69577 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 721 NumberOfCodeBlocks, 721 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 638 ConstructedInterpolants, 0 QuantifiedInterpolants, 121480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...