/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:01:09,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:01:09,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:01:09,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:01:09,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:01:09,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:01:09,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:01:09,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:01:09,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:01:09,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:01:09,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:01:09,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:01:09,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:01:09,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:01:09,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:01:09,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:01:09,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:01:09,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:01:09,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:01:09,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:01:09,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:01:09,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:01:09,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:01:09,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:01:09,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:01:09,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:01:09,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:01:09,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:01:09,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:01:09,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:01:09,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:01:09,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:01:09,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:01:09,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:01:09,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:01:09,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:01:09,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:01:09,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:01:09,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:01:09,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:01:09,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:01:09,756 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:01:09,770 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:01:09,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:01:09,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:01:09,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:01:09,772 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:01:09,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:01:09,773 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:01:09,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:01:09,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:01:09,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:01:09,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:01:09,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:01:09,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:01:09,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:01:09,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:01:09,775 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:01:09,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:01:09,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:01:09,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:01:09,776 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:01:09,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:01:09,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:01:09,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:01:09,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:01:09,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:01:09,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:01:09,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:01:09,777 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:01:09,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:01:09,778 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:01:09,778 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:01:10,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:01:10,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:01:10,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:01:10,129 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:01:10,130 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:01:10,131 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_tso.oepc.i [2019-12-27 16:01:10,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c304cb634/a5f5f629bf7944968026f33d91a8a93e/FLAGde66a9930 [2019-12-27 16:01:10,751 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:01:10,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_tso.oepc.i [2019-12-27 16:01:10,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c304cb634/a5f5f629bf7944968026f33d91a8a93e/FLAGde66a9930 [2019-12-27 16:01:11,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c304cb634/a5f5f629bf7944968026f33d91a8a93e [2019-12-27 16:01:11,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:01:11,024 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:01:11,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:01:11,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:01:11,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:01:11,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:01:11" (1/1) ... [2019-12-27 16:01:11,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23fa2683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:11, skipping insertion in model container [2019-12-27 16:01:11,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:01:11" (1/1) ... [2019-12-27 16:01:11,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:01:11,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:01:11,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:01:11,653 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:01:11,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:01:11,812 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:01:11,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:11 WrapperNode [2019-12-27 16:01:11,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:01:11,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:01:11,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:01:11,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:01:11,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:11" (1/1) ... [2019-12-27 16:01:11,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:11" (1/1) ... [2019-12-27 16:01:11,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:01:11,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:01:11,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:01:11,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:01:11,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:11" (1/1) ... [2019-12-27 16:01:11,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:11" (1/1) ... [2019-12-27 16:01:11,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:11" (1/1) ... [2019-12-27 16:01:11,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:11" (1/1) ... [2019-12-27 16:01:11,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:11" (1/1) ... [2019-12-27 16:01:11,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:11" (1/1) ... [2019-12-27 16:01:11,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:11" (1/1) ... [2019-12-27 16:01:11,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:01:11,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:01:11,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:01:11,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:01:11,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:01:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:01:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:01:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:01:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:01:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:01:12,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:01:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:01:12,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:01:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:01:12,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:01:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:01:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:01:12,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:01:12,008 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 16:01:12,792 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:01:12,793 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:01:12,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:01:12 BoogieIcfgContainer [2019-12-27 16:01:12,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:01:12,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:01:12,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:01:12,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:01:12,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:01:11" (1/3) ... [2019-12-27 16:01:12,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af7f125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:01:12, skipping insertion in model container [2019-12-27 16:01:12,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:11" (2/3) ... [2019-12-27 16:01:12,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af7f125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:01:12, skipping insertion in model container [2019-12-27 16:01:12,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:01:12" (3/3) ... [2019-12-27 16:01:12,803 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_tso.oepc.i [2019-12-27 16:01:12,814 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:01:12,814 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:01:12,822 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:01:12,823 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:01:12,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,867 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,867 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,867 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,868 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,869 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,916 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,917 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,960 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,962 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,977 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,978 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,978 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:12,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:13,002 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:01:13,024 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:01:13,024 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:01:13,024 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:01:13,025 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:01:13,025 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:01:13,025 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:01:13,025 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:01:13,025 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:01:13,046 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 16:01:13,048 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 16:01:13,186 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 16:01:13,187 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:01:13,205 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:01:13,228 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 16:01:13,307 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 16:01:13,307 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:01:13,315 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:01:13,337 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:01:13,338 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:01:18,595 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 16:01:18,725 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 16:01:18,856 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80759 [2019-12-27 16:01:18,856 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 16:01:18,860 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 102 transitions [2019-12-27 16:01:37,215 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118022 states. [2019-12-27 16:01:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 118022 states. [2019-12-27 16:01:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:01:37,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:37,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:01:37,223 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 16:01:37,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:37,227 INFO L82 PathProgramCache]: Analyzing trace with hash 922782, now seen corresponding path program 1 times [2019-12-27 16:01:37,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:37,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845607637] [2019-12-27 16:01:37,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:37,472 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 16:01:37,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845607637] [2019-12-27 16:01:37,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:37,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:01:37,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1971914939] [2019-12-27 16:01:37,477 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:37,482 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:37,494 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:01:37,494 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:37,498 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:01:37,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:01:37,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:37,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:01:37,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:01:37,516 INFO L87 Difference]: Start difference. First operand 118022 states. Second operand 3 states. [2019-12-27 16:01:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:39,215 INFO L93 Difference]: Finished difference Result 116858 states and 495582 transitions. [2019-12-27 16:01:39,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:01:39,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:01:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:43,377 INFO L225 Difference]: With dead ends: 116858 [2019-12-27 16:01:43,378 INFO L226 Difference]: Without dead ends: 110138 [2019-12-27 16:01:43,379 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 16:01:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110138 states. [2019-12-27 16:01:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110138 to 110138. [2019-12-27 16:01:53,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110138 states. [2019-12-27 16:01:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110138 states to 110138 states and 466462 transitions. [2019-12-27 16:01:54,147 INFO L78 Accepts]: Start accepts. Automaton has 110138 states and 466462 transitions. Word has length 3 [2019-12-27 16:01:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:54,148 INFO L462 AbstractCegarLoop]: Abstraction has 110138 states and 466462 transitions. [2019-12-27 16:01:54,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:01:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 110138 states and 466462 transitions. [2019-12-27 16:01:54,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:01:54,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:54,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:01:54,151 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 16:01:54,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:54,151 INFO L82 PathProgramCache]: Analyzing trace with hash 228105342, now seen corresponding path program 1 times [2019-12-27 16:01:54,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:54,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920295768] [2019-12-27 16:01:54,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:54,255 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 16:01:54,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920295768] [2019-12-27 16:01:54,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:54,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:01:54,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [116288967] [2019-12-27 16:01:54,256 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:54,257 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:54,260 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:01:54,261 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:54,261 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:01:54,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:01:54,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:54,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:01:54,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:01:54,263 INFO L87 Difference]: Start difference. First operand 110138 states and 466462 transitions. Second operand 4 states. [2019-12-27 16:01:59,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:59,578 INFO L93 Difference]: Finished difference Result 170904 states and 695583 transitions. [2019-12-27 16:01:59,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:01:59,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:01:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:00,095 INFO L225 Difference]: With dead ends: 170904 [2019-12-27 16:02:00,095 INFO L226 Difference]: Without dead ends: 170855 [2019-12-27 16:02:00,096 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 16:02:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170855 states. [2019-12-27 16:02:09,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170855 to 156295. [2019-12-27 16:02:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156295 states. [2019-12-27 16:02:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156295 states to 156295 states and 644009 transitions. [2019-12-27 16:02:09,972 INFO L78 Accepts]: Start accepts. Automaton has 156295 states and 644009 transitions. Word has length 11 [2019-12-27 16:02:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:09,973 INFO L462 AbstractCegarLoop]: Abstraction has 156295 states and 644009 transitions. [2019-12-27 16:02:09,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:02:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 156295 states and 644009 transitions. [2019-12-27 16:02:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:02:09,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:09,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:09,981 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 16:02:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:09,981 INFO L82 PathProgramCache]: Analyzing trace with hash 891607686, now seen corresponding path program 1 times [2019-12-27 16:02:09,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:09,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191147286] [2019-12-27 16:02:09,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:10,066 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 16:02:10,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191147286] [2019-12-27 16:02:10,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:10,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:10,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [567075435] [2019-12-27 16:02:10,067 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:10,069 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:10,070 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:02:10,070 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:10,071 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:10,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:10,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:10,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:10,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:10,072 INFO L87 Difference]: Start difference. First operand 156295 states and 644009 transitions. Second operand 3 states. [2019-12-27 16:02:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:14,760 INFO L93 Difference]: Finished difference Result 33673 states and 108735 transitions. [2019-12-27 16:02:14,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:14,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:02:14,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:14,890 INFO L225 Difference]: With dead ends: 33673 [2019-12-27 16:02:14,890 INFO L226 Difference]: Without dead ends: 33673 [2019-12-27 16:02:14,891 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 16:02:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33673 states. [2019-12-27 16:02:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33673 to 33673. [2019-12-27 16:02:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33673 states. [2019-12-27 16:02:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33673 states to 33673 states and 108735 transitions. [2019-12-27 16:02:15,650 INFO L78 Accepts]: Start accepts. Automaton has 33673 states and 108735 transitions. Word has length 13 [2019-12-27 16:02:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:15,651 INFO L462 AbstractCegarLoop]: Abstraction has 33673 states and 108735 transitions. [2019-12-27 16:02:15,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 33673 states and 108735 transitions. [2019-12-27 16:02:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:02:15,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:15,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:15,654 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 16:02:15,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:15,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1993825600, now seen corresponding path program 1 times [2019-12-27 16:02:15,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:15,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846771243] [2019-12-27 16:02:15,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:15,746 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 16:02:15,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846771243] [2019-12-27 16:02:15,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:15,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:15,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1070334997] [2019-12-27 16:02:15,748 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:15,750 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:15,753 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:02:15,753 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:15,753 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:15,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:02:15,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:15,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:02:15,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:02:15,755 INFO L87 Difference]: Start difference. First operand 33673 states and 108735 transitions. Second operand 4 states. [2019-12-27 16:02:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:16,136 INFO L93 Difference]: Finished difference Result 42056 states and 135369 transitions. [2019-12-27 16:02:16,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:02:16,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:02:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:16,243 INFO L225 Difference]: With dead ends: 42056 [2019-12-27 16:02:16,243 INFO L226 Difference]: Without dead ends: 42056 [2019-12-27 16:02:16,243 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 16:02:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42056 states. [2019-12-27 16:02:17,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42056 to 37770. [2019-12-27 16:02:17,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37770 states. [2019-12-27 16:02:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37770 states to 37770 states and 121950 transitions. [2019-12-27 16:02:17,233 INFO L78 Accepts]: Start accepts. Automaton has 37770 states and 121950 transitions. Word has length 16 [2019-12-27 16:02:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:17,234 INFO L462 AbstractCegarLoop]: Abstraction has 37770 states and 121950 transitions. [2019-12-27 16:02:17,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:02:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 37770 states and 121950 transitions. [2019-12-27 16:02:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:02:17,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:17,243 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 16:02:17,243 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 16:02:17,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:17,243 INFO L82 PathProgramCache]: Analyzing trace with hash 674854723, now seen corresponding path program 1 times [2019-12-27 16:02:17,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:17,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213189937] [2019-12-27 16:02:17,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:17,336 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 16:02:17,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213189937] [2019-12-27 16:02:17,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:17,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:17,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1032695691] [2019-12-27 16:02:17,338 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:17,342 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:17,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 64 transitions. [2019-12-27 16:02:17,351 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:17,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:02:17,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:02:17,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:17,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:02:17,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:17,355 INFO L87 Difference]: Start difference. First operand 37770 states and 121950 transitions. Second operand 5 states. [2019-12-27 16:02:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:17,967 INFO L93 Difference]: Finished difference Result 48537 states and 154193 transitions. [2019-12-27 16:02:17,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:02:17,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:02:17,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:18,083 INFO L225 Difference]: With dead ends: 48537 [2019-12-27 16:02:18,083 INFO L226 Difference]: Without dead ends: 48530 [2019-12-27 16:02:18,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 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 16:02:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48530 states. [2019-12-27 16:02:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48530 to 37459. [2019-12-27 16:02:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37459 states. [2019-12-27 16:02:19,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37459 states to 37459 states and 120776 transitions. [2019-12-27 16:02:19,220 INFO L78 Accepts]: Start accepts. Automaton has 37459 states and 120776 transitions. Word has length 22 [2019-12-27 16:02:19,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:19,220 INFO L462 AbstractCegarLoop]: Abstraction has 37459 states and 120776 transitions. [2019-12-27 16:02:19,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:02:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 37459 states and 120776 transitions. [2019-12-27 16:02:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:02:19,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:19,232 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 16:02:19,233 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 16:02:19,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:19,233 INFO L82 PathProgramCache]: Analyzing trace with hash 332765886, now seen corresponding path program 1 times [2019-12-27 16:02:19,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:19,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029119744] [2019-12-27 16:02:19,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:19,322 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 16:02:19,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029119744] [2019-12-27 16:02:19,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:19,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:19,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [567115848] [2019-12-27 16:02:19,323 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:19,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:19,336 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:02:19,336 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:19,368 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:02:19,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:02:19,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:19,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:02:19,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:19,369 INFO L87 Difference]: Start difference. First operand 37459 states and 120776 transitions. Second operand 5 states. [2019-12-27 16:02:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:19,451 INFO L93 Difference]: Finished difference Result 14576 states and 44297 transitions. [2019-12-27 16:02:19,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:02:19,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:02:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:19,475 INFO L225 Difference]: With dead ends: 14576 [2019-12-27 16:02:19,476 INFO L226 Difference]: Without dead ends: 14576 [2019-12-27 16:02:19,476 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 16:02:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2019-12-27 16:02:19,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14332. [2019-12-27 16:02:19,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14332 states. [2019-12-27 16:02:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14332 states to 14332 states and 43601 transitions. [2019-12-27 16:02:19,704 INFO L78 Accepts]: Start accepts. Automaton has 14332 states and 43601 transitions. Word has length 25 [2019-12-27 16:02:19,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:19,704 INFO L462 AbstractCegarLoop]: Abstraction has 14332 states and 43601 transitions. [2019-12-27 16:02:19,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:02:19,704 INFO L276 IsEmpty]: Start isEmpty. Operand 14332 states and 43601 transitions. [2019-12-27 16:02:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:02:19,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:19,714 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 16:02:19,714 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 16:02:19,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:19,715 INFO L82 PathProgramCache]: Analyzing trace with hash 445555351, now seen corresponding path program 1 times [2019-12-27 16:02:19,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:19,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830736787] [2019-12-27 16:02:19,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:19,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 16:02:19,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830736787] [2019-12-27 16:02:19,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:19,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:19,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1524897619] [2019-12-27 16:02:19,770 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:19,774 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:19,782 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:02:19,782 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:19,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:19,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:19,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:19,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:19,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:19,783 INFO L87 Difference]: Start difference. First operand 14332 states and 43601 transitions. Second operand 3 states. [2019-12-27 16:02:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:19,897 INFO L93 Difference]: Finished difference Result 22367 states and 67484 transitions. [2019-12-27 16:02:19,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:19,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:02:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:19,928 INFO L225 Difference]: With dead ends: 22367 [2019-12-27 16:02:19,929 INFO L226 Difference]: Without dead ends: 22367 [2019-12-27 16:02:19,929 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 16:02:20,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-27 16:02:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-27 16:02:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-27 16:02:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51830 transitions. [2019-12-27 16:02:20,224 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51830 transitions. Word has length 27 [2019-12-27 16:02:20,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:20,224 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51830 transitions. [2019-12-27 16:02:20,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51830 transitions. [2019-12-27 16:02:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:02:20,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:20,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] [2019-12-27 16:02:20,237 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 16:02:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:20,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1217095067, now seen corresponding path program 1 times [2019-12-27 16:02:20,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:20,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090203170] [2019-12-27 16:02:20,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:20,286 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 16:02:20,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090203170] [2019-12-27 16:02:20,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:20,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:20,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1852911961] [2019-12-27 16:02:20,287 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:20,292 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:20,299 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:02:20,299 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:20,300 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:20,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:20,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:20,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:20,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:20,301 INFO L87 Difference]: Start difference. First operand 16938 states and 51830 transitions. Second operand 3 states. [2019-12-27 16:02:20,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:20,398 INFO L93 Difference]: Finished difference Result 22367 states and 66493 transitions. [2019-12-27 16:02:20,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:20,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:02:20,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:20,428 INFO L225 Difference]: With dead ends: 22367 [2019-12-27 16:02:20,428 INFO L226 Difference]: Without dead ends: 22367 [2019-12-27 16:02:20,429 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 16:02:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-27 16:02:20,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-27 16:02:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-27 16:02:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 50839 transitions. [2019-12-27 16:02:20,886 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 50839 transitions. Word has length 27 [2019-12-27 16:02:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:20,886 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 50839 transitions. [2019-12-27 16:02:20,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 50839 transitions. [2019-12-27 16:02:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:02:20,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:20,899 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 16:02:20,899 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 16:02:20,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1361870049, now seen corresponding path program 1 times [2019-12-27 16:02:20,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:20,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296402436] [2019-12-27 16:02:20,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:20,988 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 16:02:20,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296402436] [2019-12-27 16:02:20,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:20,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:02:20,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [313832992] [2019-12-27 16:02:20,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:20,994 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:21,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:02:21,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:21,000 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:21,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:02:21,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:21,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:02:21,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:02:21,002 INFO L87 Difference]: Start difference. First operand 16938 states and 50839 transitions. Second operand 6 states. [2019-12-27 16:02:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:21,681 INFO L93 Difference]: Finished difference Result 31275 states and 92943 transitions. [2019-12-27 16:02:21,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:02:21,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 16:02:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:21,727 INFO L225 Difference]: With dead ends: 31275 [2019-12-27 16:02:21,727 INFO L226 Difference]: Without dead ends: 31275 [2019-12-27 16:02:21,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:02:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31275 states. [2019-12-27 16:02:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31275 to 19607. [2019-12-27 16:02:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19607 states. [2019-12-27 16:02:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 58673 transitions. [2019-12-27 16:02:22,109 INFO L78 Accepts]: Start accepts. Automaton has 19607 states and 58673 transitions. Word has length 27 [2019-12-27 16:02:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:22,109 INFO L462 AbstractCegarLoop]: Abstraction has 19607 states and 58673 transitions. [2019-12-27 16:02:22,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:02:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 19607 states and 58673 transitions. [2019-12-27 16:02:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:02:22,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:22,124 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 16:02:22,124 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 16:02:22,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:22,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2015671980, now seen corresponding path program 1 times [2019-12-27 16:02:22,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:22,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102196773] [2019-12-27 16:02:22,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:22,219 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 16:02:22,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102196773] [2019-12-27 16:02:22,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:22,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:02:22,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [694472883] [2019-12-27 16:02:22,220 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:22,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:22,236 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:02:22,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:22,237 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:22,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:02:22,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:22,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:02:22,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:02:22,238 INFO L87 Difference]: Start difference. First operand 19607 states and 58673 transitions. Second operand 6 states. [2019-12-27 16:02:22,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:22,935 INFO L93 Difference]: Finished difference Result 30618 states and 90299 transitions. [2019-12-27 16:02:22,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:02:22,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 16:02:22,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:22,986 INFO L225 Difference]: With dead ends: 30618 [2019-12-27 16:02:22,987 INFO L226 Difference]: Without dead ends: 30618 [2019-12-27 16:02:22,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:02:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30618 states. [2019-12-27 16:02:23,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30618 to 19271. [2019-12-27 16:02:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19271 states. [2019-12-27 16:02:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19271 states to 19271 states and 57577 transitions. [2019-12-27 16:02:23,643 INFO L78 Accepts]: Start accepts. Automaton has 19271 states and 57577 transitions. Word has length 28 [2019-12-27 16:02:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:23,643 INFO L462 AbstractCegarLoop]: Abstraction has 19271 states and 57577 transitions. [2019-12-27 16:02:23,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:02:23,643 INFO L276 IsEmpty]: Start isEmpty. Operand 19271 states and 57577 transitions. [2019-12-27 16:02:23,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:02:23,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:23,663 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 16:02:23,663 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 16:02:23,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:23,664 INFO L82 PathProgramCache]: Analyzing trace with hash 405285854, now seen corresponding path program 1 times [2019-12-27 16:02:23,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:23,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492784777] [2019-12-27 16:02:23,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:23,738 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 16:02:23,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492784777] [2019-12-27 16:02:23,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:23,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:23,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1453973968] [2019-12-27 16:02:23,739 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:23,745 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:23,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 76 transitions. [2019-12-27 16:02:23,763 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:23,768 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:02:23,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:02:23,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:23,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:02:23,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:23,770 INFO L87 Difference]: Start difference. First operand 19271 states and 57577 transitions. Second operand 5 states. [2019-12-27 16:02:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:24,246 INFO L93 Difference]: Finished difference Result 23829 states and 70169 transitions. [2019-12-27 16:02:24,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:02:24,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 16:02:24,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:24,291 INFO L225 Difference]: With dead ends: 23829 [2019-12-27 16:02:24,291 INFO L226 Difference]: Without dead ends: 23829 [2019-12-27 16:02:24,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 16:02:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23829 states. [2019-12-27 16:02:24,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23829 to 20047. [2019-12-27 16:02:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20047 states. [2019-12-27 16:02:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20047 states to 20047 states and 59899 transitions. [2019-12-27 16:02:24,683 INFO L78 Accepts]: Start accepts. Automaton has 20047 states and 59899 transitions. Word has length 33 [2019-12-27 16:02:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:24,684 INFO L462 AbstractCegarLoop]: Abstraction has 20047 states and 59899 transitions. [2019-12-27 16:02:24,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:02:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 20047 states and 59899 transitions. [2019-12-27 16:02:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:02:24,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:24,706 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 16:02:24,706 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 16:02:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1258895234, now seen corresponding path program 2 times [2019-12-27 16:02:24,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:24,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868755623] [2019-12-27 16:02:24,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:24,819 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 16:02:24,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868755623] [2019-12-27 16:02:24,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:24,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:02:24,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [136626129] [2019-12-27 16:02:24,820 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:24,827 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:24,846 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 70 transitions. [2019-12-27 16:02:24,847 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:24,848 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:02:24,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:02:24,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:24,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:02:24,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:02:24,849 INFO L87 Difference]: Start difference. First operand 20047 states and 59899 transitions. Second operand 7 states. [2019-12-27 16:02:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:26,142 INFO L93 Difference]: Finished difference Result 39715 states and 116920 transitions. [2019-12-27 16:02:26,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:02:26,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 16:02:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:26,202 INFO L225 Difference]: With dead ends: 39715 [2019-12-27 16:02:26,202 INFO L226 Difference]: Without dead ends: 39715 [2019-12-27 16:02:26,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 16:02:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39715 states. [2019-12-27 16:02:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39715 to 21295. [2019-12-27 16:02:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21295 states. [2019-12-27 16:02:26,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21295 states to 21295 states and 63643 transitions. [2019-12-27 16:02:26,658 INFO L78 Accepts]: Start accepts. Automaton has 21295 states and 63643 transitions. Word has length 33 [2019-12-27 16:02:26,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:26,659 INFO L462 AbstractCegarLoop]: Abstraction has 21295 states and 63643 transitions. [2019-12-27 16:02:26,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:02:26,659 INFO L276 IsEmpty]: Start isEmpty. Operand 21295 states and 63643 transitions. [2019-12-27 16:02:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:02:26,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:26,676 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 16:02:26,676 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 16:02:26,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:26,676 INFO L82 PathProgramCache]: Analyzing trace with hash -454706214, now seen corresponding path program 3 times [2019-12-27 16:02:26,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:26,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187354814] [2019-12-27 16:02:26,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:26,944 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 16:02:26,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187354814] [2019-12-27 16:02:26,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:26,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:02:26,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1516792871] [2019-12-27 16:02:26,945 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:26,951 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:26,975 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 94 transitions. [2019-12-27 16:02:26,975 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:26,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:27,011 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:02:27,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:02:27,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:27,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:02:27,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:02:27,012 INFO L87 Difference]: Start difference. First operand 21295 states and 63643 transitions. Second operand 9 states. [2019-12-27 16:02:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:29,952 INFO L93 Difference]: Finished difference Result 60787 states and 176481 transitions. [2019-12-27 16:02:29,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 16:02:29,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 16:02:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:30,043 INFO L225 Difference]: With dead ends: 60787 [2019-12-27 16:02:30,043 INFO L226 Difference]: Without dead ends: 60787 [2019-12-27 16:02:30,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=327, Invalid=1079, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 16:02:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60787 states. [2019-12-27 16:02:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60787 to 23978. [2019-12-27 16:02:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23978 states. [2019-12-27 16:02:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23978 states to 23978 states and 71675 transitions. [2019-12-27 16:02:30,708 INFO L78 Accepts]: Start accepts. Automaton has 23978 states and 71675 transitions. Word has length 33 [2019-12-27 16:02:30,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:30,708 INFO L462 AbstractCegarLoop]: Abstraction has 23978 states and 71675 transitions. [2019-12-27 16:02:30,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:02:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 23978 states and 71675 transitions. [2019-12-27 16:02:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:02:30,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:30,729 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 16:02:30,729 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 16:02:30,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:30,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1655017129, now seen corresponding path program 1 times [2019-12-27 16:02:30,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:30,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313710136] [2019-12-27 16:02:30,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:30,802 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 16:02:30,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313710136] [2019-12-27 16:02:30,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:30,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:02:30,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2073496412] [2019-12-27 16:02:30,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:30,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:30,826 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 71 transitions. [2019-12-27 16:02:30,827 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:30,828 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:02:30,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:02:30,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:30,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:02:30,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:02:30,829 INFO L87 Difference]: Start difference. First operand 23978 states and 71675 transitions. Second operand 7 states. [2019-12-27 16:02:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:32,149 INFO L93 Difference]: Finished difference Result 42400 states and 124554 transitions. [2019-12-27 16:02:32,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:02:32,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 16:02:32,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:32,210 INFO L225 Difference]: With dead ends: 42400 [2019-12-27 16:02:32,210 INFO L226 Difference]: Without dead ends: 42400 [2019-12-27 16:02:32,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 16:02:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42400 states. [2019-12-27 16:02:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42400 to 22695. [2019-12-27 16:02:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22695 states. [2019-12-27 16:02:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22695 states to 22695 states and 67928 transitions. [2019-12-27 16:02:32,684 INFO L78 Accepts]: Start accepts. Automaton has 22695 states and 67928 transitions. Word has length 34 [2019-12-27 16:02:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:32,685 INFO L462 AbstractCegarLoop]: Abstraction has 22695 states and 67928 transitions. [2019-12-27 16:02:32,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:02:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 22695 states and 67928 transitions. [2019-12-27 16:02:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:02:32,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:32,707 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 16:02:32,707 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 16:02:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:32,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2107636055, now seen corresponding path program 2 times [2019-12-27 16:02:32,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:32,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004450540] [2019-12-27 16:02:32,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:32,872 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 16:02:32,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004450540] [2019-12-27 16:02:32,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:32,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:02:32,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1533800954] [2019-12-27 16:02:32,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:32,880 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:32,904 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 98 transitions. [2019-12-27 16:02:32,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:32,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:32,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:32,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:32,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:02:32,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:02:32,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:32,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:02:32,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:02:32,943 INFO L87 Difference]: Start difference. First operand 22695 states and 67928 transitions. Second operand 10 states. [2019-12-27 16:02:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:36,032 INFO L93 Difference]: Finished difference Result 48538 states and 141209 transitions. [2019-12-27 16:02:36,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 16:02:36,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-27 16:02:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:36,107 INFO L225 Difference]: With dead ends: 48538 [2019-12-27 16:02:36,107 INFO L226 Difference]: Without dead ends: 48538 [2019-12-27 16:02:36,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 16:02:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48538 states. [2019-12-27 16:02:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48538 to 22438. [2019-12-27 16:02:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22438 states. [2019-12-27 16:02:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22438 states to 22438 states and 67104 transitions. [2019-12-27 16:02:36,821 INFO L78 Accepts]: Start accepts. Automaton has 22438 states and 67104 transitions. Word has length 34 [2019-12-27 16:02:36,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:36,821 INFO L462 AbstractCegarLoop]: Abstraction has 22438 states and 67104 transitions. [2019-12-27 16:02:36,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:02:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 22438 states and 67104 transitions. [2019-12-27 16:02:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:02:36,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:36,845 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 16:02:36,846 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 16:02:36,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:36,846 INFO L82 PathProgramCache]: Analyzing trace with hash -887512480, now seen corresponding path program 1 times [2019-12-27 16:02:36,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:36,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120850684] [2019-12-27 16:02:36,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:36,903 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 16:02:36,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120850684] [2019-12-27 16:02:36,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:36,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:36,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1259319626] [2019-12-27 16:02:36,904 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:36,912 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:36,970 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 339 transitions. [2019-12-27 16:02:36,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:36,986 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:02:36,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:02:36,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:36,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:02:36,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:36,987 INFO L87 Difference]: Start difference. First operand 22438 states and 67104 transitions. Second operand 5 states. [2019-12-27 16:02:37,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:37,183 INFO L93 Difference]: Finished difference Result 39305 states and 117678 transitions. [2019-12-27 16:02:37,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:02:37,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 16:02:37,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:37,227 INFO L225 Difference]: With dead ends: 39305 [2019-12-27 16:02:37,227 INFO L226 Difference]: Without dead ends: 20062 [2019-12-27 16:02:37,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:02:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20062 states. [2019-12-27 16:02:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20062 to 19763. [2019-12-27 16:02:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19763 states. [2019-12-27 16:02:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19763 states to 19763 states and 57994 transitions. [2019-12-27 16:02:37,720 INFO L78 Accepts]: Start accepts. Automaton has 19763 states and 57994 transitions. Word has length 39 [2019-12-27 16:02:37,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:37,720 INFO L462 AbstractCegarLoop]: Abstraction has 19763 states and 57994 transitions. [2019-12-27 16:02:37,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:02:37,720 INFO L276 IsEmpty]: Start isEmpty. Operand 19763 states and 57994 transitions. [2019-12-27 16:02:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:02:37,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:37,748 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 16:02:37,748 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 16:02:37,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:37,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1585510358, now seen corresponding path program 2 times [2019-12-27 16:02:37,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:37,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127667829] [2019-12-27 16:02:37,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:37,812 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 16:02:37,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127667829] [2019-12-27 16:02:37,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:37,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:02:37,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2029688032] [2019-12-27 16:02:37,814 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:37,821 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:37,888 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 355 transitions. [2019-12-27 16:02:37,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:37,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:37,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:37,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:37,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:37,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:37,892 INFO L87 Difference]: Start difference. First operand 19763 states and 57994 transitions. Second operand 3 states. [2019-12-27 16:02:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:37,956 INFO L93 Difference]: Finished difference Result 19762 states and 57992 transitions. [2019-12-27 16:02:37,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:37,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:02:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:37,982 INFO L225 Difference]: With dead ends: 19762 [2019-12-27 16:02:37,983 INFO L226 Difference]: Without dead ends: 19762 [2019-12-27 16:02:37,983 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 16:02:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19762 states. [2019-12-27 16:02:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19762 to 19762. [2019-12-27 16:02:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19762 states. [2019-12-27 16:02:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19762 states to 19762 states and 57992 transitions. [2019-12-27 16:02:38,279 INFO L78 Accepts]: Start accepts. Automaton has 19762 states and 57992 transitions. Word has length 39 [2019-12-27 16:02:38,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:38,279 INFO L462 AbstractCegarLoop]: Abstraction has 19762 states and 57992 transitions. [2019-12-27 16:02:38,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 19762 states and 57992 transitions. [2019-12-27 16:02:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:02:38,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:38,299 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 16:02:38,299 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 16:02:38,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:38,299 INFO L82 PathProgramCache]: Analyzing trace with hash -408863373, now seen corresponding path program 1 times [2019-12-27 16:02:38,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:38,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330870262] [2019-12-27 16:02:38,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:38,355 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 16:02:38,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330870262] [2019-12-27 16:02:38,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:38,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:38,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2014984272] [2019-12-27 16:02:38,356 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:38,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:38,553 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 122 transitions. [2019-12-27 16:02:38,553 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:38,565 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:02:38,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:02:38,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:38,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:02:38,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:38,566 INFO L87 Difference]: Start difference. First operand 19762 states and 57992 transitions. Second operand 5 states. [2019-12-27 16:02:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:38,911 INFO L93 Difference]: Finished difference Result 43948 states and 128864 transitions. [2019-12-27 16:02:38,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:02:38,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 16:02:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:38,949 INFO L225 Difference]: With dead ends: 43948 [2019-12-27 16:02:38,949 INFO L226 Difference]: Without dead ends: 26534 [2019-12-27 16:02:38,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:02:39,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26534 states. [2019-12-27 16:02:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26534 to 17351. [2019-12-27 16:02:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17351 states. [2019-12-27 16:02:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17351 states to 17351 states and 49648 transitions. [2019-12-27 16:02:39,268 INFO L78 Accepts]: Start accepts. Automaton has 17351 states and 49648 transitions. Word has length 40 [2019-12-27 16:02:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:39,268 INFO L462 AbstractCegarLoop]: Abstraction has 17351 states and 49648 transitions. [2019-12-27 16:02:39,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:02:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 17351 states and 49648 transitions. [2019-12-27 16:02:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:02:39,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:39,284 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 16:02:39,285 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 16:02:39,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:39,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1542545665, now seen corresponding path program 2 times [2019-12-27 16:02:39,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:39,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644439669] [2019-12-27 16:02:39,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:39,350 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 16:02:39,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644439669] [2019-12-27 16:02:39,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:39,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:02:39,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1200614377] [2019-12-27 16:02:39,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:39,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:39,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 16:02:39,448 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:39,479 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:02:39,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:02:39,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:39,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:02:39,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:02:39,480 INFO L87 Difference]: Start difference. First operand 17351 states and 49648 transitions. Second operand 7 states. [2019-12-27 16:02:39,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:39,558 INFO L93 Difference]: Finished difference Result 16039 states and 46714 transitions. [2019-12-27 16:02:39,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:02:39,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:02:39,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:39,579 INFO L225 Difference]: With dead ends: 16039 [2019-12-27 16:02:39,579 INFO L226 Difference]: Without dead ends: 12992 [2019-12-27 16:02:39,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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 16:02:39,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12992 states. [2019-12-27 16:02:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12992 to 12460. [2019-12-27 16:02:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12460 states. [2019-12-27 16:02:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12460 states to 12460 states and 38438 transitions. [2019-12-27 16:02:39,812 INFO L78 Accepts]: Start accepts. Automaton has 12460 states and 38438 transitions. Word has length 40 [2019-12-27 16:02:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:39,812 INFO L462 AbstractCegarLoop]: Abstraction has 12460 states and 38438 transitions. [2019-12-27 16:02:39,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:02:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 12460 states and 38438 transitions. [2019-12-27 16:02:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:02:39,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:39,827 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 16:02:39,827 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 16:02:39,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash -101932291, now seen corresponding path program 1 times [2019-12-27 16:02:39,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:39,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335107065] [2019-12-27 16:02:39,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:39,921 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 16:02:39,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335107065] [2019-12-27 16:02:39,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:39,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:02:39,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1564003365] [2019-12-27 16:02:39,922 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:39,944 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:40,135 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 225 states and 424 transitions. [2019-12-27 16:02:40,135 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:40,326 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 16:02:40,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:02:40,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:40,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:02:40,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:02:40,327 INFO L87 Difference]: Start difference. First operand 12460 states and 38438 transitions. Second operand 13 states. [2019-12-27 16:02:41,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:41,755 INFO L93 Difference]: Finished difference Result 36109 states and 107794 transitions. [2019-12-27 16:02:41,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:02:41,756 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:02:41,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:41,792 INFO L225 Difference]: With dead ends: 36109 [2019-12-27 16:02:41,792 INFO L226 Difference]: Without dead ends: 25613 [2019-12-27 16:02:41,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:02:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25613 states. [2019-12-27 16:02:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25613 to 14163. [2019-12-27 16:02:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14163 states. [2019-12-27 16:02:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14163 states to 14163 states and 43402 transitions. [2019-12-27 16:02:42,105 INFO L78 Accepts]: Start accepts. Automaton has 14163 states and 43402 transitions. Word has length 64 [2019-12-27 16:02:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:42,106 INFO L462 AbstractCegarLoop]: Abstraction has 14163 states and 43402 transitions. [2019-12-27 16:02:42,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:02:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 14163 states and 43402 transitions. [2019-12-27 16:02:42,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:02:42,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:42,121 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 16:02:42,121 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 16:02:42,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:42,121 INFO L82 PathProgramCache]: Analyzing trace with hash -244237027, now seen corresponding path program 2 times [2019-12-27 16:02:42,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:42,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598002513] [2019-12-27 16:02:42,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:42,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598002513] [2019-12-27 16:02:42,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:42,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:02:42,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [52572262] [2019-12-27 16:02:42,228 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:42,248 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:42,567 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 483 transitions. [2019-12-27 16:02:42,567 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:42,811 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 16:02:42,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:02:42,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:42,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:02:42,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:02:42,813 INFO L87 Difference]: Start difference. First operand 14163 states and 43402 transitions. Second operand 13 states. [2019-12-27 16:02:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:43,291 INFO L93 Difference]: Finished difference Result 27982 states and 84357 transitions. [2019-12-27 16:02:43,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:02:43,291 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:02:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:43,319 INFO L225 Difference]: With dead ends: 27982 [2019-12-27 16:02:43,319 INFO L226 Difference]: Without dead ends: 20010 [2019-12-27 16:02:43,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:02:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20010 states. [2019-12-27 16:02:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20010 to 16297. [2019-12-27 16:02:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16297 states. [2019-12-27 16:02:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16297 states to 16297 states and 49660 transitions. [2019-12-27 16:02:43,600 INFO L78 Accepts]: Start accepts. Automaton has 16297 states and 49660 transitions. Word has length 64 [2019-12-27 16:02:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:43,600 INFO L462 AbstractCegarLoop]: Abstraction has 16297 states and 49660 transitions. [2019-12-27 16:02:43,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:02:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 16297 states and 49660 transitions. [2019-12-27 16:02:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:02:43,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:43,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:43,616 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 16:02:43,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:43,616 INFO L82 PathProgramCache]: Analyzing trace with hash 407961531, now seen corresponding path program 3 times [2019-12-27 16:02:43,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:43,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926739629] [2019-12-27 16:02:43,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:43,754 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 16:02:43,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926739629] [2019-12-27 16:02:43,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:43,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:02:43,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911824755] [2019-12-27 16:02:43,755 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:43,774 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:44,193 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 421 transitions. [2019-12-27 16:02:44,193 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:44,401 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 16:02:44,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:02:44,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:44,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:02:44,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:02:44,402 INFO L87 Difference]: Start difference. First operand 16297 states and 49660 transitions. Second operand 12 states. [2019-12-27 16:02:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:46,163 INFO L93 Difference]: Finished difference Result 49803 states and 149652 transitions. [2019-12-27 16:02:46,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 16:02:46,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 16:02:46,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:46,229 INFO L225 Difference]: With dead ends: 49803 [2019-12-27 16:02:46,230 INFO L226 Difference]: Without dead ends: 46098 [2019-12-27 16:02:46,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=369, Invalid=1271, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 16:02:46,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46098 states. [2019-12-27 16:02:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46098 to 16265. [2019-12-27 16:02:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16265 states. [2019-12-27 16:02:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16265 states to 16265 states and 49562 transitions. [2019-12-27 16:02:46,730 INFO L78 Accepts]: Start accepts. Automaton has 16265 states and 49562 transitions. Word has length 64 [2019-12-27 16:02:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:46,730 INFO L462 AbstractCegarLoop]: Abstraction has 16265 states and 49562 transitions. [2019-12-27 16:02:46,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:02:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 16265 states and 49562 transitions. [2019-12-27 16:02:46,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:02:46,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:46,748 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 16:02:46,748 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 16:02:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:46,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1739892295, now seen corresponding path program 4 times [2019-12-27 16:02:46,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:46,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325682841] [2019-12-27 16:02:46,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:46,802 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 16:02:46,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325682841] [2019-12-27 16:02:46,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:46,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:46,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1722522351] [2019-12-27 16:02:46,804 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:46,823 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:47,018 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 225 states and 402 transitions. [2019-12-27 16:02:47,018 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:47,019 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:02:47,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:47,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:47,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:47,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:47,020 INFO L87 Difference]: Start difference. First operand 16265 states and 49562 transitions. Second operand 3 states. [2019-12-27 16:02:47,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:47,261 INFO L93 Difference]: Finished difference Result 18943 states and 57666 transitions. [2019-12-27 16:02:47,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:47,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:02:47,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:47,288 INFO L225 Difference]: With dead ends: 18943 [2019-12-27 16:02:47,288 INFO L226 Difference]: Without dead ends: 18943 [2019-12-27 16:02:47,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 16:02:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18943 states. [2019-12-27 16:02:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18943 to 16898. [2019-12-27 16:02:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16898 states. [2019-12-27 16:02:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16898 states to 16898 states and 51657 transitions. [2019-12-27 16:02:47,561 INFO L78 Accepts]: Start accepts. Automaton has 16898 states and 51657 transitions. Word has length 64 [2019-12-27 16:02:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:47,561 INFO L462 AbstractCegarLoop]: Abstraction has 16898 states and 51657 transitions. [2019-12-27 16:02:47,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 16898 states and 51657 transitions. [2019-12-27 16:02:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:02:47,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:47,578 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 16:02:47,578 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 16:02:47,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash -671653730, now seen corresponding path program 1 times [2019-12-27 16:02:47,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:47,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894601792] [2019-12-27 16:02:47,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:47,708 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 16:02:47,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894601792] [2019-12-27 16:02:47,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:47,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:02:47,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [921014175] [2019-12-27 16:02:47,709 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:47,729 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:47,921 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 408 transitions. [2019-12-27 16:02:47,922 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:48,261 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 16:02:48,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:02:48,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:48,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:02:48,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:02:48,263 INFO L87 Difference]: Start difference. First operand 16898 states and 51657 transitions. Second operand 14 states. [2019-12-27 16:02:52,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:52,685 INFO L93 Difference]: Finished difference Result 69487 states and 208855 transitions. [2019-12-27 16:02:52,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 16:02:52,692 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 16:02:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:52,770 INFO L225 Difference]: With dead ends: 69487 [2019-12-27 16:02:52,770 INFO L226 Difference]: Without dead ends: 52228 [2019-12-27 16:02:52,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 14 SyntacticMatches, 12 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=759, Invalid=2901, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 16:02:52,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52228 states. [2019-12-27 16:02:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52228 to 17319. [2019-12-27 16:02:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17319 states. [2019-12-27 16:02:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17319 states to 17319 states and 52545 transitions. [2019-12-27 16:02:53,322 INFO L78 Accepts]: Start accepts. Automaton has 17319 states and 52545 transitions. Word has length 65 [2019-12-27 16:02:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:53,322 INFO L462 AbstractCegarLoop]: Abstraction has 17319 states and 52545 transitions. [2019-12-27 16:02:53,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:02:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 17319 states and 52545 transitions. [2019-12-27 16:02:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:02:53,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:53,341 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 16:02:53,341 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 16:02:53,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash -151344766, now seen corresponding path program 2 times [2019-12-27 16:02:53,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:53,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649260647] [2019-12-27 16:02:53,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:53,412 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 16:02:53,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649260647] [2019-12-27 16:02:53,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:53,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:53,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [430631100] [2019-12-27 16:02:53,413 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:53,433 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:53,698 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 405 transitions. [2019-12-27 16:02:53,698 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:53,700 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:02:53,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:02:53,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:53,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:02:53,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:02:53,701 INFO L87 Difference]: Start difference. First operand 17319 states and 52545 transitions. Second operand 4 states. [2019-12-27 16:02:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:53,819 INFO L93 Difference]: Finished difference Result 17066 states and 51628 transitions. [2019-12-27 16:02:53,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:02:53,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 16:02:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:53,843 INFO L225 Difference]: With dead ends: 17066 [2019-12-27 16:02:53,843 INFO L226 Difference]: Without dead ends: 17066 [2019-12-27 16:02:53,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17066 states. [2019-12-27 16:02:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17066 to 16433. [2019-12-27 16:02:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16433 states. [2019-12-27 16:02:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16433 states to 16433 states and 49533 transitions. [2019-12-27 16:02:54,110 INFO L78 Accepts]: Start accepts. Automaton has 16433 states and 49533 transitions. Word has length 65 [2019-12-27 16:02:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:54,110 INFO L462 AbstractCegarLoop]: Abstraction has 16433 states and 49533 transitions. [2019-12-27 16:02:54,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:02:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 16433 states and 49533 transitions. [2019-12-27 16:02:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:02:54,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:54,127 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 16:02:54,127 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 16:02:54,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:54,127 INFO L82 PathProgramCache]: Analyzing trace with hash -547409899, now seen corresponding path program 1 times [2019-12-27 16:02:54,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:54,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080890401] [2019-12-27 16:02:54,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:54,183 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 16:02:54,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080890401] [2019-12-27 16:02:54,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:54,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:54,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [418193561] [2019-12-27 16:02:54,184 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:54,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:54,602 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 405 transitions. [2019-12-27 16:02:54,603 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:54,603 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:54,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:54,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:54,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:54,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:54,604 INFO L87 Difference]: Start difference. First operand 16433 states and 49533 transitions. Second operand 3 states. [2019-12-27 16:02:54,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:54,655 INFO L93 Difference]: Finished difference Result 16432 states and 49531 transitions. [2019-12-27 16:02:54,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:54,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 16:02:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:54,679 INFO L225 Difference]: With dead ends: 16432 [2019-12-27 16:02:54,679 INFO L226 Difference]: Without dead ends: 16432 [2019-12-27 16:02:54,679 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 16:02:54,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16432 states. [2019-12-27 16:02:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16432 to 14222. [2019-12-27 16:02:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14222 states. [2019-12-27 16:02:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14222 states to 14222 states and 43503 transitions. [2019-12-27 16:02:54,939 INFO L78 Accepts]: Start accepts. Automaton has 14222 states and 43503 transitions. Word has length 65 [2019-12-27 16:02:54,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:54,939 INFO L462 AbstractCegarLoop]: Abstraction has 14222 states and 43503 transitions. [2019-12-27 16:02:54,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 14222 states and 43503 transitions. [2019-12-27 16:02:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:02:54,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:54,955 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 16:02:54,956 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 16:02:54,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:54,956 INFO L82 PathProgramCache]: Analyzing trace with hash 889984155, now seen corresponding path program 1 times [2019-12-27 16:02:54,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:54,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855594832] [2019-12-27 16:02:54,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:55,035 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 16:02:55,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855594832] [2019-12-27 16:02:55,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:55,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:55,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1051434426] [2019-12-27 16:02:55,036 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:55,056 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:55,352 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 406 transitions. [2019-12-27 16:02:55,352 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:55,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:02:55,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:02:55,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:55,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:02:55,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:02:55,391 INFO L87 Difference]: Start difference. First operand 14222 states and 43503 transitions. Second operand 6 states. [2019-12-27 16:02:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:55,727 INFO L93 Difference]: Finished difference Result 13782 states and 41811 transitions. [2019-12-27 16:02:55,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:02:55,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 16:02:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:55,748 INFO L225 Difference]: With dead ends: 13782 [2019-12-27 16:02:55,748 INFO L226 Difference]: Without dead ends: 13782 [2019-12-27 16:02:55,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:02:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13782 states. [2019-12-27 16:02:55,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13782 to 9340. [2019-12-27 16:02:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9340 states. [2019-12-27 16:02:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9340 states to 9340 states and 28687 transitions. [2019-12-27 16:02:55,926 INFO L78 Accepts]: Start accepts. Automaton has 9340 states and 28687 transitions. Word has length 66 [2019-12-27 16:02:55,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:55,926 INFO L462 AbstractCegarLoop]: Abstraction has 9340 states and 28687 transitions. [2019-12-27 16:02:55,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:02:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 9340 states and 28687 transitions. [2019-12-27 16:02:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:02:55,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:55,938 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 16:02:55,938 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 16:02:55,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:55,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2078724657, now seen corresponding path program 1 times [2019-12-27 16:02:55,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:55,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184039378] [2019-12-27 16:02:55,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:56,087 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 16:02:56,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184039378] [2019-12-27 16:02:56,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:56,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:02:56,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1632819124] [2019-12-27 16:02:56,088 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:56,127 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:56,589 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 250 states and 482 transitions. [2019-12-27 16:02:56,590 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:56,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:57,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:57,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:57,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:57,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:57,678 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 37 times. [2019-12-27 16:02:57,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 16:02:57,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 16:02:57,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:02:57,680 INFO L87 Difference]: Start difference. First operand 9340 states and 28687 transitions. Second operand 24 states. [2019-12-27 16:02:59,701 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 16:03:00,598 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 16:03:01,309 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-27 16:03:02,247 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-12-27 16:03:02,494 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 16:03:03,811 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 16:03:04,026 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-27 16:03:04,971 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-27 16:03:06,122 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2019-12-27 16:03:07,763 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-27 16:03:10,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:10,727 INFO L93 Difference]: Finished difference Result 38771 states and 115615 transitions. [2019-12-27 16:03:10,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-12-27 16:03:10,728 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-27 16:03:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:10,768 INFO L225 Difference]: With dead ends: 38771 [2019-12-27 16:03:10,768 INFO L226 Difference]: Without dead ends: 26309 [2019-12-27 16:03:10,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 11 SyntacticMatches, 11 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1326, Invalid=5814, Unknown=0, NotChecked=0, Total=7140 [2019-12-27 16:03:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26309 states. [2019-12-27 16:03:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26309 to 10719. [2019-12-27 16:03:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10719 states. [2019-12-27 16:03:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10719 states to 10719 states and 32647 transitions. [2019-12-27 16:03:11,049 INFO L78 Accepts]: Start accepts. Automaton has 10719 states and 32647 transitions. Word has length 67 [2019-12-27 16:03:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:11,049 INFO L462 AbstractCegarLoop]: Abstraction has 10719 states and 32647 transitions. [2019-12-27 16:03:11,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 16:03:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 10719 states and 32647 transitions. [2019-12-27 16:03:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:03:11,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:11,060 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 16:03:11,060 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 16:03:11,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:11,061 INFO L82 PathProgramCache]: Analyzing trace with hash 721495091, now seen corresponding path program 2 times [2019-12-27 16:03:11,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:11,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159156933] [2019-12-27 16:03:11,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:11,208 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 16:03:11,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159156933] [2019-12-27 16:03:11,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:11,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:03:11,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1144367830] [2019-12-27 16:03:11,209 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:11,229 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:11,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 230 states and 432 transitions. [2019-12-27 16:03:11,429 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:11,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:11,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:11,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:11,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:12,067 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 16:03:12,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 16:03:12,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:12,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 16:03:12,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-27 16:03:12,069 INFO L87 Difference]: Start difference. First operand 10719 states and 32647 transitions. Second operand 19 states. [2019-12-27 16:03:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:15,214 INFO L93 Difference]: Finished difference Result 19852 states and 59452 transitions. [2019-12-27 16:03:15,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 16:03:15,215 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 16:03:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:15,239 INFO L225 Difference]: With dead ends: 19852 [2019-12-27 16:03:15,239 INFO L226 Difference]: Without dead ends: 17447 [2019-12-27 16:03:15,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 9 SyntacticMatches, 11 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=409, Invalid=1943, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 16:03:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17447 states. [2019-12-27 16:03:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17447 to 13431. [2019-12-27 16:03:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13431 states. [2019-12-27 16:03:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13431 states to 13431 states and 40839 transitions. [2019-12-27 16:03:15,471 INFO L78 Accepts]: Start accepts. Automaton has 13431 states and 40839 transitions. Word has length 67 [2019-12-27 16:03:15,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:15,471 INFO L462 AbstractCegarLoop]: Abstraction has 13431 states and 40839 transitions. [2019-12-27 16:03:15,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 16:03:15,471 INFO L276 IsEmpty]: Start isEmpty. Operand 13431 states and 40839 transitions. [2019-12-27 16:03:15,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:03:15,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:15,484 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 16:03:15,485 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:15,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:15,485 INFO L82 PathProgramCache]: Analyzing trace with hash 957967249, now seen corresponding path program 3 times [2019-12-27 16:03:15,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:15,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456514207] [2019-12-27 16:03:15,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:15,628 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 16:03:15,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456514207] [2019-12-27 16:03:15,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:15,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:03:15,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [843003730] [2019-12-27 16:03:15,629 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:15,650 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:15,921 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 308 states and 625 transitions. [2019-12-27 16:03:15,921 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:16,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:16,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:16,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:16,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:16,661 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 16:03:16,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 16:03:16,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:16,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 16:03:16,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:03:16,662 INFO L87 Difference]: Start difference. First operand 13431 states and 40839 transitions. Second operand 20 states. [2019-12-27 16:03:20,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:20,438 INFO L93 Difference]: Finished difference Result 20822 states and 61871 transitions. [2019-12-27 16:03:20,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 16:03:20,439 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-27 16:03:20,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:20,473 INFO L225 Difference]: With dead ends: 20822 [2019-12-27 16:03:20,473 INFO L226 Difference]: Without dead ends: 17823 [2019-12-27 16:03:20,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 15 SyntacticMatches, 14 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=535, Invalid=2435, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 16:03:20,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17823 states. [2019-12-27 16:03:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17823 to 10635. [2019-12-27 16:03:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10635 states. [2019-12-27 16:03:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10635 states to 10635 states and 32341 transitions. [2019-12-27 16:03:20,704 INFO L78 Accepts]: Start accepts. Automaton has 10635 states and 32341 transitions. Word has length 67 [2019-12-27 16:03:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:20,704 INFO L462 AbstractCegarLoop]: Abstraction has 10635 states and 32341 transitions. [2019-12-27 16:03:20,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 16:03:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 10635 states and 32341 transitions. [2019-12-27 16:03:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:03:20,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:20,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, 1, 1, 1, 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 16:03:20,716 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:20,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:20,716 INFO L82 PathProgramCache]: Analyzing trace with hash 88464887, now seen corresponding path program 4 times [2019-12-27 16:03:20,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:20,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386601140] [2019-12-27 16:03:20,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:20,885 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 16:03:20,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386601140] [2019-12-27 16:03:20,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:20,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:03:20,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2118182266] [2019-12-27 16:03:20,885 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:20,907 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:21,181 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 406 transitions. [2019-12-27 16:03:21,181 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:21,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:21,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:21,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:21,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:21,796 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 16:03:21,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 16:03:21,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:21,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 16:03:21,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:03:21,797 INFO L87 Difference]: Start difference. First operand 10635 states and 32341 transitions. Second operand 20 states. [2019-12-27 16:03:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:25,407 INFO L93 Difference]: Finished difference Result 29447 states and 88847 transitions. [2019-12-27 16:03:25,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 16:03:25,407 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-27 16:03:25,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:25,442 INFO L225 Difference]: With dead ends: 29447 [2019-12-27 16:03:25,443 INFO L226 Difference]: Without dead ends: 24802 [2019-12-27 16:03:25,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 16 SyntacticMatches, 12 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=646, Invalid=3644, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 16:03:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24802 states. [2019-12-27 16:03:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24802 to 14522. [2019-12-27 16:03:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14522 states. [2019-12-27 16:03:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14522 states to 14522 states and 44406 transitions. [2019-12-27 16:03:25,893 INFO L78 Accepts]: Start accepts. Automaton has 14522 states and 44406 transitions. Word has length 67 [2019-12-27 16:03:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:25,893 INFO L462 AbstractCegarLoop]: Abstraction has 14522 states and 44406 transitions. [2019-12-27 16:03:25,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 16:03:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 14522 states and 44406 transitions. [2019-12-27 16:03:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:03:25,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:25,907 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 16:03:25,908 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:25,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:25,908 INFO L82 PathProgramCache]: Analyzing trace with hash 324937045, now seen corresponding path program 5 times [2019-12-27 16:03:25,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:25,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107303254] [2019-12-27 16:03:25,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:26,060 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 16:03:26,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107303254] [2019-12-27 16:03:26,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:26,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:03:26,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [486488191] [2019-12-27 16:03:26,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:26,090 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:26,508 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 599 transitions. [2019-12-27 16:03:26,508 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:26,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:26,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:27,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:27,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:27,370 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 16:03:27,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 16:03:27,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:27,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 16:03:27,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:03:27,374 INFO L87 Difference]: Start difference. First operand 14522 states and 44406 transitions. Second operand 21 states. [2019-12-27 16:03:32,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:32,170 INFO L93 Difference]: Finished difference Result 37708 states and 112863 transitions. [2019-12-27 16:03:32,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-27 16:03:32,171 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 16:03:32,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:32,206 INFO L225 Difference]: With dead ends: 37708 [2019-12-27 16:03:32,206 INFO L226 Difference]: Without dead ends: 23341 [2019-12-27 16:03:32,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 22 SyntacticMatches, 15 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2400 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1119, Invalid=6537, Unknown=0, NotChecked=0, Total=7656 [2019-12-27 16:03:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23341 states. [2019-12-27 16:03:32,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23341 to 10677. [2019-12-27 16:03:32,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10677 states. [2019-12-27 16:03:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10677 states to 10677 states and 32402 transitions. [2019-12-27 16:03:32,616 INFO L78 Accepts]: Start accepts. Automaton has 10677 states and 32402 transitions. Word has length 67 [2019-12-27 16:03:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:32,616 INFO L462 AbstractCegarLoop]: Abstraction has 10677 states and 32402 transitions. [2019-12-27 16:03:32,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 16:03:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 10677 states and 32402 transitions. [2019-12-27 16:03:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:03:32,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:32,627 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 16:03:32,627 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:32,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:32,628 INFO L82 PathProgramCache]: Analyzing trace with hash 975038819, now seen corresponding path program 6 times [2019-12-27 16:03:32,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:32,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360950663] [2019-12-27 16:03:32,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:32,784 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 16:03:32,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360950663] [2019-12-27 16:03:32,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:32,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:03:32,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [289843829] [2019-12-27 16:03:32,785 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:32,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:33,113 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 478 transitions. [2019-12-27 16:03:33,114 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:33,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:33,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:33,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:33,734 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 16:03:33,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 16:03:33,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:33,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 16:03:33,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-27 16:03:33,735 INFO L87 Difference]: Start difference. First operand 10677 states and 32402 transitions. Second operand 17 states. [2019-12-27 16:03:36,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:36,218 INFO L93 Difference]: Finished difference Result 13558 states and 39986 transitions. [2019-12-27 16:03:36,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 16:03:36,219 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 16:03:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:36,239 INFO L225 Difference]: With dead ends: 13558 [2019-12-27 16:03:36,239 INFO L226 Difference]: Without dead ends: 13049 [2019-12-27 16:03:36,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2019-12-27 16:03:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13049 states. [2019-12-27 16:03:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13049 to 10677. [2019-12-27 16:03:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10677 states. [2019-12-27 16:03:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10677 states to 10677 states and 32402 transitions. [2019-12-27 16:03:36,434 INFO L78 Accepts]: Start accepts. Automaton has 10677 states and 32402 transitions. Word has length 67 [2019-12-27 16:03:36,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:36,434 INFO L462 AbstractCegarLoop]: Abstraction has 10677 states and 32402 transitions. [2019-12-27 16:03:36,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 16:03:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 10677 states and 32402 transitions. [2019-12-27 16:03:36,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:03:36,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:36,447 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 16:03:36,447 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:36,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:36,448 INFO L82 PathProgramCache]: Analyzing trace with hash -478785703, now seen corresponding path program 7 times [2019-12-27 16:03:36,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:36,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352919747] [2019-12-27 16:03:36,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:36,592 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 16:03:36,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352919747] [2019-12-27 16:03:36,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:36,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:03:36,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1855829556] [2019-12-27 16:03:36,593 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:36,607 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:36,840 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 265 states and 510 transitions. [2019-12-27 16:03:36,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:37,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:37,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:37,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:37,280 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 35 times. [2019-12-27 16:03:37,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 16:03:37,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:37,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 16:03:37,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-27 16:03:37,281 INFO L87 Difference]: Start difference. First operand 10677 states and 32402 transitions. Second operand 17 states. [2019-12-27 16:03:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:39,844 INFO L93 Difference]: Finished difference Result 13604 states and 40172 transitions. [2019-12-27 16:03:39,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:03:39,844 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 16:03:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:39,864 INFO L225 Difference]: With dead ends: 13604 [2019-12-27 16:03:39,864 INFO L226 Difference]: Without dead ends: 13365 [2019-12-27 16:03:39,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 14 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2019-12-27 16:03:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13365 states. [2019-12-27 16:03:40,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13365 to 10693. [2019-12-27 16:03:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10693 states. [2019-12-27 16:03:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10693 states to 10693 states and 32446 transitions. [2019-12-27 16:03:40,058 INFO L78 Accepts]: Start accepts. Automaton has 10693 states and 32446 transitions. Word has length 67 [2019-12-27 16:03:40,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:40,058 INFO L462 AbstractCegarLoop]: Abstraction has 10693 states and 32446 transitions. [2019-12-27 16:03:40,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 16:03:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 10693 states and 32446 transitions. [2019-12-27 16:03:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:03:40,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:40,069 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 16:03:40,069 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:40,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:40,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1516551711, now seen corresponding path program 8 times [2019-12-27 16:03:40,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:40,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665871512] [2019-12-27 16:03:40,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:40,543 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 16:03:40,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665871512] [2019-12-27 16:03:40,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:40,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 16:03:40,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [82221710] [2019-12-27 16:03:40,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:40,553 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:40,750 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 259 states and 498 transitions. [2019-12-27 16:03:40,750 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:41,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:03:41,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:03:41,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:03:41,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:03:41,964 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 61 times. [2019-12-27 16:03:41,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 16:03:41,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:41,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 16:03:41,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2019-12-27 16:03:41,966 INFO L87 Difference]: Start difference. First operand 10693 states and 32446 transitions. Second operand 30 states. [2019-12-27 16:03:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:46,862 INFO L93 Difference]: Finished difference Result 10678 states and 31321 transitions. [2019-12-27 16:03:46,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 16:03:46,863 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 16:03:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:46,877 INFO L225 Difference]: With dead ends: 10678 [2019-12-27 16:03:46,878 INFO L226 Difference]: Without dead ends: 10583 [2019-12-27 16:03:46,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 31 SyntacticMatches, 21 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=422, Invalid=2884, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 16:03:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10583 states. [2019-12-27 16:03:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10583 to 9475. [2019-12-27 16:03:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9475 states. [2019-12-27 16:03:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9475 states to 9475 states and 28231 transitions. [2019-12-27 16:03:47,025 INFO L78 Accepts]: Start accepts. Automaton has 9475 states and 28231 transitions. Word has length 67 [2019-12-27 16:03:47,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:47,025 INFO L462 AbstractCegarLoop]: Abstraction has 9475 states and 28231 transitions. [2019-12-27 16:03:47,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 16:03:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 9475 states and 28231 transitions. [2019-12-27 16:03:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:03:47,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:47,035 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 16:03:47,035 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:47,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:47,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1506014391, now seen corresponding path program 9 times [2019-12-27 16:03:47,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:47,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315851171] [2019-12-27 16:03:47,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:47,204 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 16:03:47,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315851171] [2019-12-27 16:03:47,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:47,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:03:47,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [681405188] [2019-12-27 16:03:47,205 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:47,214 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:47,426 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 297 states and 597 transitions. [2019-12-27 16:03:47,426 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:47,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:47,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:47,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:47,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:03:47,895 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 16:03:47,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 16:03:47,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:47,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 16:03:47,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:03:47,896 INFO L87 Difference]: Start difference. First operand 9475 states and 28231 transitions. Second operand 21 states. [2019-12-27 16:03:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:49,514 INFO L93 Difference]: Finished difference Result 11821 states and 34420 transitions. [2019-12-27 16:03:49,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 16:03:49,515 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 16:03:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:49,530 INFO L225 Difference]: With dead ends: 11821 [2019-12-27 16:03:49,530 INFO L226 Difference]: Without dead ends: 11554 [2019-12-27 16:03:49,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 16:03:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11554 states. [2019-12-27 16:03:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11554 to 9267. [2019-12-27 16:03:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9267 states. [2019-12-27 16:03:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9267 states to 9267 states and 27709 transitions. [2019-12-27 16:03:49,687 INFO L78 Accepts]: Start accepts. Automaton has 9267 states and 27709 transitions. Word has length 67 [2019-12-27 16:03:49,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:49,688 INFO L462 AbstractCegarLoop]: Abstraction has 9267 states and 27709 transitions. [2019-12-27 16:03:49,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 16:03:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 9267 states and 27709 transitions. [2019-12-27 16:03:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:03:49,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:49,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, 1, 1, 1, 1, 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 16:03:49,697 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:49,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:49,697 INFO L82 PathProgramCache]: Analyzing trace with hash -494782975, now seen corresponding path program 10 times [2019-12-27 16:03:49,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:49,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283016885] [2019-12-27 16:03:49,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:03:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:03:49,830 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:03:49,830 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:03:49,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~a$r_buff1_thd0~0_132 0) (= 0 v_~a$w_buff0_used~0_689) (= 0 v_~a$w_buff1_used~0_376) (= v_~a$r_buff0_thd3~0_328 0) (= |v_ULTIMATE.start_main_~#t403~0.offset_22| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t403~0.base_29| 4)) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t403~0.base_29|) (= v_~y~0_79 0) (= 0 v_~a$r_buff1_thd1~0_125) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~x~0_69 0) (= 0 v_~a$r_buff1_thd2~0_129) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t403~0.base_29| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t403~0.base_29|) |v_ULTIMATE.start_main_~#t403~0.offset_22| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~a$flush_delayed~0_23 0) (= v_~a$r_buff1_thd3~0_224 0) (= v_~__unbuffered_p2_EBX~0_38 0) (= 0 v_~__unbuffered_cnt~0_98) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~a$r_buff0_thd2~0_124) (= v_~a~0_181 0) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t403~0.base_29|)) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~a$r_buff0_thd1~0_195) (= v_~a$mem_tmp~0_12 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~a$w_buff1~0_172) (= v_~a$r_buff0_thd0~0_144 0) (= v_~a$w_buff0~0_228 0) (= v_~weak$$choice2~0_107 0) (= v_~z~0_20 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t403~0.base_29| 1)) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t405~0.offset=|v_ULTIMATE.start_main_~#t405~0.offset_15|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_129, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_281|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ~a~0=v_~a~0_181, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_67|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t405~0.base=|v_ULTIMATE.start_main_~#t405~0.base_17|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_~#t404~0.base=|v_ULTIMATE.start_main_~#t404~0.base_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_224, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_689, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_195, ULTIMATE.start_main_~#t403~0.base=|v_ULTIMATE.start_main_~#t403~0.base_29|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_228, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_69, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_124, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_55|, ~a$mem_tmp~0=v_~a$mem_tmp~0_12, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_172, ~y~0=v_~y~0_79, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_125, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_328, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t404~0.offset=|v_ULTIMATE.start_main_~#t404~0.offset_22|, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t403~0.offset=|v_ULTIMATE.start_main_~#t403~0.offset_22|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_376, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t405~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t405~0.base, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t404~0.base, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t403~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t404~0.offset, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t403~0.offset, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 16:03:49,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L837-1-->L839: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t404~0.base_12| 4)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t404~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t404~0.base_12|) |v_ULTIMATE.start_main_~#t404~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t404~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t404~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t404~0.base_12|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t404~0.base_12| 1) |v_#valid_34|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t404~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t404~0.offset=|v_ULTIMATE.start_main_~#t404~0.offset_10|, ULTIMATE.start_main_~#t404~0.base=|v_ULTIMATE.start_main_~#t404~0.base_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t404~0.offset, ULTIMATE.start_main_~#t404~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 16:03:49,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L839-1-->L841: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t405~0.base_13| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t405~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t405~0.base_13|)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t405~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t405~0.offset_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t405~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t405~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t405~0.base_13|) |v_ULTIMATE.start_main_~#t405~0.offset_11| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t405~0.offset=|v_ULTIMATE.start_main_~#t405~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t405~0.base=|v_ULTIMATE.start_main_~#t405~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t405~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t405~0.base] because there is no mapped edge [2019-12-27 16:03:49,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L758: Formula: (and (= 1 ~a$r_buff0_thd1~0_Out2132068410) (= ~a$r_buff0_thd2~0_In2132068410 ~a$r_buff1_thd2~0_Out2132068410) (= 1 ~x~0_Out2132068410) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2132068410)) (= ~a$r_buff1_thd0~0_Out2132068410 ~a$r_buff0_thd0~0_In2132068410) (= ~y~0_In2132068410 ~__unbuffered_p0_EBX~0_Out2132068410) (= ~x~0_Out2132068410 ~__unbuffered_p0_EAX~0_Out2132068410) (= ~a$r_buff0_thd1~0_In2132068410 ~a$r_buff1_thd1~0_Out2132068410) (= ~a$r_buff0_thd3~0_In2132068410 ~a$r_buff1_thd3~0_Out2132068410)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2132068410, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2132068410, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2132068410, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2132068410, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2132068410, ~y~0=~y~0_In2132068410} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out2132068410, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out2132068410, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out2132068410, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out2132068410, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2132068410, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2132068410, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out2132068410, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2132068410, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out2132068410, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out2132068410, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2132068410, ~y~0=~y~0_In2132068410, ~x~0=~x~0_Out2132068410} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 16:03:49,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-152458427 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-152458427 256) 0))) (or (and (= ~a$w_buff0_used~0_In-152458427 |P0Thread1of1ForFork1_#t~ite5_Out-152458427|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-152458427|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-152458427, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-152458427} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-152458427|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-152458427, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-152458427} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:03:49,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd1~0_In-2085843692 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-2085843692 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-2085843692 256))) (.cse1 (= (mod ~a$r_buff1_thd1~0_In-2085843692 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-2085843692| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-2085843692| ~a$w_buff1_used~0_In-2085843692)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2085843692, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2085843692, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2085843692, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2085843692} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2085843692|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2085843692, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2085843692, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2085843692, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2085843692} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:03:49,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-157009347 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-157009347 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-157009347| ~a$w_buff1~0_In-157009347) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-157009347| ~a~0_In-157009347)))) InVars {~a~0=~a~0_In-157009347, ~a$w_buff1~0=~a$w_buff1~0_In-157009347, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-157009347, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-157009347} OutVars{~a~0=~a~0_In-157009347, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-157009347|, ~a$w_buff1~0=~a$w_buff1~0_In-157009347, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-157009347, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-157009347} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 16:03:49,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~a~0_28) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{~a~0=v_~a~0_28, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_15|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 16:03:49,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1206268693 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1206268693 256) 0))) (or (and (= ~a$r_buff0_thd1~0_Out-1206268693 ~a$r_buff0_thd1~0_In-1206268693) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~a$r_buff0_thd1~0_Out-1206268693 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1206268693, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1206268693} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1206268693|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1206268693, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1206268693} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:03:49,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-1610330117 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-1610330117 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1610330117 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1610330117 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1610330117| ~a$r_buff1_thd1~0_In-1610330117) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1610330117|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1610330117, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1610330117, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1610330117, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1610330117} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1610330117|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1610330117, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1610330117, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1610330117, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1610330117} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:03:49,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L762-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:03:49,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1097696713 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1097696713 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out1097696713| ~a$w_buff0_used~0_In1097696713) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1097696713|) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1097696713, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1097696713} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1097696713, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1097696713, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1097696713|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:03:49,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1627519788 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-1627519788| |P2Thread1of1ForFork0_#t~ite20_Out-1627519788|) (= |P2Thread1of1ForFork0_#t~ite21_Out-1627519788| ~a$w_buff0~0_In-1627519788)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out-1627519788| |P2Thread1of1ForFork0_#t~ite20_Out-1627519788|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1627519788 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-1627519788 256)) .cse1) (and (= (mod ~a$w_buff1_used~0_In-1627519788 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1627519788 256)))) (= |P2Thread1of1ForFork0_#t~ite20_Out-1627519788| ~a$w_buff0~0_In-1627519788)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1627519788, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1627519788, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1627519788, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1627519788, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1627519788, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1627519788|, ~weak$$choice2~0=~weak$$choice2~0_In-1627519788} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1627519788|, ~a$w_buff0~0=~a$w_buff0~0_In-1627519788, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1627519788, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1627519788, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1627519788, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1627519788|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1627519788, ~weak$$choice2~0=~weak$$choice2~0_In-1627519788} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 16:03:49,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L804-->L804-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In422913765 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In422913765 256)))) (or (and .cse0 (= (mod ~a$r_buff1_thd3~0_In422913765 256) 0)) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In422913765 256))) (= 0 (mod ~a$w_buff0_used~0_In422913765 256)))) (= ~a$w_buff1~0_In422913765 |P2Thread1of1ForFork0_#t~ite23_Out422913765|) (= |P2Thread1of1ForFork0_#t~ite24_Out422913765| |P2Thread1of1ForFork0_#t~ite23_Out422913765|) .cse1) (and (= ~a$w_buff1~0_In422913765 |P2Thread1of1ForFork0_#t~ite24_Out422913765|) (= |P2Thread1of1ForFork0_#t~ite23_In422913765| |P2Thread1of1ForFork0_#t~ite23_Out422913765|) (not .cse1)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In422913765, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In422913765|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In422913765, ~a$w_buff0_used~0=~a$w_buff0_used~0_In422913765, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In422913765, ~a$w_buff1_used~0=~a$w_buff1_used~0_In422913765, ~weak$$choice2~0=~weak$$choice2~0_In422913765} OutVars{~a$w_buff1~0=~a$w_buff1~0_In422913765, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out422913765|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out422913765|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In422913765, ~a$w_buff0_used~0=~a$w_buff0_used~0_In422913765, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In422913765, ~a$w_buff1_used~0=~a$w_buff1_used~0_In422913765, ~weak$$choice2~0=~weak$$choice2~0_In422913765} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 16:03:49,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L805-->L805-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1497442534 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1497442534 256)))) (or (and (= (mod ~a$r_buff1_thd3~0_In-1497442534 256) 0) .cse0) (and (= (mod ~a$w_buff1_used~0_In-1497442534 256) 0) .cse0) (= 0 (mod ~a$w_buff0_used~0_In-1497442534 256)))) (= |P2Thread1of1ForFork0_#t~ite27_Out-1497442534| |P2Thread1of1ForFork0_#t~ite26_Out-1497442534|) (= ~a$w_buff0_used~0_In-1497442534 |P2Thread1of1ForFork0_#t~ite26_Out-1497442534|) .cse1) (and (= ~a$w_buff0_used~0_In-1497442534 |P2Thread1of1ForFork0_#t~ite27_Out-1497442534|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In-1497442534| |P2Thread1of1ForFork0_#t~ite26_Out-1497442534|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1497442534|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1497442534, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1497442534, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1497442534, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1497442534, ~weak$$choice2~0=~weak$$choice2~0_In-1497442534} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1497442534|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1497442534|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1497442534, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1497442534, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1497442534, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1497442534, ~weak$$choice2~0=~weak$$choice2~0_In-1497442534} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 16:03:49,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_53 v_~a$r_buff0_thd3~0_52) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_52, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 16:03:49,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_16 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_16, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 16:03:49,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1460578551 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In1460578551 256) 0))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1460578551 |P2Thread1of1ForFork0_#t~ite38_Out1460578551|)) (and (= ~a~0_In1460578551 |P2Thread1of1ForFork0_#t~ite38_Out1460578551|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In1460578551, ~a$w_buff1~0=~a$w_buff1~0_In1460578551, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1460578551, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1460578551} OutVars{~a~0=~a~0_In1460578551, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1460578551|, ~a$w_buff1~0=~a$w_buff1~0_In1460578551, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1460578551, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1460578551} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:03:49,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L814-4-->L815: Formula: (= v_~a~0_36 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_36, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:03:49,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In740534739 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In740534739 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In740534739 |P2Thread1of1ForFork0_#t~ite40_Out740534739|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out740534739|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In740534739, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In740534739} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out740534739|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In740534739, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In740534739} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:03:49,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1637966142 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1637966142 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1637966142 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-1637966142 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1637966142| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1637966142| ~a$w_buff1_used~0_In-1637966142) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1637966142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1637966142, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1637966142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1637966142} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1637966142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1637966142, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1637966142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1637966142, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1637966142|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:03:49,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1308073195 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1308073195 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1308073195| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1308073195| ~a$r_buff0_thd3~0_In-1308073195)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1308073195, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1308073195} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1308073195, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1308073195, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1308073195|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:03:49,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-210289545 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd3~0_In-210289545 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-210289545 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-210289545 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-210289545|)) (and (or .cse3 .cse2) (= ~a$r_buff1_thd3~0_In-210289545 |P2Thread1of1ForFork0_#t~ite43_Out-210289545|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-210289545, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-210289545, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-210289545, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-210289545} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-210289545|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-210289545, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-210289545, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-210289545, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-210289545} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:03:49,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1917569046 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-1917569046 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-1917569046 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1917569046 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1917569046| ~a$w_buff1_used~0_In-1917569046) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1917569046| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1917569046, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1917569046, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1917569046, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1917569046} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1917569046, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1917569046, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1917569046, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1917569046|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1917569046} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:03:49,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1844032715 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In1844032715 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In1844032715 |P1Thread1of1ForFork2_#t~ite13_Out1844032715|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out1844032715| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1844032715, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1844032715} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1844032715, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1844032715, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1844032715|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:03:49,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd2~0_In1751526358 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In1751526358 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In1751526358 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1751526358 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1751526358|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In1751526358 |P1Thread1of1ForFork2_#t~ite14_Out1751526358|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1751526358, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1751526358, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1751526358, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1751526358} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1751526358, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1751526358, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1751526358, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1751526358, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1751526358|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:03:49,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~a$r_buff1_thd3~0_123 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:03:49,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_44| v_~a$r_buff1_thd2~0_99) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_44|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_43|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:03:49,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L841-1-->L847: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:03:49,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In1078514061 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In1078514061 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1078514061| ~a~0_In1078514061) (or .cse0 .cse1)) (and (not .cse1) (= ~a$w_buff1~0_In1078514061 |ULTIMATE.start_main_#t~ite47_Out1078514061|) (not .cse0)))) InVars {~a~0=~a~0_In1078514061, ~a$w_buff1~0=~a$w_buff1~0_In1078514061, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1078514061, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1078514061} OutVars{~a~0=~a~0_In1078514061, ~a$w_buff1~0=~a$w_buff1~0_In1078514061, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1078514061|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1078514061, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1078514061} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:03:49,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L847-4-->L848: Formula: (= v_~a~0_44 |v_ULTIMATE.start_main_#t~ite47_19|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_19|} OutVars{~a~0=v_~a~0_44, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_18|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 16:03:49,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1488605557 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1488605557 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1488605557|)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1488605557 |ULTIMATE.start_main_#t~ite49_Out-1488605557|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1488605557, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1488605557} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1488605557, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1488605557|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1488605557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:03:49,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In1592022641 256))) (.cse2 (= (mod ~a$r_buff1_thd0~0_In1592022641 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1592022641 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1592022641 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1592022641 |ULTIMATE.start_main_#t~ite50_Out1592022641|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1592022641|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1592022641, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1592022641, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1592022641, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1592022641} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1592022641|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1592022641, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1592022641, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1592022641, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1592022641} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:03:49,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-470773701 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-470773701 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-470773701|) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In-470773701 |ULTIMATE.start_main_#t~ite51_Out-470773701|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-470773701, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-470773701} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-470773701|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-470773701, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-470773701} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:03:49,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-1967339893 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1967339893 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-1967339893 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1967339893 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1967339893|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out-1967339893| ~a$r_buff1_thd0~0_In-1967339893) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1967339893, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1967339893, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1967339893, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1967339893} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1967339893|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1967339893, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1967339893, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1967339893, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1967339893} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:03:49,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~a$r_buff1_thd0~0_125 |v_ULTIMATE.start_main_#t~ite52_55|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~__unbuffered_p2_EBX~0_29 0) (= 0 v_~__unbuffered_p1_EAX~0_28) (= 1 v_~__unbuffered_p2_EAX~0_26) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~main$tmp_guard1~0_29 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= 1 v_~__unbuffered_p0_EAX~0_85)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_55|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_125, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:03:49,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:03:49 BasicIcfg [2019-12-27 16:03:49,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:03:49,965 INFO L168 Benchmark]: Toolchain (without parser) took 158942.35 ms. Allocated memory was 139.5 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 102.3 MB in the beginning and 940.0 MB in the end (delta: -837.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 16:03:49,966 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 16:03:49,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.93 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 157.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:03:49,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.87 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:03:49,967 INFO L168 Benchmark]: Boogie Preprocessor took 52.02 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:03:49,968 INFO L168 Benchmark]: RCFGBuilder took 862.11 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 101.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:03:49,968 INFO L168 Benchmark]: TraceAbstraction took 157168.52 ms. Allocated memory was 203.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.6 MB in the beginning and 940.0 MB in the end (delta: -839.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 16:03:49,970 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.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.93 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 157.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.87 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.02 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 862.11 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 101.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 157168.52 ms. Allocated memory was 203.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.6 MB in the beginning and 940.0 MB in the end (delta: -839.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 179 ProgramPointsBefore, 94 ProgramPointsAfterwards, 216 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 33 ChoiceCompositions, 7151 VarBasedMoverChecksPositive, 221 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 258 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 80759 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$w_buff1 = a$w_buff0 [L738] 1 a$w_buff0 = 1 [L739] 1 a$w_buff1_used = a$w_buff0_used [L740] 1 a$w_buff0_used = (_Bool)1 [L758] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L758] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 156.8s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 79.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8877 SDtfs, 19904 SDslu, 42770 SDs, 0 SdLazy, 31038 SolverSat, 1260 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1207 GetRequests, 271 SyntacticMatches, 162 SemanticMatches, 774 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10422 ImplicationChecksByTransitivity, 25.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156295occurred 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: 34.4s AutomataMinimizationTime, 36 MinimizatonAttempts, 326276 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1711 NumberOfCodeBlocks, 1711 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1608 ConstructedInterpolants, 0 QuantifiedInterpolants, 348757 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...