/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/mix056_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:42:52,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:42:52,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:42:52,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:42:52,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:42:52,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:42:52,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:42:52,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:42:52,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:42:52,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:42:52,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:42:52,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:42:52,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:42:52,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:42:52,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:42:52,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:42:52,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:42:52,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:42:52,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:42:52,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:42:52,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:42:52,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:42:52,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:42:52,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:42:52,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:42:52,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:42:52,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:42:52,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:42:52,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:42:52,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:42:52,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:42:52,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:42:52,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:42:52,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:42:52,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:42:52,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:42:52,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:42:52,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:42:52,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:42:52,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:42:52,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:42:52,803 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 21:42:52,817 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:42:52,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:42:52,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:42:52,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:42:52,819 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:42:52,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:42:52,820 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:42:52,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:42:52,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:42:52,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:42:52,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:42:52,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:42:52,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:42:52,821 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:42:52,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:42:52,821 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:42:52,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:42:52,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:42:52,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:42:52,822 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:42:52,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:42:52,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:42:52,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:42:52,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:42:52,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:42:52,824 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:42:52,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:42:52,824 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:42:52,824 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:42:52,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:42:52,825 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:42:52,825 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:42:53,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:42:53,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:42:53,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:42:53,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:42:53,117 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:42:53,118 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.oepc.i [2019-12-27 21:42:53,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267f9448a/c4c78a6362594fd5878e4dfadba0136a/FLAGcbd67957e [2019-12-27 21:42:53,771 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:42:53,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_pso.oepc.i [2019-12-27 21:42:53,786 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267f9448a/c4c78a6362594fd5878e4dfadba0136a/FLAGcbd67957e [2019-12-27 21:42:54,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267f9448a/c4c78a6362594fd5878e4dfadba0136a [2019-12-27 21:42:54,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:42:54,034 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:42:54,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:42:54,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:42:54,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:42:54,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:42:54" (1/1) ... [2019-12-27 21:42:54,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a66491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:54, skipping insertion in model container [2019-12-27 21:42:54,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:42:54" (1/1) ... [2019-12-27 21:42:54,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:42:54,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:42:54,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:42:54,660 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:42:54,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:42:54,800 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:42:54,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:54 WrapperNode [2019-12-27 21:42:54,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:42:54,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:42:54,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:42:54,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:42:54,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:54" (1/1) ... [2019-12-27 21:42:54,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:54" (1/1) ... [2019-12-27 21:42:54,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:42:54,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:42:54,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:42:54,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:42:54,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:54" (1/1) ... [2019-12-27 21:42:54,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:54" (1/1) ... [2019-12-27 21:42:54,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:54" (1/1) ... [2019-12-27 21:42:54,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:54" (1/1) ... [2019-12-27 21:42:54,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:54" (1/1) ... [2019-12-27 21:42:54,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:54" (1/1) ... [2019-12-27 21:42:54,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:54" (1/1) ... [2019-12-27 21:42:54,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:42:54,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:42:54,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:42:54,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:42:54,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:54" (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 21:42:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:42:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:42:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:42:54,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:42:54,999 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:42:55,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:42:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:42:55,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:42:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:42:55,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:42:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:42:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:42:55,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:42:55,005 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 21:42:55,906 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:42:55,906 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:42:55,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:42:55 BoogieIcfgContainer [2019-12-27 21:42:55,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:42:55,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:42:55,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:42:55,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:42:55,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:42:54" (1/3) ... [2019-12-27 21:42:55,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a74aad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:42:55, skipping insertion in model container [2019-12-27 21:42:55,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:54" (2/3) ... [2019-12-27 21:42:55,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a74aad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:42:55, skipping insertion in model container [2019-12-27 21:42:55,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:42:55" (3/3) ... [2019-12-27 21:42:55,916 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_pso.oepc.i [2019-12-27 21:42:55,926 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:42:55,926 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:42:55,933 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:42:55,935 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:42:55,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,977 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,978 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,978 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,979 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,979 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,987 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,988 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,997 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,997 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:55,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,045 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,046 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,046 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,048 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,049 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,054 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,056 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:56,079 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:42:56,100 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:42:56,100 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:42:56,100 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:42:56,101 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:42:56,101 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:42:56,101 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:42:56,101 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:42:56,101 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:42:56,119 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 21:42:56,121 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 21:42:56,225 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 21:42:56,226 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:42:56,243 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:42:56,270 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 21:42:56,326 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 21:42:56,326 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:42:56,337 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:42:56,362 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 21:42:56,363 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:43:00,005 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 21:43:00,141 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 21:43:00,173 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81192 [2019-12-27 21:43:00,173 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 21:43:00,177 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-27 21:43:17,864 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115082 states. [2019-12-27 21:43:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 115082 states. [2019-12-27 21:43:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:43:17,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:17,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:43:17,873 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:17,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:17,880 INFO L82 PathProgramCache]: Analyzing trace with hash 906063, now seen corresponding path program 1 times [2019-12-27 21:43:17,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:17,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968188098] [2019-12-27 21:43:17,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:18,134 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 21:43:18,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968188098] [2019-12-27 21:43:18,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:18,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:43:18,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2030033993] [2019-12-27 21:43:18,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:18,145 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:18,158 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:43:18,158 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:18,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:18,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:43:18,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:18,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:43:18,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:43:18,181 INFO L87 Difference]: Start difference. First operand 115082 states. Second operand 3 states. [2019-12-27 21:43:19,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:19,482 INFO L93 Difference]: Finished difference Result 113614 states and 485598 transitions. [2019-12-27 21:43:19,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:43:19,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:43:19,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:23,338 INFO L225 Difference]: With dead ends: 113614 [2019-12-27 21:43:23,339 INFO L226 Difference]: Without dead ends: 106516 [2019-12-27 21:43:23,344 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 21:43:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106516 states. [2019-12-27 21:43:29,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106516 to 106516. [2019-12-27 21:43:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106516 states. [2019-12-27 21:43:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106516 states to 106516 states and 454632 transitions. [2019-12-27 21:43:34,499 INFO L78 Accepts]: Start accepts. Automaton has 106516 states and 454632 transitions. Word has length 3 [2019-12-27 21:43:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:34,499 INFO L462 AbstractCegarLoop]: Abstraction has 106516 states and 454632 transitions. [2019-12-27 21:43:34,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:43:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 106516 states and 454632 transitions. [2019-12-27 21:43:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:43:34,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:34,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:34,504 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:34,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:34,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2135146020, now seen corresponding path program 1 times [2019-12-27 21:43:34,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:34,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905158761] [2019-12-27 21:43:34,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:34,608 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 21:43:34,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905158761] [2019-12-27 21:43:34,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:34,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:43:34,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [503906710] [2019-12-27 21:43:34,610 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:34,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:34,618 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:43:34,618 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:34,618 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:34,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:43:34,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:34,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:43:34,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:43:34,622 INFO L87 Difference]: Start difference. First operand 106516 states and 454632 transitions. Second operand 4 states. [2019-12-27 21:43:40,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:40,130 INFO L93 Difference]: Finished difference Result 168744 states and 686980 transitions. [2019-12-27 21:43:40,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:43:40,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:43:40,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:40,882 INFO L225 Difference]: With dead ends: 168744 [2019-12-27 21:43:40,883 INFO L226 Difference]: Without dead ends: 168695 [2019-12-27 21:43:40,884 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 21:43:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168695 states. [2019-12-27 21:43:48,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168695 to 154366. [2019-12-27 21:43:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154366 states. [2019-12-27 21:43:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154366 states to 154366 states and 637272 transitions. [2019-12-27 21:43:49,362 INFO L78 Accepts]: Start accepts. Automaton has 154366 states and 637272 transitions. Word has length 11 [2019-12-27 21:43:49,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:49,362 INFO L462 AbstractCegarLoop]: Abstraction has 154366 states and 637272 transitions. [2019-12-27 21:43:49,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:43:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand 154366 states and 637272 transitions. [2019-12-27 21:43:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:43:49,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:49,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:49,370 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:49,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:49,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1594443795, now seen corresponding path program 1 times [2019-12-27 21:43:49,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:49,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694224181] [2019-12-27 21:43:49,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:49,442 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 21:43:49,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694224181] [2019-12-27 21:43:49,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:49,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:43:49,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1975963059] [2019-12-27 21:43:49,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:49,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:49,446 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:43:49,446 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:49,447 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:49,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:43:49,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:49,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:43:49,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:43:49,448 INFO L87 Difference]: Start difference. First operand 154366 states and 637272 transitions. Second operand 3 states. [2019-12-27 21:43:49,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:49,605 INFO L93 Difference]: Finished difference Result 33669 states and 109308 transitions. [2019-12-27 21:43:49,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:43:49,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:43:49,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:49,663 INFO L225 Difference]: With dead ends: 33669 [2019-12-27 21:43:49,663 INFO L226 Difference]: Without dead ends: 33669 [2019-12-27 21:43:49,664 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 21:43:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33669 states. [2019-12-27 21:43:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33669 to 33669. [2019-12-27 21:43:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33669 states. [2019-12-27 21:43:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33669 states to 33669 states and 109308 transitions. [2019-12-27 21:43:54,973 INFO L78 Accepts]: Start accepts. Automaton has 33669 states and 109308 transitions. Word has length 13 [2019-12-27 21:43:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:54,973 INFO L462 AbstractCegarLoop]: Abstraction has 33669 states and 109308 transitions. [2019-12-27 21:43:54,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:43:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 33669 states and 109308 transitions. [2019-12-27 21:43:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:43:54,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:54,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:54,975 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:54,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:54,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1527563672, now seen corresponding path program 1 times [2019-12-27 21:43:54,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:54,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512939824] [2019-12-27 21:43:54,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:43:55,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512939824] [2019-12-27 21:43:55,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:55,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:43:55,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [403249372] [2019-12-27 21:43:55,090 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:55,092 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:55,095 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:43:55,095 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:55,095 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:55,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:43:55,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:55,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:43:55,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:43:55,096 INFO L87 Difference]: Start difference. First operand 33669 states and 109308 transitions. Second operand 3 states. [2019-12-27 21:43:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:55,295 INFO L93 Difference]: Finished difference Result 50580 states and 164138 transitions. [2019-12-27 21:43:55,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:43:55,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:43:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:55,380 INFO L225 Difference]: With dead ends: 50580 [2019-12-27 21:43:55,381 INFO L226 Difference]: Without dead ends: 50580 [2019-12-27 21:43:55,381 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 21:43:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50580 states. [2019-12-27 21:43:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50580 to 36729. [2019-12-27 21:43:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36729 states. [2019-12-27 21:43:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36729 states to 36729 states and 120582 transitions. [2019-12-27 21:43:56,118 INFO L78 Accepts]: Start accepts. Automaton has 36729 states and 120582 transitions. Word has length 16 [2019-12-27 21:43:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:56,119 INFO L462 AbstractCegarLoop]: Abstraction has 36729 states and 120582 transitions. [2019-12-27 21:43:56,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:43:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 36729 states and 120582 transitions. [2019-12-27 21:43:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:43:56,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:56,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:56,122 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:56,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1527444198, now seen corresponding path program 1 times [2019-12-27 21:43:56,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:56,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015708335] [2019-12-27 21:43:56,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:56,221 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 21:43:56,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015708335] [2019-12-27 21:43:56,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:56,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:43:56,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [881901231] [2019-12-27 21:43:56,222 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:56,225 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:56,227 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:43:56,227 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:56,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:56,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:43:56,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:56,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:43:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:43:56,229 INFO L87 Difference]: Start difference. First operand 36729 states and 120582 transitions. Second operand 4 states. [2019-12-27 21:43:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:56,850 INFO L93 Difference]: Finished difference Result 43883 states and 141848 transitions. [2019-12-27 21:43:56,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:43:56,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:43:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:56,925 INFO L225 Difference]: With dead ends: 43883 [2019-12-27 21:43:56,925 INFO L226 Difference]: Without dead ends: 43883 [2019-12-27 21:43:56,926 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 21:43:57,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43883 states. [2019-12-27 21:43:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43883 to 40260. [2019-12-27 21:43:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40260 states. [2019-12-27 21:43:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40260 states to 40260 states and 131124 transitions. [2019-12-27 21:43:57,615 INFO L78 Accepts]: Start accepts. Automaton has 40260 states and 131124 transitions. Word has length 16 [2019-12-27 21:43:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:57,615 INFO L462 AbstractCegarLoop]: Abstraction has 40260 states and 131124 transitions. [2019-12-27 21:43:57,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:43:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 40260 states and 131124 transitions. [2019-12-27 21:43:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:43:57,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:57,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:57,618 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:57,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1609012266, now seen corresponding path program 1 times [2019-12-27 21:43:57,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:57,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057640062] [2019-12-27 21:43:57,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:57,706 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 21:43:57,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057640062] [2019-12-27 21:43:57,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:57,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:43:57,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1590999157] [2019-12-27 21:43:57,708 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:57,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:57,712 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:43:57,712 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:57,712 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:57,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:43:57,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:57,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:43:57,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:43:57,714 INFO L87 Difference]: Start difference. First operand 40260 states and 131124 transitions. Second operand 4 states. [2019-12-27 21:43:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:58,100 INFO L93 Difference]: Finished difference Result 47608 states and 154005 transitions. [2019-12-27 21:43:58,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:43:58,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:43:58,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:58,175 INFO L225 Difference]: With dead ends: 47608 [2019-12-27 21:43:58,175 INFO L226 Difference]: Without dead ends: 47608 [2019-12-27 21:43:58,175 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 21:43:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47608 states. [2019-12-27 21:43:59,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47608 to 40827. [2019-12-27 21:43:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40827 states. [2019-12-27 21:43:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40827 states to 40827 states and 133422 transitions. [2019-12-27 21:43:59,232 INFO L78 Accepts]: Start accepts. Automaton has 40827 states and 133422 transitions. Word has length 16 [2019-12-27 21:43:59,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:59,232 INFO L462 AbstractCegarLoop]: Abstraction has 40827 states and 133422 transitions. [2019-12-27 21:43:59,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:43:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 40827 states and 133422 transitions. [2019-12-27 21:43:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:43:59,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:59,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:59,244 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:59,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:59,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1226017601, now seen corresponding path program 1 times [2019-12-27 21:43:59,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:59,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298836469] [2019-12-27 21:43:59,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:59,358 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 21:43:59,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298836469] [2019-12-27 21:43:59,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:59,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:43:59,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1333013551] [2019-12-27 21:43:59,359 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:59,363 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:59,374 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 58 transitions. [2019-12-27 21:43:59,374 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:59,375 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:59,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:43:59,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:59,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:43:59,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:43:59,377 INFO L87 Difference]: Start difference. First operand 40827 states and 133422 transitions. Second operand 5 states. [2019-12-27 21:44:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:00,094 INFO L93 Difference]: Finished difference Result 57178 states and 181649 transitions. [2019-12-27 21:44:00,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:44:00,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 21:44:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:00,192 INFO L225 Difference]: With dead ends: 57178 [2019-12-27 21:44:00,192 INFO L226 Difference]: Without dead ends: 57171 [2019-12-27 21:44:00,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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 21:44:00,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57171 states. [2019-12-27 21:44:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57171 to 42171. [2019-12-27 21:44:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42171 states. [2019-12-27 21:44:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42171 states to 42171 states and 137482 transitions. [2019-12-27 21:44:01,309 INFO L78 Accepts]: Start accepts. Automaton has 42171 states and 137482 transitions. Word has length 22 [2019-12-27 21:44:01,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:01,310 INFO L462 AbstractCegarLoop]: Abstraction has 42171 states and 137482 transitions. [2019-12-27 21:44:01,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:44:01,310 INFO L276 IsEmpty]: Start isEmpty. Operand 42171 states and 137482 transitions. [2019-12-27 21:44:01,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:44:01,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:01,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:01,319 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:01,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1893580273, now seen corresponding path program 1 times [2019-12-27 21:44:01,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:01,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708062553] [2019-12-27 21:44:01,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:01,420 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 21:44:01,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708062553] [2019-12-27 21:44:01,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:01,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:44:01,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1859948364] [2019-12-27 21:44:01,422 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:01,425 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:01,431 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 44 transitions. [2019-12-27 21:44:01,431 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:01,434 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:44:01,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:44:01,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:01,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:44:01,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:44:01,436 INFO L87 Difference]: Start difference. First operand 42171 states and 137482 transitions. Second operand 5 states. [2019-12-27 21:44:02,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:02,156 INFO L93 Difference]: Finished difference Result 59763 states and 189217 transitions. [2019-12-27 21:44:02,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:44:02,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 21:44:02,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:02,258 INFO L225 Difference]: With dead ends: 59763 [2019-12-27 21:44:02,258 INFO L226 Difference]: Without dead ends: 59756 [2019-12-27 21:44:02,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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 21:44:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59756 states. [2019-12-27 21:44:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59756 to 40228. [2019-12-27 21:44:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40228 states. [2019-12-27 21:44:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40228 states to 40228 states and 131220 transitions. [2019-12-27 21:44:03,509 INFO L78 Accepts]: Start accepts. Automaton has 40228 states and 131220 transitions. Word has length 22 [2019-12-27 21:44:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:03,510 INFO L462 AbstractCegarLoop]: Abstraction has 40228 states and 131220 transitions. [2019-12-27 21:44:03,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:44:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 40228 states and 131220 transitions. [2019-12-27 21:44:03,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:44:03,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:03,523 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 21:44:03,523 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:03,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:03,524 INFO L82 PathProgramCache]: Analyzing trace with hash -386787907, now seen corresponding path program 1 times [2019-12-27 21:44:03,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:03,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622186396] [2019-12-27 21:44:03,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:03,579 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 21:44:03,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622186396] [2019-12-27 21:44:03,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:03,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:44:03,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [931351512] [2019-12-27 21:44:03,581 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:03,586 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:03,597 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:44:03,597 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:03,637 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:44:03,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:44:03,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:03,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:44:03,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:44:03,639 INFO L87 Difference]: Start difference. First operand 40228 states and 131220 transitions. Second operand 5 states. [2019-12-27 21:44:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:03,723 INFO L93 Difference]: Finished difference Result 15958 states and 49114 transitions. [2019-12-27 21:44:03,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:44:03,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:44:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:03,747 INFO L225 Difference]: With dead ends: 15958 [2019-12-27 21:44:03,747 INFO L226 Difference]: Without dead ends: 15958 [2019-12-27 21:44:03,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:44:03,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15958 states. [2019-12-27 21:44:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15958 to 15686. [2019-12-27 21:44:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-27 21:44:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 48338 transitions. [2019-12-27 21:44:03,980 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 48338 transitions. Word has length 25 [2019-12-27 21:44:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:03,980 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 48338 transitions. [2019-12-27 21:44:03,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:44:03,981 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 48338 transitions. [2019-12-27 21:44:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:44:03,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:03,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:03,993 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:03,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:03,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2128582184, now seen corresponding path program 1 times [2019-12-27 21:44:03,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:03,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558917097] [2019-12-27 21:44:03,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:04,073 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 21:44:04,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558917097] [2019-12-27 21:44:04,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:04,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:44:04,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1185268697] [2019-12-27 21:44:04,074 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:04,078 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:04,084 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:44:04,085 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:04,085 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:04,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:44:04,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:04,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:44:04,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:44:04,086 INFO L87 Difference]: Start difference. First operand 15686 states and 48338 transitions. Second operand 5 states. [2019-12-27 21:44:04,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:04,485 INFO L93 Difference]: Finished difference Result 20194 states and 61068 transitions. [2019-12-27 21:44:04,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:44:04,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 21:44:04,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:04,514 INFO L225 Difference]: With dead ends: 20194 [2019-12-27 21:44:04,514 INFO L226 Difference]: Without dead ends: 20194 [2019-12-27 21:44:04,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:44:04,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20194 states. [2019-12-27 21:44:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20194 to 18928. [2019-12-27 21:44:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18928 states. [2019-12-27 21:44:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18928 states to 18928 states and 57898 transitions. [2019-12-27 21:44:04,793 INFO L78 Accepts]: Start accepts. Automaton has 18928 states and 57898 transitions. Word has length 27 [2019-12-27 21:44:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:04,793 INFO L462 AbstractCegarLoop]: Abstraction has 18928 states and 57898 transitions. [2019-12-27 21:44:04,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:44:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 18928 states and 57898 transitions. [2019-12-27 21:44:04,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:44:04,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:04,806 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] [2019-12-27 21:44:04,806 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:04,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:04,807 INFO L82 PathProgramCache]: Analyzing trace with hash -786933729, now seen corresponding path program 1 times [2019-12-27 21:44:04,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:04,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136252910] [2019-12-27 21:44:04,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:04,869 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 21:44:04,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136252910] [2019-12-27 21:44:04,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:04,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:44:04,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1019424312] [2019-12-27 21:44:04,871 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:04,875 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:04,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 21:44:04,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:04,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:04,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:44:04,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:04,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:44:04,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:44:04,884 INFO L87 Difference]: Start difference. First operand 18928 states and 57898 transitions. Second operand 5 states. [2019-12-27 21:44:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:05,273 INFO L93 Difference]: Finished difference Result 21983 states and 66241 transitions. [2019-12-27 21:44:05,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:44:05,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 21:44:05,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:05,321 INFO L225 Difference]: With dead ends: 21983 [2019-12-27 21:44:05,321 INFO L226 Difference]: Without dead ends: 21983 [2019-12-27 21:44:05,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 21:44:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21983 states. [2019-12-27 21:44:05,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21983 to 17922. [2019-12-27 21:44:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17922 states. [2019-12-27 21:44:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17922 states to 17922 states and 54947 transitions. [2019-12-27 21:44:05,890 INFO L78 Accepts]: Start accepts. Automaton has 17922 states and 54947 transitions. Word has length 28 [2019-12-27 21:44:05,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:05,890 INFO L462 AbstractCegarLoop]: Abstraction has 17922 states and 54947 transitions. [2019-12-27 21:44:05,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:44:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 17922 states and 54947 transitions. [2019-12-27 21:44:05,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:44:05,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:05,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:05,911 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:05,912 INFO L82 PathProgramCache]: Analyzing trace with hash 960669183, now seen corresponding path program 1 times [2019-12-27 21:44:05,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:05,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019227245] [2019-12-27 21:44:05,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:05,993 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 21:44:05,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019227245] [2019-12-27 21:44:05,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:05,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:44:05,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1679121312] [2019-12-27 21:44:05,995 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:06,001 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:06,019 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 79 transitions. [2019-12-27 21:44:06,020 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:06,021 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:44:06,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:44:06,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:06,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:44:06,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:44:06,023 INFO L87 Difference]: Start difference. First operand 17922 states and 54947 transitions. Second operand 6 states. [2019-12-27 21:44:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:06,769 INFO L93 Difference]: Finished difference Result 25328 states and 75654 transitions. [2019-12-27 21:44:06,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:44:06,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 21:44:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:06,824 INFO L225 Difference]: With dead ends: 25328 [2019-12-27 21:44:06,824 INFO L226 Difference]: Without dead ends: 25328 [2019-12-27 21:44:06,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:44:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25328 states. [2019-12-27 21:44:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25328 to 19485. [2019-12-27 21:44:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19485 states. [2019-12-27 21:44:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19485 states to 19485 states and 59441 transitions. [2019-12-27 21:44:07,374 INFO L78 Accepts]: Start accepts. Automaton has 19485 states and 59441 transitions. Word has length 33 [2019-12-27 21:44:07,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:07,375 INFO L462 AbstractCegarLoop]: Abstraction has 19485 states and 59441 transitions. [2019-12-27 21:44:07,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:44:07,375 INFO L276 IsEmpty]: Start isEmpty. Operand 19485 states and 59441 transitions. [2019-12-27 21:44:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:44:07,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:07,408 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] [2019-12-27 21:44:07,409 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:07,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:07,409 INFO L82 PathProgramCache]: Analyzing trace with hash 446722116, now seen corresponding path program 1 times [2019-12-27 21:44:07,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:07,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268574238] [2019-12-27 21:44:07,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:07,552 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 21:44:07,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268574238] [2019-12-27 21:44:07,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:07,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:44:07,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114977511] [2019-12-27 21:44:07,553 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:07,560 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:07,578 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 70 transitions. [2019-12-27 21:44:07,578 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:07,579 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:07,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:44:07,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:07,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:44:07,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:44:07,580 INFO L87 Difference]: Start difference. First operand 19485 states and 59441 transitions. Second operand 6 states. [2019-12-27 21:44:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:08,347 INFO L93 Difference]: Finished difference Result 24785 states and 74278 transitions. [2019-12-27 21:44:08,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:44:08,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 21:44:08,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:08,389 INFO L225 Difference]: With dead ends: 24785 [2019-12-27 21:44:08,389 INFO L226 Difference]: Without dead ends: 24785 [2019-12-27 21:44:08,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:44:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24785 states. [2019-12-27 21:44:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24785 to 16236. [2019-12-27 21:44:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16236 states. [2019-12-27 21:44:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16236 states to 16236 states and 49996 transitions. [2019-12-27 21:44:08,677 INFO L78 Accepts]: Start accepts. Automaton has 16236 states and 49996 transitions. Word has length 34 [2019-12-27 21:44:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:08,678 INFO L462 AbstractCegarLoop]: Abstraction has 16236 states and 49996 transitions. [2019-12-27 21:44:08,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:44:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 16236 states and 49996 transitions. [2019-12-27 21:44:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:44:08,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:08,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:08,698 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:08,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:08,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2087465042, now seen corresponding path program 1 times [2019-12-27 21:44:08,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:08,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803528030] [2019-12-27 21:44:08,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:08,745 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 21:44:08,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803528030] [2019-12-27 21:44:08,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:08,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:44:08,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [530218326] [2019-12-27 21:44:08,746 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:08,753 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:08,803 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 336 transitions. [2019-12-27 21:44:08,803 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:08,872 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:44:08,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:44:08,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:08,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:44:08,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:44:08,873 INFO L87 Difference]: Start difference. First operand 16236 states and 49996 transitions. Second operand 6 states. [2019-12-27 21:44:09,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:09,391 INFO L93 Difference]: Finished difference Result 39119 states and 120005 transitions. [2019-12-27 21:44:09,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:44:09,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-27 21:44:09,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:09,428 INFO L225 Difference]: With dead ends: 39119 [2019-12-27 21:44:09,428 INFO L226 Difference]: Without dead ends: 25137 [2019-12-27 21:44:09,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:44:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25137 states. [2019-12-27 21:44:09,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25137 to 16618. [2019-12-27 21:44:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16618 states. [2019-12-27 21:44:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16618 states to 16618 states and 49905 transitions. [2019-12-27 21:44:09,724 INFO L78 Accepts]: Start accepts. Automaton has 16618 states and 49905 transitions. Word has length 39 [2019-12-27 21:44:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:09,725 INFO L462 AbstractCegarLoop]: Abstraction has 16618 states and 49905 transitions. [2019-12-27 21:44:09,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:44:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 16618 states and 49905 transitions. [2019-12-27 21:44:09,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 21:44:09,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:09,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:09,742 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:09,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:09,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1869969437, now seen corresponding path program 1 times [2019-12-27 21:44:09,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:09,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910918311] [2019-12-27 21:44:09,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:09,842 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 21:44:09,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910918311] [2019-12-27 21:44:09,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:09,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:44:09,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1346095544] [2019-12-27 21:44:09,843 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:09,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:09,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 265 transitions. [2019-12-27 21:44:09,909 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:10,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:10,245 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 21:44:10,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:44:10,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:10,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:44:10,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:44:10,246 INFO L87 Difference]: Start difference. First operand 16618 states and 49905 transitions. Second operand 12 states. [2019-12-27 21:44:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:11,307 INFO L93 Difference]: Finished difference Result 24481 states and 72787 transitions. [2019-12-27 21:44:11,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:44:11,307 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-12-27 21:44:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:11,341 INFO L225 Difference]: With dead ends: 24481 [2019-12-27 21:44:11,341 INFO L226 Difference]: Without dead ends: 24481 [2019-12-27 21:44:11,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:44:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24481 states. [2019-12-27 21:44:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24481 to 22590. [2019-12-27 21:44:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22590 states. [2019-12-27 21:44:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22590 states to 22590 states and 67706 transitions. [2019-12-27 21:44:11,690 INFO L78 Accepts]: Start accepts. Automaton has 22590 states and 67706 transitions. Word has length 40 [2019-12-27 21:44:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:11,690 INFO L462 AbstractCegarLoop]: Abstraction has 22590 states and 67706 transitions. [2019-12-27 21:44:11,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:44:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 22590 states and 67706 transitions. [2019-12-27 21:44:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 21:44:11,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:11,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:11,717 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:11,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:11,717 INFO L82 PathProgramCache]: Analyzing trace with hash 511931149, now seen corresponding path program 2 times [2019-12-27 21:44:11,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:11,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921907585] [2019-12-27 21:44:11,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:44:11,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921907585] [2019-12-27 21:44:11,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:11,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:44:11,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1147715042] [2019-12-27 21:44:11,771 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:11,781 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:11,865 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 393 transitions. [2019-12-27 21:44:11,865 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:11,902 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:44:11,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:44:11,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:11,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:44:11,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:44:11,903 INFO L87 Difference]: Start difference. First operand 22590 states and 67706 transitions. Second operand 7 states. [2019-12-27 21:44:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:11,996 INFO L93 Difference]: Finished difference Result 21296 states and 64675 transitions. [2019-12-27 21:44:11,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:44:11,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 21:44:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:12,024 INFO L225 Difference]: With dead ends: 21296 [2019-12-27 21:44:12,024 INFO L226 Difference]: Without dead ends: 19695 [2019-12-27 21:44:12,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:44:12,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19695 states. [2019-12-27 21:44:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19695 to 18820. [2019-12-27 21:44:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18820 states. [2019-12-27 21:44:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18820 states to 18820 states and 58791 transitions. [2019-12-27 21:44:12,515 INFO L78 Accepts]: Start accepts. Automaton has 18820 states and 58791 transitions. Word has length 40 [2019-12-27 21:44:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:12,515 INFO L462 AbstractCegarLoop]: Abstraction has 18820 states and 58791 transitions. [2019-12-27 21:44:12,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:44:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 18820 states and 58791 transitions. [2019-12-27 21:44:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:44:12,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:12,542 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] [2019-12-27 21:44:12,542 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:12,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:12,542 INFO L82 PathProgramCache]: Analyzing trace with hash -396532309, now seen corresponding path program 1 times [2019-12-27 21:44:12,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:12,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536828704] [2019-12-27 21:44:12,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:12,652 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 21:44:12,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536828704] [2019-12-27 21:44:12,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:12,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:44:12,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1899236800] [2019-12-27 21:44:12,653 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:12,673 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:12,817 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 321 transitions. [2019-12-27 21:44:12,817 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:12,912 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:44:12,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:44:12,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:12,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:44:12,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:44:12,913 INFO L87 Difference]: Start difference. First operand 18820 states and 58791 transitions. Second operand 10 states. [2019-12-27 21:44:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:14,403 INFO L93 Difference]: Finished difference Result 83037 states and 255738 transitions. [2019-12-27 21:44:14,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 21:44:14,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 21:44:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:14,499 INFO L225 Difference]: With dead ends: 83037 [2019-12-27 21:44:14,500 INFO L226 Difference]: Without dead ends: 60950 [2019-12-27 21:44:14,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:44:14,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60950 states. [2019-12-27 21:44:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60950 to 21754. [2019-12-27 21:44:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21754 states. [2019-12-27 21:44:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21754 states to 21754 states and 68550 transitions. [2019-12-27 21:44:15,132 INFO L78 Accepts]: Start accepts. Automaton has 21754 states and 68550 transitions. Word has length 64 [2019-12-27 21:44:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:15,133 INFO L462 AbstractCegarLoop]: Abstraction has 21754 states and 68550 transitions. [2019-12-27 21:44:15,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:44:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 21754 states and 68550 transitions. [2019-12-27 21:44:15,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:44:15,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:15,160 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] [2019-12-27 21:44:15,160 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:15,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:15,160 INFO L82 PathProgramCache]: Analyzing trace with hash 207783117, now seen corresponding path program 2 times [2019-12-27 21:44:15,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:15,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178845004] [2019-12-27 21:44:15,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:15,430 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 21:44:15,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178845004] [2019-12-27 21:44:15,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:15,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:44:15,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2106008602] [2019-12-27 21:44:15,435 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:15,477 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:15,709 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 379 transitions. [2019-12-27 21:44:15,709 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:15,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 21:44:15,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:44:15,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:15,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:44:15,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:44:15,907 INFO L87 Difference]: Start difference. First operand 21754 states and 68550 transitions. Second operand 14 states. [2019-12-27 21:44:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:18,367 INFO L93 Difference]: Finished difference Result 73626 states and 229243 transitions. [2019-12-27 21:44:18,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:44:18,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2019-12-27 21:44:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:18,451 INFO L225 Difference]: With dead ends: 73626 [2019-12-27 21:44:18,452 INFO L226 Difference]: Without dead ends: 53816 [2019-12-27 21:44:18,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2019-12-27 21:44:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53816 states. [2019-12-27 21:44:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53816 to 25248. [2019-12-27 21:44:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25248 states. [2019-12-27 21:44:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25248 states to 25248 states and 79446 transitions. [2019-12-27 21:44:19,044 INFO L78 Accepts]: Start accepts. Automaton has 25248 states and 79446 transitions. Word has length 64 [2019-12-27 21:44:19,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:19,044 INFO L462 AbstractCegarLoop]: Abstraction has 25248 states and 79446 transitions. [2019-12-27 21:44:19,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:44:19,045 INFO L276 IsEmpty]: Start isEmpty. Operand 25248 states and 79446 transitions. [2019-12-27 21:44:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:44:19,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:19,073 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] [2019-12-27 21:44:19,073 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:19,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:19,074 INFO L82 PathProgramCache]: Analyzing trace with hash -771277719, now seen corresponding path program 3 times [2019-12-27 21:44:19,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:19,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864379098] [2019-12-27 21:44:19,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:19,364 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 21:44:19,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864379098] [2019-12-27 21:44:19,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:19,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:44:19,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612946335] [2019-12-27 21:44:19,365 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:19,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:19,540 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 326 transitions. [2019-12-27 21:44:19,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:19,773 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 21:44:19,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:44:19,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:19,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:44:19,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:44:19,774 INFO L87 Difference]: Start difference. First operand 25248 states and 79446 transitions. Second operand 13 states. [2019-12-27 21:44:23,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:23,319 INFO L93 Difference]: Finished difference Result 131344 states and 399830 transitions. [2019-12-27 21:44:23,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 21:44:23,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 21:44:23,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:23,512 INFO L225 Difference]: With dead ends: 131344 [2019-12-27 21:44:23,512 INFO L226 Difference]: Without dead ends: 118680 [2019-12-27 21:44:23,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=631, Invalid=2339, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 21:44:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118680 states. [2019-12-27 21:44:24,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118680 to 25315. [2019-12-27 21:44:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25315 states. [2019-12-27 21:44:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25315 states to 25315 states and 79778 transitions. [2019-12-27 21:44:24,932 INFO L78 Accepts]: Start accepts. Automaton has 25315 states and 79778 transitions. Word has length 64 [2019-12-27 21:44:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:24,932 INFO L462 AbstractCegarLoop]: Abstraction has 25315 states and 79778 transitions. [2019-12-27 21:44:24,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:44:24,933 INFO L276 IsEmpty]: Start isEmpty. Operand 25315 states and 79778 transitions. [2019-12-27 21:44:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:44:24,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:24,959 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] [2019-12-27 21:44:24,959 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:24,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:24,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1182182323, now seen corresponding path program 4 times [2019-12-27 21:44:24,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:24,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630331430] [2019-12-27 21:44:24,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:25,044 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 21:44:25,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630331430] [2019-12-27 21:44:25,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:25,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:44:25,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [204043894] [2019-12-27 21:44:25,045 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:25,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:25,244 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 393 transitions. [2019-12-27 21:44:25,244 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:25,401 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 21:44:25,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:44:25,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:25,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:44:25,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:44:25,403 INFO L87 Difference]: Start difference. First operand 25315 states and 79778 transitions. Second operand 12 states. [2019-12-27 21:44:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:27,528 INFO L93 Difference]: Finished difference Result 73648 states and 227039 transitions. [2019-12-27 21:44:27,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:44:27,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 21:44:27,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:27,632 INFO L225 Difference]: With dead ends: 73648 [2019-12-27 21:44:27,632 INFO L226 Difference]: Without dead ends: 64679 [2019-12-27 21:44:27,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:44:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64679 states. [2019-12-27 21:44:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64679 to 25623. [2019-12-27 21:44:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25623 states. [2019-12-27 21:44:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25623 states to 25623 states and 80729 transitions. [2019-12-27 21:44:28,638 INFO L78 Accepts]: Start accepts. Automaton has 25623 states and 80729 transitions. Word has length 64 [2019-12-27 21:44:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:28,638 INFO L462 AbstractCegarLoop]: Abstraction has 25623 states and 80729 transitions. [2019-12-27 21:44:28,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:44:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 25623 states and 80729 transitions. [2019-12-27 21:44:28,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:44:28,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:28,666 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] [2019-12-27 21:44:28,666 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:28,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:28,666 INFO L82 PathProgramCache]: Analyzing trace with hash -503301939, now seen corresponding path program 5 times [2019-12-27 21:44:28,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:28,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905937899] [2019-12-27 21:44:28,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:28,735 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 21:44:28,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905937899] [2019-12-27 21:44:28,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:28,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:44:28,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [171094268] [2019-12-27 21:44:28,736 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:28,754 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:29,082 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 252 states and 431 transitions. [2019-12-27 21:44:29,083 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:29,087 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:44:29,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:44:29,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:29,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:44:29,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:44:29,088 INFO L87 Difference]: Start difference. First operand 25623 states and 80729 transitions. Second operand 3 states. [2019-12-27 21:44:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:29,357 INFO L93 Difference]: Finished difference Result 32590 states and 101569 transitions. [2019-12-27 21:44:29,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:44:29,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 21:44:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:29,442 INFO L225 Difference]: With dead ends: 32590 [2019-12-27 21:44:29,442 INFO L226 Difference]: Without dead ends: 32590 [2019-12-27 21:44:29,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 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 21:44:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32590 states. [2019-12-27 21:44:29,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32590 to 28272. [2019-12-27 21:44:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28272 states. [2019-12-27 21:44:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28272 states to 28272 states and 89027 transitions. [2019-12-27 21:44:30,056 INFO L78 Accepts]: Start accepts. Automaton has 28272 states and 89027 transitions. Word has length 64 [2019-12-27 21:44:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:30,056 INFO L462 AbstractCegarLoop]: Abstraction has 28272 states and 89027 transitions. [2019-12-27 21:44:30,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:44:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 28272 states and 89027 transitions. [2019-12-27 21:44:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:44:30,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:30,088 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 21:44:30,088 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:30,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:30,088 INFO L82 PathProgramCache]: Analyzing trace with hash -862043868, now seen corresponding path program 1 times [2019-12-27 21:44:30,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:30,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190749446] [2019-12-27 21:44:30,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:30,157 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 21:44:30,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190749446] [2019-12-27 21:44:30,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:30,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:44:30,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2059168296] [2019-12-27 21:44:30,159 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:30,179 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:30,703 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 401 transitions. [2019-12-27 21:44:30,703 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:30,819 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:44:30,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:44:30,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:30,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:44:30,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:44:30,820 INFO L87 Difference]: Start difference. First operand 28272 states and 89027 transitions. Second operand 9 states. [2019-12-27 21:44:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:31,696 INFO L93 Difference]: Finished difference Result 51379 states and 158784 transitions. [2019-12-27 21:44:31,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:44:31,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 21:44:31,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:31,776 INFO L225 Difference]: With dead ends: 51379 [2019-12-27 21:44:31,776 INFO L226 Difference]: Without dead ends: 51379 [2019-12-27 21:44:31,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:44:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51379 states. [2019-12-27 21:44:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51379 to 28613. [2019-12-27 21:44:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28613 states. [2019-12-27 21:44:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28613 states to 28613 states and 90265 transitions. [2019-12-27 21:44:32,405 INFO L78 Accepts]: Start accepts. Automaton has 28613 states and 90265 transitions. Word has length 65 [2019-12-27 21:44:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:32,406 INFO L462 AbstractCegarLoop]: Abstraction has 28613 states and 90265 transitions. [2019-12-27 21:44:32,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:44:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 28613 states and 90265 transitions. [2019-12-27 21:44:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:44:32,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:32,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:44:32,436 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:32,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:32,436 INFO L82 PathProgramCache]: Analyzing trace with hash 588580632, now seen corresponding path program 2 times [2019-12-27 21:44:32,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:32,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910074659] [2019-12-27 21:44:32,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:32,549 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 21:44:32,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910074659] [2019-12-27 21:44:32,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:32,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:44:32,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [297938711] [2019-12-27 21:44:32,551 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:32,570 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:32,994 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 351 transitions. [2019-12-27 21:44:32,994 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:33,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 21:44:33,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:44:33,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:33,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:44:33,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:44:33,209 INFO L87 Difference]: Start difference. First operand 28613 states and 90265 transitions. Second operand 12 states. [2019-12-27 21:44:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:39,417 INFO L93 Difference]: Finished difference Result 224131 states and 682749 transitions. [2019-12-27 21:44:39,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-27 21:44:39,419 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 21:44:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:39,695 INFO L225 Difference]: With dead ends: 224131 [2019-12-27 21:44:39,695 INFO L226 Difference]: Without dead ends: 162190 [2019-12-27 21:44:39,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1029, Invalid=3941, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 21:44:40,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162190 states. [2019-12-27 21:44:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162190 to 32715. [2019-12-27 21:44:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32715 states. [2019-12-27 21:44:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32715 states to 32715 states and 103744 transitions. [2019-12-27 21:44:41,688 INFO L78 Accepts]: Start accepts. Automaton has 32715 states and 103744 transitions. Word has length 65 [2019-12-27 21:44:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:41,688 INFO L462 AbstractCegarLoop]: Abstraction has 32715 states and 103744 transitions. [2019-12-27 21:44:41,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:44:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 32715 states and 103744 transitions. [2019-12-27 21:44:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:44:41,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:41,730 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 21:44:41,730 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:41,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:41,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1693200707, now seen corresponding path program 1 times [2019-12-27 21:44:41,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:41,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762041992] [2019-12-27 21:44:41,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:41,783 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 21:44:41,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762041992] [2019-12-27 21:44:41,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:41,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:44:41,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [371546377] [2019-12-27 21:44:41,784 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:41,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:42,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 248 states and 404 transitions. [2019-12-27 21:44:42,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:42,003 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:42,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:44:42,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:42,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:44:42,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:44:42,003 INFO L87 Difference]: Start difference. First operand 32715 states and 103744 transitions. Second operand 3 states. [2019-12-27 21:44:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:42,109 INFO L93 Difference]: Finished difference Result 32715 states and 103743 transitions. [2019-12-27 21:44:42,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:44:42,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:44:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:42,160 INFO L225 Difference]: With dead ends: 32715 [2019-12-27 21:44:42,160 INFO L226 Difference]: Without dead ends: 32715 [2019-12-27 21:44:42,160 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 21:44:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32715 states. [2019-12-27 21:44:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32715 to 29094. [2019-12-27 21:44:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29094 states. [2019-12-27 21:44:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 93613 transitions. [2019-12-27 21:44:42,901 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 93613 transitions. Word has length 65 [2019-12-27 21:44:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:42,901 INFO L462 AbstractCegarLoop]: Abstraction has 29094 states and 93613 transitions. [2019-12-27 21:44:42,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:44:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 93613 transitions. [2019-12-27 21:44:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:44:42,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:42,935 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 21:44:42,935 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:42,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:42,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1932921264, now seen corresponding path program 1 times [2019-12-27 21:44:42,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:42,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860637958] [2019-12-27 21:44:42,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:43,012 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 21:44:43,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860637958] [2019-12-27 21:44:43,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:43,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:44:43,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1834649987] [2019-12-27 21:44:43,013 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:43,031 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:43,273 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 381 transitions. [2019-12-27 21:44:43,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:43,273 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:43,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:44:43,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:43,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:44:43,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:44:43,274 INFO L87 Difference]: Start difference. First operand 29094 states and 93613 transitions. Second operand 3 states. [2019-12-27 21:44:43,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:43,365 INFO L93 Difference]: Finished difference Result 26875 states and 84027 transitions. [2019-12-27 21:44:43,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:44:43,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 21:44:43,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:43,404 INFO L225 Difference]: With dead ends: 26875 [2019-12-27 21:44:43,404 INFO L226 Difference]: Without dead ends: 26875 [2019-12-27 21:44:43,404 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 21:44:43,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26875 states. [2019-12-27 21:44:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26875 to 25689. [2019-12-27 21:44:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25689 states. [2019-12-27 21:44:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25689 states to 25689 states and 80143 transitions. [2019-12-27 21:44:43,786 INFO L78 Accepts]: Start accepts. Automaton has 25689 states and 80143 transitions. Word has length 66 [2019-12-27 21:44:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:43,786 INFO L462 AbstractCegarLoop]: Abstraction has 25689 states and 80143 transitions. [2019-12-27 21:44:43,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:44:43,786 INFO L276 IsEmpty]: Start isEmpty. Operand 25689 states and 80143 transitions. [2019-12-27 21:44:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:44:43,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:43,814 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 21:44:43,814 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:43,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:43,815 INFO L82 PathProgramCache]: Analyzing trace with hash 51652252, now seen corresponding path program 1 times [2019-12-27 21:44:43,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:43,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849352563] [2019-12-27 21:44:43,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:44,001 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 21:44:44,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849352563] [2019-12-27 21:44:44,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:44,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:44:44,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1665255437] [2019-12-27 21:44:44,002 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:44,021 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:44,232 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 326 transitions. [2019-12-27 21:44:44,232 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:44,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:44,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:44,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:44,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:44,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 21:44:44,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 21:44:44,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:44,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 21:44:44,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:44:44,964 INFO L87 Difference]: Start difference. First operand 25689 states and 80143 transitions. Second operand 19 states. [2019-12-27 21:44:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:47,140 INFO L93 Difference]: Finished difference Result 56421 states and 175109 transitions. [2019-12-27 21:44:47,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 21:44:47,141 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 21:44:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:47,207 INFO L225 Difference]: With dead ends: 56421 [2019-12-27 21:44:47,207 INFO L226 Difference]: Without dead ends: 43572 [2019-12-27 21:44:47,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=307, Invalid=1333, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 21:44:47,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43572 states. [2019-12-27 21:44:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43572 to 25881. [2019-12-27 21:44:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25881 states. [2019-12-27 21:44:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25881 states to 25881 states and 80159 transitions. [2019-12-27 21:44:47,735 INFO L78 Accepts]: Start accepts. Automaton has 25881 states and 80159 transitions. Word has length 67 [2019-12-27 21:44:47,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:47,735 INFO L462 AbstractCegarLoop]: Abstraction has 25881 states and 80159 transitions. [2019-12-27 21:44:47,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 21:44:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 25881 states and 80159 transitions. [2019-12-27 21:44:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:44:47,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:47,766 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 21:44:47,766 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:47,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:47,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1110522546, now seen corresponding path program 2 times [2019-12-27 21:44:47,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:47,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711778860] [2019-12-27 21:44:47,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:47,990 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 21:44:47,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711778860] [2019-12-27 21:44:47,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:47,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:44:47,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1574578198] [2019-12-27 21:44:47,991 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:48,009 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:48,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 226 states and 414 transitions. [2019-12-27 21:44:48,190 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:48,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:48,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:48,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:48,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:48,783 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 21:44:48,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 21:44:48,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 21:44:48,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-12-27 21:44:48,784 INFO L87 Difference]: Start difference. First operand 25881 states and 80159 transitions. Second operand 21 states. [2019-12-27 21:44:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:50,662 INFO L93 Difference]: Finished difference Result 43975 states and 135317 transitions. [2019-12-27 21:44:50,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 21:44:50,663 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 21:44:50,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:50,726 INFO L225 Difference]: With dead ends: 43975 [2019-12-27 21:44:50,726 INFO L226 Difference]: Without dead ends: 43077 [2019-12-27 21:44:50,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 11 SyntacticMatches, 12 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 21:44:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43077 states. [2019-12-27 21:44:51,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43077 to 25351. [2019-12-27 21:44:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25351 states. [2019-12-27 21:44:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25351 states to 25351 states and 78687 transitions. [2019-12-27 21:44:51,210 INFO L78 Accepts]: Start accepts. Automaton has 25351 states and 78687 transitions. Word has length 67 [2019-12-27 21:44:51,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:51,211 INFO L462 AbstractCegarLoop]: Abstraction has 25351 states and 78687 transitions. [2019-12-27 21:44:51,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 21:44:51,211 INFO L276 IsEmpty]: Start isEmpty. Operand 25351 states and 78687 transitions. [2019-12-27 21:44:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:44:51,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:51,237 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 21:44:51,237 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:51,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:51,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1668712667, now seen corresponding path program 1 times [2019-12-27 21:44:51,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:51,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380299812] [2019-12-27 21:44:51,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:51,303 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 21:44:51,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380299812] [2019-12-27 21:44:51,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:51,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:44:51,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1063998762] [2019-12-27 21:44:51,304 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:51,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:51,580 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 412 transitions. [2019-12-27 21:44:51,580 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:51,600 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:44:51,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:44:51,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:51,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:44:51,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:44:51,601 INFO L87 Difference]: Start difference. First operand 25351 states and 78687 transitions. Second operand 4 states. [2019-12-27 21:44:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:51,755 INFO L93 Difference]: Finished difference Result 25351 states and 78492 transitions. [2019-12-27 21:44:51,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:44:51,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 21:44:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:51,791 INFO L225 Difference]: With dead ends: 25351 [2019-12-27 21:44:51,792 INFO L226 Difference]: Without dead ends: 25351 [2019-12-27 21:44:51,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 7 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 21:44:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25351 states. [2019-12-27 21:44:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25351 to 22046. [2019-12-27 21:44:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22046 states. [2019-12-27 21:44:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22046 states to 22046 states and 68512 transitions. [2019-12-27 21:44:52,156 INFO L78 Accepts]: Start accepts. Automaton has 22046 states and 68512 transitions. Word has length 67 [2019-12-27 21:44:52,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:52,156 INFO L462 AbstractCegarLoop]: Abstraction has 22046 states and 68512 transitions. [2019-12-27 21:44:52,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:44:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 22046 states and 68512 transitions. [2019-12-27 21:44:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:44:52,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:52,178 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 21:44:52,178 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:52,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:52,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1370876380, now seen corresponding path program 3 times [2019-12-27 21:44:52,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:52,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109798988] [2019-12-27 21:44:52,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:44:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:44:52,289 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:44:52,290 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:44:52,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~z$w_buff0_used~0_115 0) (= v_~main$tmp_guard0~0_10 0) (= v_~z$r_buff0_thd3~0_76 0) (= v_~main$tmp_guard1~0_16 0) (= v_~z$r_buff0_thd0~0_20 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~z~0_28 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1495~0.base_24| 4)) (= 0 v_~z$w_buff1~0_28) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed~0_6 0) (= 0 v_~z$r_buff1_thd3~0_51) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1495~0.base_24| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1495~0.base_24|) |v_ULTIMATE.start_main_~#t1495~0.offset_18| 0)) |v_#memory_int_19|) (= 0 v_~z$r_buff1_thd1~0_18) (= 0 |v_ULTIMATE.start_main_~#t1495~0.offset_18|) (= v_~y~0_16 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1495~0.base_24|) 0) (= v_~x~0_17 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~z$r_buff1_thd0~0_23) (= 0 v_~weak$$choice0~0_7) (= v_~z$mem_tmp~0_10 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$w_buff1_used~0_78) (= 0 v_~__unbuffered_p2_EAX~0_14) (= (store .cse0 |v_ULTIMATE.start_main_~#t1495~0.base_24| 1) |v_#valid_60|) (= 0 v_~weak$$choice2~0_31) (= 0 v_~z$w_buff0~0_29) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1495~0.base_24|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1496~0.base=|v_ULTIMATE.start_main_~#t1496~0.base_24|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_~#t1497~0.offset=|v_ULTIMATE.start_main_~#t1497~0.offset_14|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_28, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~y~0=v_~y~0_16, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_~#t1496~0.offset=|v_ULTIMATE.start_main_~#t1496~0.offset_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_29, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_51, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t1497~0.base=|v_ULTIMATE.start_main_~#t1497~0.base_17|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1495~0.offset=|v_ULTIMATE.start_main_~#t1495~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_60|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1495~0.base=|v_ULTIMATE.start_main_~#t1495~0.base_24|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_76, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1496~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1497~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1496~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1497~0.base, #NULL.base, ULTIMATE.start_main_~#t1495~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_~#t1495~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 21:44:52,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L818-1-->L820: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1496~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1496~0.base_13|)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1496~0.base_13|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1496~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1496~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1496~0.base_13|) |v_ULTIMATE.start_main_~#t1496~0.offset_11| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1496~0.offset_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1496~0.base_13| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1496~0.base=|v_ULTIMATE.start_main_~#t1496~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1496~0.offset=|v_ULTIMATE.start_main_~#t1496~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1496~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1496~0.offset] because there is no mapped edge [2019-12-27 21:44:52,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1497~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1497~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1497~0.base_13|) |v_ULTIMATE.start_main_~#t1497~0.offset_11| 2)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1497~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1497~0.base_13| 4)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1497~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1497~0.offset_11| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1497~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1497~0.offset=|v_ULTIMATE.start_main_~#t1497~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1497~0.base=|v_ULTIMATE.start_main_~#t1497~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1497~0.offset, #length, ULTIMATE.start_main_~#t1497~0.base] because there is no mapped edge [2019-12-27 21:44:52,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_16 v_~z$w_buff1~0_17) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 1 v_~z$w_buff0~0_15) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_86 v_~z$w_buff1_used~0_59) (= (mod v_~z$w_buff1_used~0_59 256) 0) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_85 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_86, ~z$w_buff0~0=v_~z$w_buff0~0_16, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_85, ~z$w_buff0~0=v_~z$w_buff0~0_15, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_59, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_17, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 21:44:52,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L784-->L784-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-661606223 256)))) (or (and (= ~z$w_buff0~0_In-661606223 |P2Thread1of1ForFork2_#t~ite21_Out-661606223|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite20_In-661606223| |P2Thread1of1ForFork2_#t~ite20_Out-661606223|)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-661606223| |P2Thread1of1ForFork2_#t~ite21_Out-661606223|) (= |P2Thread1of1ForFork2_#t~ite20_Out-661606223| ~z$w_buff0~0_In-661606223) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-661606223 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-661606223 256)) (and (= 0 (mod ~z$w_buff1_used~0_In-661606223 256)) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-661606223 256) 0))))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-661606223, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-661606223, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In-661606223|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-661606223, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-661606223, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-661606223, ~weak$$choice2~0=~weak$$choice2~0_In-661606223} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-661606223, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-661606223|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-661606223, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out-661606223|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-661606223, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-661606223, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-661606223, ~weak$$choice2~0=~weak$$choice2~0_In-661606223} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 21:44:52,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L762-2-->L762-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1747091702 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1747091702 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite10_Out-1747091702| |P1Thread1of1ForFork1_#t~ite9_Out-1747091702|))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1747091702 |P1Thread1of1ForFork1_#t~ite9_Out-1747091702|) .cse1 (not .cse2)) (and (= ~z~0_In-1747091702 |P1Thread1of1ForFork1_#t~ite9_Out-1747091702|) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1747091702, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1747091702, ~z$w_buff1~0=~z$w_buff1~0_In-1747091702, ~z~0=~z~0_In-1747091702} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1747091702|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1747091702, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1747091702, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1747091702|, ~z$w_buff1~0=~z$w_buff1~0_In-1747091702, ~z~0=~z~0_In-1747091702} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 21:44:52,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L743-->L743-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1784624506 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1784624506 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1784624506 |P0Thread1of1ForFork0_#t~ite5_Out-1784624506|)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1784624506| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1784624506, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1784624506} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1784624506|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1784624506, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1784624506} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:44:52,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1837230817 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1837230817 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1837230817 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1837230817 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1837230817| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1837230817| ~z$w_buff1_used~0_In-1837230817)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1837230817, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1837230817, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1837230817, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1837230817} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1837230817|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1837230817, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1837230817, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1837230817, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1837230817} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:44:52,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-2065709594 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2065709594 256)))) (or (and (= ~z$r_buff0_thd1~0_In-2065709594 ~z$r_buff0_thd1~0_Out-2065709594) (or .cse0 .cse1)) (and (= ~z$r_buff0_thd1~0_Out-2065709594 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2065709594, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2065709594} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2065709594, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2065709594|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2065709594} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:44:52,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In998832064 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In998832064 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out998832064| ~z$w_buff0_used~0_In998832064) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out998832064| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In998832064, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In998832064} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In998832064, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out998832064|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In998832064} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:44:52,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L764-->L764-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1985386423 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1985386423 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1985386423 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-1985386423 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-1985386423| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out-1985386423| ~z$w_buff1_used~0_In-1985386423) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1985386423, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1985386423, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1985386423, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1985386423} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1985386423, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1985386423, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1985386423, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1985386423|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1985386423} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:44:52,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In93618007 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In93618007 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out93618007| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out93618007| ~z$r_buff0_thd2~0_In93618007)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In93618007, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In93618007} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In93618007, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out93618007|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In93618007} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 21:44:52,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In-1697363664 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1697363664 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1697363664 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1697363664 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1697363664| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-1697363664 |P1Thread1of1ForFork1_#t~ite14_Out-1697363664|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1697363664, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1697363664, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1697363664, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1697363664} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1697363664, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1697363664, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1697363664, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1697363664|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1697363664} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:44:52,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:44:52,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L788-->L789: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd3~0_64 v_~z$r_buff0_thd3~0_63)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 21:44:52,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L789-->L789-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1976143499 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite35_Out1976143499| ~z$r_buff1_thd3~0_In1976143499) (= |P2Thread1of1ForFork2_#t~ite35_Out1976143499| |P2Thread1of1ForFork2_#t~ite36_Out1976143499|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1976143499 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1976143499 256)) (and (= (mod ~z$w_buff1_used~0_In1976143499 256) 0) .cse0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1976143499 256)) .cse0))) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite35_In1976143499| |P2Thread1of1ForFork2_#t~ite35_Out1976143499|) (not .cse1) (= ~z$r_buff1_thd3~0_In1976143499 |P2Thread1of1ForFork2_#t~ite36_Out1976143499|)))) InVars {P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_In1976143499|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1976143499, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1976143499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1976143499, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1976143499, ~weak$$choice2~0=~weak$$choice2~0_In1976143499} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out1976143499|, P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out1976143499|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1976143499, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1976143499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1976143499, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1976143499, ~weak$$choice2~0=~weak$$choice2~0_In1976143499} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35, P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 21:44:52,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L791-->L795: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:44:52,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-2-->L795-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-1429058328 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1429058328 256) 0)) (.cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out-1429058328| |P2Thread1of1ForFork2_#t~ite39_Out-1429058328|))) (or (and (not .cse0) .cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out-1429058328| ~z$w_buff1~0_In-1429058328) (not .cse2)) (and (or .cse2 .cse0) .cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out-1429058328| ~z~0_In-1429058328)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1429058328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1429058328, ~z$w_buff1~0=~z$w_buff1~0_In-1429058328, ~z~0=~z~0_In-1429058328} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1429058328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1429058328, ~z$w_buff1~0=~z$w_buff1~0_In-1429058328, ~z~0=~z~0_In-1429058328, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1429058328|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1429058328|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 21:44:52,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1805343665 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1805343665 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out-1805343665| 0)) (and (= |P2Thread1of1ForFork2_#t~ite40_Out-1805343665| ~z$w_buff0_used~0_In-1805343665) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1805343665, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1805343665} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1805343665, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1805343665, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1805343665|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 21:44:52,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In863809927 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In863809927 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In863809927 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In863809927 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite41_Out863809927| ~z$w_buff1_used~0_In863809927) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite41_Out863809927| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In863809927, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In863809927, ~z$w_buff1_used~0=~z$w_buff1_used~0_In863809927, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In863809927} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out863809927|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In863809927, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In863809927, ~z$w_buff1_used~0=~z$w_buff1_used~0_In863809927, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In863809927} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 21:44:52,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1897900142 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1897900142 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-1897900142|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In-1897900142 |P2Thread1of1ForFork2_#t~ite42_Out-1897900142|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1897900142, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1897900142} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1897900142|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1897900142, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1897900142} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 21:44:52,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In-1016951385 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1016951385 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1016951385 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1016951385 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out-1016951385|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd3~0_In-1016951385 |P2Thread1of1ForFork2_#t~ite43_Out-1016951385|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1016951385, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1016951385, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1016951385, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1016951385} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1016951385, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1016951385, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1016951385|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1016951385, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1016951385} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 21:44:52,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_44) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 21:44:52,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1129304969 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1129304969 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1129304969 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1129304969 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1129304969| ~z$r_buff1_thd1~0_In-1129304969) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1129304969| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1129304969, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1129304969, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1129304969, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1129304969} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1129304969, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1129304969|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1129304969, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1129304969, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1129304969} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:44:52,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:44:52,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L822-1-->L828: 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~nondet46=|v_ULTIMATE.start_main_#t~nondet46_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~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:44:52,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L828-2-->L828-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-211157370 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out-211157370| |ULTIMATE.start_main_#t~ite48_Out-211157370|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-211157370 256) 0))) (or (and (= ~z~0_In-211157370 |ULTIMATE.start_main_#t~ite47_Out-211157370|) (or .cse0 .cse1) .cse2) (and (not .cse0) .cse2 (not .cse1) (= ~z$w_buff1~0_In-211157370 |ULTIMATE.start_main_#t~ite47_Out-211157370|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-211157370, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-211157370, ~z$w_buff1~0=~z$w_buff1~0_In-211157370, ~z~0=~z~0_In-211157370} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-211157370, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-211157370|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-211157370, ~z$w_buff1~0=~z$w_buff1~0_In-211157370, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-211157370|, ~z~0=~z~0_In-211157370} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 21:44:52,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In656324531 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In656324531 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out656324531| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out656324531| ~z$w_buff0_used~0_In656324531) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In656324531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In656324531} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In656324531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In656324531, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out656324531|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 21:44:52,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1382035322 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1382035322 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1382035322 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1382035322 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out-1382035322| ~z$w_buff1_used~0_In-1382035322)) (and (= |ULTIMATE.start_main_#t~ite50_Out-1382035322| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1382035322, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1382035322, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1382035322, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1382035322} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1382035322|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1382035322, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1382035322, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1382035322, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1382035322} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 21:44:52,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In374414088 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In374414088 256)))) (or (and (= ~z$r_buff0_thd0~0_In374414088 |ULTIMATE.start_main_#t~ite51_Out374414088|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out374414088| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In374414088, ~z$w_buff0_used~0=~z$w_buff0_used~0_In374414088} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In374414088, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out374414088|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In374414088} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 21:44:52,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In1494375568 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1494375568 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1494375568 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1494375568 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out1494375568|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1494375568 |ULTIMATE.start_main_#t~ite52_Out1494375568|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1494375568, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1494375568, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1494375568, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1494375568} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1494375568|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1494375568, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1494375568, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1494375568, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1494375568} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 21:44:52,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_10 0) (= v_~y~0_10 2) (= v_~__unbuffered_p2_EAX~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~x~0_11 2) (= |v_ULTIMATE.start_main_#t~ite52_13| v_~z$r_buff1_thd0~0_16)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_10, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_10, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:44:52,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:44:52 BasicIcfg [2019-12-27 21:44:52,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:44:52,443 INFO L168 Benchmark]: Toolchain (without parser) took 118409.11 ms. Allocated memory was 136.8 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 100.2 MB in the beginning and 957.2 MB in the end (delta: -857.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 21:44:52,444 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:44:52,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.26 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 153.9 MB in the end (delta: -54.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:44:52,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.49 ms. Allocated memory is still 200.8 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:44:52,445 INFO L168 Benchmark]: Boogie Preprocessor took 55.21 ms. Allocated memory is still 200.8 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:44:52,445 INFO L168 Benchmark]: RCFGBuilder took 988.41 ms. Allocated memory is still 200.8 MB. Free memory was 149.2 MB in the beginning and 99.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:44:52,446 INFO L168 Benchmark]: TraceAbstraction took 116529.07 ms. Allocated memory was 200.8 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.8 MB in the beginning and 957.2 MB in the end (delta: -858.4 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 21:44:52,451 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.24 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 765.26 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 153.9 MB in the end (delta: -54.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.49 ms. Allocated memory is still 200.8 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.21 ms. Allocated memory is still 200.8 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 988.41 ms. Allocated memory is still 200.8 MB. Free memory was 149.2 MB in the beginning and 99.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 116529.07 ms. Allocated memory was 200.8 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.8 MB in the beginning and 957.2 MB in the end (delta: -858.4 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 174 ProgramPointsBefore, 95 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 30 ChoiceCompositions, 6362 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81192 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1495, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] FCALL, FORK 0 pthread_create(&t1496, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1497, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 z$flush_delayed = weak$$choice2 [L782] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L784] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L785] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L786] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L787] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 116.1s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 41.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7114 SDtfs, 12917 SDslu, 26769 SDs, 0 SdLazy, 13776 SolverSat, 615 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 609 GetRequests, 162 SyntacticMatches, 79 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3476 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154366occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 504661 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1234 NumberOfCodeBlocks, 1234 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1139 ConstructedInterpolants, 0 QuantifiedInterpolants, 179101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...