/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_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:59:58,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:59:58,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:59:58,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:59:58,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:59:58,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:59:58,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:59:58,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:59:58,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:59:58,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:59:58,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:59:58,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:59:58,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:59:58,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:59:58,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:59:58,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:59:58,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:59:58,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:59:58,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:59:58,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:59:58,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:59:58,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:59:58,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:59:58,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:59:58,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:59:58,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:59:58,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:59:58,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:59:58,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:59:58,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:59:58,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:59:58,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:59:58,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:59:58,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:59:58,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:59:58,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:59:58,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:59:58,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:59:58,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:59:58,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:59:58,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:59:58,709 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 15:59:58,737 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:59:58,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:59:58,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:59:58,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:59:58,748 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:59:58,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:59:58,748 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:59:58,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:59:58,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:59:58,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:59:58,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:59:58,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:59:58,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:59:58,749 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:59:58,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:59:58,750 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:59:58,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:59:58,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:59:58,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:59:58,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:59:58,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:59:58,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:59:58,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:59:58,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:59:58,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:59:58,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:59:58,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:59:58,753 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:59:58,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:59:58,754 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:59:58,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:59:59,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:59:59,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:59:59,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:59:59,032 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:59:59,032 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:59:59,033 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_pso.oepc.i [2019-12-27 15:59:59,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d17f485/f5170f938dfb42e0a5ac2ddd4dda4aa2/FLAG58aa5b699 [2019-12-27 15:59:59,691 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:59:59,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_pso.oepc.i [2019-12-27 15:59:59,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d17f485/f5170f938dfb42e0a5ac2ddd4dda4aa2/FLAG58aa5b699 [2019-12-27 15:59:59,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d17f485/f5170f938dfb42e0a5ac2ddd4dda4aa2 [2019-12-27 15:59:59,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:59:59,971 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:59:59,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:59:59,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:59:59,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:59:59,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:59:59" (1/1) ... [2019-12-27 15:59:59,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d4032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:59:59, skipping insertion in model container [2019-12-27 15:59:59,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:59:59" (1/1) ... [2019-12-27 15:59:59,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:00:00,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:00:00,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:00:00,606 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:00:00,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:00:00,790 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:00:00,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:00:00 WrapperNode [2019-12-27 16:00:00,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:00:00,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:00:00,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:00:00,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:00:00,803 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:00:00" (1/1) ... [2019-12-27 16:00:00,829 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:00:00" (1/1) ... [2019-12-27 16:00:00,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:00:00,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:00:00,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:00:00,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:00:00,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:00:00" (1/1) ... [2019-12-27 16:00:00,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:00:00" (1/1) ... [2019-12-27 16:00:00,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:00:00" (1/1) ... [2019-12-27 16:00:00,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:00:00" (1/1) ... [2019-12-27 16:00:00,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:00:00" (1/1) ... [2019-12-27 16:00:00,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:00:00" (1/1) ... [2019-12-27 16:00:00,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:00:00" (1/1) ... [2019-12-27 16:00:00,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:00:00,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:00:00,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:00:00,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:00:00,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:00:00" (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:00:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:00:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:00:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:00:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:00:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:00:00,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:00:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:00:00,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:00:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:00:00,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:00:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:00:00,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:00:00,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:00:00,989 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:00:01,866 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:00:01,866 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:00:01,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:00:01 BoogieIcfgContainer [2019-12-27 16:00:01,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:00:01,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:00:01,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:00:01,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:00:01,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:59:59" (1/3) ... [2019-12-27 16:00:01,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f8653d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:00:01, skipping insertion in model container [2019-12-27 16:00:01,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:00:00" (2/3) ... [2019-12-27 16:00:01,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f8653d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:00:01, skipping insertion in model container [2019-12-27 16:00:01,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:00:01" (3/3) ... [2019-12-27 16:00:01,877 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_pso.oepc.i [2019-12-27 16:00:01,888 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:00:01,889 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:00:01,897 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:00:01,898 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:00:01,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,994 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,994 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:01,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,022 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,024 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,040 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,040 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:00:02,059 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:00:02,078 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:00:02,078 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:00:02,079 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:00:02,079 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:00:02,079 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:00:02,079 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:00:02,079 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:00:02,079 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:00:02,097 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 16:00:02,099 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 16:00:02,237 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 16:00:02,238 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:00:02,259 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:00:02,287 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 16:00:02,344 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 16:00:02,344 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:00:02,353 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:00:02,375 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:00:02,376 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:00:06,957 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-12-27 16:00:07,700 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 16:00:07,848 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 16:00:07,994 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80759 [2019-12-27 16:00:07,995 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 16:00:07,998 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 102 transitions [2019-12-27 16:00:26,495 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118022 states. [2019-12-27 16:00:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 118022 states. [2019-12-27 16:00:26,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:00:26,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:00:26,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:00:26,504 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:00:26,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:00:26,510 INFO L82 PathProgramCache]: Analyzing trace with hash 922782, now seen corresponding path program 1 times [2019-12-27 16:00:26,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:00:26,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906802039] [2019-12-27 16:00:26,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:00:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:00:26,757 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:00:26,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906802039] [2019-12-27 16:00:26,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:00:26,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:00:26,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [535571769] [2019-12-27 16:00:26,763 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:00:26,768 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:00:26,778 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:00:26,778 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:00:26,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:00:26,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:00:26,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:00:26,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:00:26,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:00:26,801 INFO L87 Difference]: Start difference. First operand 118022 states. Second operand 3 states. [2019-12-27 16:00:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:00:30,369 INFO L93 Difference]: Finished difference Result 116858 states and 495582 transitions. [2019-12-27 16:00:30,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:00:30,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:00:30,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:00:31,214 INFO L225 Difference]: With dead ends: 116858 [2019-12-27 16:00:31,215 INFO L226 Difference]: Without dead ends: 110138 [2019-12-27 16:00:31,216 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:00:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110138 states. [2019-12-27 16:00:40,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110138 to 110138. [2019-12-27 16:00:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110138 states. [2019-12-27 16:00:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110138 states to 110138 states and 466462 transitions. [2019-12-27 16:00:41,166 INFO L78 Accepts]: Start accepts. Automaton has 110138 states and 466462 transitions. Word has length 3 [2019-12-27 16:00:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:00:41,167 INFO L462 AbstractCegarLoop]: Abstraction has 110138 states and 466462 transitions. [2019-12-27 16:00:41,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:00:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 110138 states and 466462 transitions. [2019-12-27 16:00:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:00:41,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:00:41,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:00:41,171 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:00:41,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:00:41,171 INFO L82 PathProgramCache]: Analyzing trace with hash 228105342, now seen corresponding path program 1 times [2019-12-27 16:00:41,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:00:41,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315415669] [2019-12-27 16:00:41,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:00:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:00:41,267 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:00:41,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315415669] [2019-12-27 16:00:41,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:00:41,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:00:41,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1897570203] [2019-12-27 16:00:41,269 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:00:41,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:00:41,273 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:00:41,274 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:00:41,274 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:00:41,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:00:41,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:00:41,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:00:41,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:00:41,276 INFO L87 Difference]: Start difference. First operand 110138 states and 466462 transitions. Second operand 4 states. [2019-12-27 16:00:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:00:47,503 INFO L93 Difference]: Finished difference Result 170904 states and 695583 transitions. [2019-12-27 16:00:47,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:00:47,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:00:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:00:48,205 INFO L225 Difference]: With dead ends: 170904 [2019-12-27 16:00:48,205 INFO L226 Difference]: Without dead ends: 170855 [2019-12-27 16:00:48,206 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:00:53,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170855 states. [2019-12-27 16:00:56,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170855 to 156295. [2019-12-27 16:00:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156295 states. [2019-12-27 16:00:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156295 states to 156295 states and 644009 transitions. [2019-12-27 16:00:57,272 INFO L78 Accepts]: Start accepts. Automaton has 156295 states and 644009 transitions. Word has length 11 [2019-12-27 16:00:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:00:57,272 INFO L462 AbstractCegarLoop]: Abstraction has 156295 states and 644009 transitions. [2019-12-27 16:00:57,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:00:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 156295 states and 644009 transitions. [2019-12-27 16:00:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:00:57,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:00:57,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:00:57,281 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:00:57,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:00:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash 891607686, now seen corresponding path program 1 times [2019-12-27 16:00:57,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:00:57,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964632032] [2019-12-27 16:00:57,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:00:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:00:57,337 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:00:57,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964632032] [2019-12-27 16:00:57,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:00:57,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:00:57,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1577245104] [2019-12-27 16:00:57,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:00:57,340 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:00:57,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:00:57,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:00:57,343 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:00:57,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:00:57,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:00:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:00:57,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:00:57,344 INFO L87 Difference]: Start difference. First operand 156295 states and 644009 transitions. Second operand 3 states. [2019-12-27 16:00:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:00:57,494 INFO L93 Difference]: Finished difference Result 33673 states and 108735 transitions. [2019-12-27 16:00:57,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:00:57,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:00:57,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:00:57,549 INFO L225 Difference]: With dead ends: 33673 [2019-12-27 16:00:57,549 INFO L226 Difference]: Without dead ends: 33673 [2019-12-27 16:00:57,549 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:00:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33673 states. [2019-12-27 16:01:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33673 to 33673. [2019-12-27 16:01:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33673 states. [2019-12-27 16:01:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33673 states to 33673 states and 108735 transitions. [2019-12-27 16:01:02,863 INFO L78 Accepts]: Start accepts. Automaton has 33673 states and 108735 transitions. Word has length 13 [2019-12-27 16:01:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:02,863 INFO L462 AbstractCegarLoop]: Abstraction has 33673 states and 108735 transitions. [2019-12-27 16:01:02,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:01:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 33673 states and 108735 transitions. [2019-12-27 16:01:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:01:02,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:02,867 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:01:02,867 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:01:02,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:02,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1993825600, now seen corresponding path program 1 times [2019-12-27 16:01:02,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:02,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354138669] [2019-12-27 16:01:02,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:03,013 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:03,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354138669] [2019-12-27 16:01:03,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:03,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:01:03,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [558276057] [2019-12-27 16:01:03,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:03,021 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:03,024 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:01:03,024 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:03,025 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:01:03,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:01:03,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:03,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:01:03,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:01:03,026 INFO L87 Difference]: Start difference. First operand 33673 states and 108735 transitions. Second operand 4 states. [2019-12-27 16:01:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:03,399 INFO L93 Difference]: Finished difference Result 42056 states and 135369 transitions. [2019-12-27 16:01:03,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:01:03,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:01:03,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:03,470 INFO L225 Difference]: With dead ends: 42056 [2019-12-27 16:01:03,470 INFO L226 Difference]: Without dead ends: 42056 [2019-12-27 16:01:03,471 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:01:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42056 states. [2019-12-27 16:01:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42056 to 37770. [2019-12-27 16:01:04,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37770 states. [2019-12-27 16:01:04,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37770 states to 37770 states and 121950 transitions. [2019-12-27 16:01:04,145 INFO L78 Accepts]: Start accepts. Automaton has 37770 states and 121950 transitions. Word has length 16 [2019-12-27 16:01:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:04,146 INFO L462 AbstractCegarLoop]: Abstraction has 37770 states and 121950 transitions. [2019-12-27 16:01:04,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:01:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 37770 states and 121950 transitions. [2019-12-27 16:01:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:01:04,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:04,154 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:01:04,154 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:01:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:04,155 INFO L82 PathProgramCache]: Analyzing trace with hash 674854723, now seen corresponding path program 1 times [2019-12-27 16:01:04,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:04,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301256325] [2019-12-27 16:01:04,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:04,246 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:04,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301256325] [2019-12-27 16:01:04,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:04,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:01:04,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [756116422] [2019-12-27 16:01:04,247 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:04,251 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:04,260 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 64 transitions. [2019-12-27 16:01:04,261 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:04,264 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:01:04,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:01:04,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:04,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:01:04,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:01:04,265 INFO L87 Difference]: Start difference. First operand 37770 states and 121950 transitions. Second operand 5 states. [2019-12-27 16:01:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:05,297 INFO L93 Difference]: Finished difference Result 48537 states and 154193 transitions. [2019-12-27 16:01:05,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:01:05,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:01:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:05,378 INFO L225 Difference]: With dead ends: 48537 [2019-12-27 16:01:05,378 INFO L226 Difference]: Without dead ends: 48530 [2019-12-27 16:01:05,379 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:01:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48530 states. [2019-12-27 16:01:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48530 to 37459. [2019-12-27 16:01:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37459 states. [2019-12-27 16:01:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37459 states to 37459 states and 120776 transitions. [2019-12-27 16:01:06,089 INFO L78 Accepts]: Start accepts. Automaton has 37459 states and 120776 transitions. Word has length 22 [2019-12-27 16:01:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:06,090 INFO L462 AbstractCegarLoop]: Abstraction has 37459 states and 120776 transitions. [2019-12-27 16:01:06,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:01:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 37459 states and 120776 transitions. [2019-12-27 16:01:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:01:06,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:06,102 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:01:06,103 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:01:06,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:06,103 INFO L82 PathProgramCache]: Analyzing trace with hash 332765886, now seen corresponding path program 1 times [2019-12-27 16:01:06,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:06,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881965245] [2019-12-27 16:01:06,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:06,169 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:06,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881965245] [2019-12-27 16:01:06,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:06,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:01:06,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [485742565] [2019-12-27 16:01:06,171 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:06,175 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:06,184 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:01:06,185 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:06,226 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:01:06,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:01:06,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:06,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:01:06,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:01:06,227 INFO L87 Difference]: Start difference. First operand 37459 states and 120776 transitions. Second operand 5 states. [2019-12-27 16:01:06,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:06,306 INFO L93 Difference]: Finished difference Result 14576 states and 44297 transitions. [2019-12-27 16:01:06,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:01:06,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:01:06,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:06,332 INFO L225 Difference]: With dead ends: 14576 [2019-12-27 16:01:06,333 INFO L226 Difference]: Without dead ends: 14576 [2019-12-27 16:01:06,333 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:01:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2019-12-27 16:01:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14332. [2019-12-27 16:01:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14332 states. [2019-12-27 16:01:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14332 states to 14332 states and 43601 transitions. [2019-12-27 16:01:06,545 INFO L78 Accepts]: Start accepts. Automaton has 14332 states and 43601 transitions. Word has length 25 [2019-12-27 16:01:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:06,546 INFO L462 AbstractCegarLoop]: Abstraction has 14332 states and 43601 transitions. [2019-12-27 16:01:06,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:01:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand 14332 states and 43601 transitions. [2019-12-27 16:01:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:01:06,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:06,556 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:01:06,556 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:01:06,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:06,556 INFO L82 PathProgramCache]: Analyzing trace with hash 445555351, now seen corresponding path program 1 times [2019-12-27 16:01:06,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:06,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602264635] [2019-12-27 16:01:06,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:06,607 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:06,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602264635] [2019-12-27 16:01:06,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:06,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:01:06,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1715481357] [2019-12-27 16:01:06,608 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:06,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:06,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:01:06,620 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:06,620 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:01:06,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:01:06,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:06,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:01:06,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:01:06,621 INFO L87 Difference]: Start difference. First operand 14332 states and 43601 transitions. Second operand 3 states. [2019-12-27 16:01:06,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:06,732 INFO L93 Difference]: Finished difference Result 22367 states and 67484 transitions. [2019-12-27 16:01:06,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:01:06,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:01:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:06,762 INFO L225 Difference]: With dead ends: 22367 [2019-12-27 16:01:06,762 INFO L226 Difference]: Without dead ends: 22367 [2019-12-27 16:01:06,762 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:01:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-27 16:01:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-27 16:01:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-27 16:01:07,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51830 transitions. [2019-12-27 16:01:07,040 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51830 transitions. Word has length 27 [2019-12-27 16:01:07,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:07,040 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51830 transitions. [2019-12-27 16:01:07,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:01:07,041 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51830 transitions. [2019-12-27 16:01:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:01:07,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:07,053 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:01:07,053 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:01:07,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:07,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1217095067, now seen corresponding path program 1 times [2019-12-27 16:01:07,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:07,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069684979] [2019-12-27 16:01:07,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:07,097 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:07,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069684979] [2019-12-27 16:01:07,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:07,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:01:07,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1974170678] [2019-12-27 16:01:07,098 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:07,102 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:07,109 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:01:07,109 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:07,109 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:01:07,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:01:07,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:07,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:01:07,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:01:07,110 INFO L87 Difference]: Start difference. First operand 16938 states and 51830 transitions. Second operand 3 states. [2019-12-27 16:01:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:07,392 INFO L93 Difference]: Finished difference Result 22367 states and 66493 transitions. [2019-12-27 16:01:07,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:01:07,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:01:07,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:07,422 INFO L225 Difference]: With dead ends: 22367 [2019-12-27 16:01:07,422 INFO L226 Difference]: Without dead ends: 22367 [2019-12-27 16:01:07,422 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:01:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-27 16:01:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-27 16:01:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-27 16:01:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 50839 transitions. [2019-12-27 16:01:07,704 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 50839 transitions. Word has length 27 [2019-12-27 16:01:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:07,704 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 50839 transitions. [2019-12-27 16:01:07,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:01:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 50839 transitions. [2019-12-27 16:01:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:01:07,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:07,717 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:01:07,717 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:01:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:07,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1361870049, now seen corresponding path program 1 times [2019-12-27 16:01:07,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:07,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588826103] [2019-12-27 16:01:07,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:07,818 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:07,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588826103] [2019-12-27 16:01:07,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:07,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:01:07,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [140663120] [2019-12-27 16:01:07,820 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:07,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:07,834 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:01:07,834 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:07,835 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:01:07,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:01:07,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:07,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:01:07,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:01:07,837 INFO L87 Difference]: Start difference. First operand 16938 states and 50839 transitions. Second operand 6 states. [2019-12-27 16:01:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:08,556 INFO L93 Difference]: Finished difference Result 31275 states and 92943 transitions. [2019-12-27 16:01:08,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:01:08,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 16:01:08,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:08,601 INFO L225 Difference]: With dead ends: 31275 [2019-12-27 16:01:08,602 INFO L226 Difference]: Without dead ends: 31275 [2019-12-27 16:01:08,602 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:01:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31275 states. [2019-12-27 16:01:08,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31275 to 19607. [2019-12-27 16:01:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19607 states. [2019-12-27 16:01:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 58673 transitions. [2019-12-27 16:01:08,973 INFO L78 Accepts]: Start accepts. Automaton has 19607 states and 58673 transitions. Word has length 27 [2019-12-27 16:01:08,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:08,974 INFO L462 AbstractCegarLoop]: Abstraction has 19607 states and 58673 transitions. [2019-12-27 16:01:08,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:01:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 19607 states and 58673 transitions. [2019-12-27 16:01:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:01:08,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:08,989 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:01:08,989 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:01:08,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:08,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2015671980, now seen corresponding path program 1 times [2019-12-27 16:01:08,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:08,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243974143] [2019-12-27 16:01:08,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:09,077 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:09,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243974143] [2019-12-27 16:01:09,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:09,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:01:09,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [451303609] [2019-12-27 16:01:09,078 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:09,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:09,091 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:01:09,091 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:09,091 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:01:09,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:01:09,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:09,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:01:09,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:01:09,092 INFO L87 Difference]: Start difference. First operand 19607 states and 58673 transitions. Second operand 6 states. [2019-12-27 16:01:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:09,753 INFO L93 Difference]: Finished difference Result 30618 states and 90299 transitions. [2019-12-27 16:01:09,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:01:09,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 16:01:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:09,811 INFO L225 Difference]: With dead ends: 30618 [2019-12-27 16:01:09,811 INFO L226 Difference]: Without dead ends: 30618 [2019-12-27 16:01:09,812 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:01:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30618 states. [2019-12-27 16:01:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30618 to 19271. [2019-12-27 16:01:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19271 states. [2019-12-27 16:01:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19271 states to 19271 states and 57577 transitions. [2019-12-27 16:01:10,188 INFO L78 Accepts]: Start accepts. Automaton has 19271 states and 57577 transitions. Word has length 28 [2019-12-27 16:01:10,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:10,188 INFO L462 AbstractCegarLoop]: Abstraction has 19271 states and 57577 transitions. [2019-12-27 16:01:10,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:01:10,188 INFO L276 IsEmpty]: Start isEmpty. Operand 19271 states and 57577 transitions. [2019-12-27 16:01:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:01:10,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:10,414 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:01:10,414 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:01:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:10,415 INFO L82 PathProgramCache]: Analyzing trace with hash 405285854, now seen corresponding path program 1 times [2019-12-27 16:01:10,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:10,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641115722] [2019-12-27 16:01:10,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:10,476 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:10,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641115722] [2019-12-27 16:01:10,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:10,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:01:10,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2050670140] [2019-12-27 16:01:10,477 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:10,484 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:10,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 76 transitions. [2019-12-27 16:01:10,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:10,514 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:01:10,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:01:10,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:10,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:01:10,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:01:10,516 INFO L87 Difference]: Start difference. First operand 19271 states and 57577 transitions. Second operand 5 states. [2019-12-27 16:01:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:10,949 INFO L93 Difference]: Finished difference Result 23829 states and 70169 transitions. [2019-12-27 16:01:10,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:01:10,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 16:01:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:10,993 INFO L225 Difference]: With dead ends: 23829 [2019-12-27 16:01:10,993 INFO L226 Difference]: Without dead ends: 23829 [2019-12-27 16:01:10,993 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:01:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23829 states. [2019-12-27 16:01:11,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23829 to 20047. [2019-12-27 16:01:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20047 states. [2019-12-27 16:01:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20047 states to 20047 states and 59899 transitions. [2019-12-27 16:01:11,403 INFO L78 Accepts]: Start accepts. Automaton has 20047 states and 59899 transitions. Word has length 33 [2019-12-27 16:01:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:11,403 INFO L462 AbstractCegarLoop]: Abstraction has 20047 states and 59899 transitions. [2019-12-27 16:01:11,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:01:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 20047 states and 59899 transitions. [2019-12-27 16:01:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:01:11,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:11,428 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:01:11,428 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:01:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:11,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1258895234, now seen corresponding path program 2 times [2019-12-27 16:01:11,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:11,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80270335] [2019-12-27 16:01:11,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:01:11,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80270335] [2019-12-27 16:01:11,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:11,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:01:11,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [323404791] [2019-12-27 16:01:11,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:11,526 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:11,542 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 70 transitions. [2019-12-27 16:01:11,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:11,543 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:01:11,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:01:11,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:11,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:01:11,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:01:11,545 INFO L87 Difference]: Start difference. First operand 20047 states and 59899 transitions. Second operand 7 states. [2019-12-27 16:01:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:12,889 INFO L93 Difference]: Finished difference Result 39715 states and 116920 transitions. [2019-12-27 16:01:12,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:01:12,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 16:01:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:12,948 INFO L225 Difference]: With dead ends: 39715 [2019-12-27 16:01:12,948 INFO L226 Difference]: Without dead ends: 39715 [2019-12-27 16:01:12,949 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:01:13,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39715 states. [2019-12-27 16:01:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39715 to 21295. [2019-12-27 16:01:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21295 states. [2019-12-27 16:01:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21295 states to 21295 states and 63643 transitions. [2019-12-27 16:01:13,388 INFO L78 Accepts]: Start accepts. Automaton has 21295 states and 63643 transitions. Word has length 33 [2019-12-27 16:01:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:13,388 INFO L462 AbstractCegarLoop]: Abstraction has 21295 states and 63643 transitions. [2019-12-27 16:01:13,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:01:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 21295 states and 63643 transitions. [2019-12-27 16:01:13,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:01:13,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:13,405 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:01:13,406 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:01:13,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:13,406 INFO L82 PathProgramCache]: Analyzing trace with hash -454706214, now seen corresponding path program 3 times [2019-12-27 16:01:13,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:13,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013255438] [2019-12-27 16:01:13,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:13,519 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:13,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013255438] [2019-12-27 16:01:13,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:13,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:01:13,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1631504602] [2019-12-27 16:01:13,521 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:13,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:13,559 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 94 transitions. [2019-12-27 16:01:13,559 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:13,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:01:13,588 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:01:13,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:01:13,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:13,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:01:13,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:01:13,590 INFO L87 Difference]: Start difference. First operand 21295 states and 63643 transitions. Second operand 9 states. [2019-12-27 16:01:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:16,700 INFO L93 Difference]: Finished difference Result 60787 states and 176481 transitions. [2019-12-27 16:01:16,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 16:01:16,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 16:01:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:16,822 INFO L225 Difference]: With dead ends: 60787 [2019-12-27 16:01:16,822 INFO L226 Difference]: Without dead ends: 60787 [2019-12-27 16:01:16,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1079, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 16:01:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60787 states. [2019-12-27 16:01:17,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60787 to 23978. [2019-12-27 16:01:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23978 states. [2019-12-27 16:01:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23978 states to 23978 states and 71675 transitions. [2019-12-27 16:01:17,460 INFO L78 Accepts]: Start accepts. Automaton has 23978 states and 71675 transitions. Word has length 33 [2019-12-27 16:01:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:17,460 INFO L462 AbstractCegarLoop]: Abstraction has 23978 states and 71675 transitions. [2019-12-27 16:01:17,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:01:17,460 INFO L276 IsEmpty]: Start isEmpty. Operand 23978 states and 71675 transitions. [2019-12-27 16:01:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:01:17,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:17,481 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:01:17,482 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:01:17,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:17,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1655017129, now seen corresponding path program 1 times [2019-12-27 16:01:17,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:17,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961328078] [2019-12-27 16:01:17,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:17,603 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:17,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961328078] [2019-12-27 16:01:17,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:17,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:01:17,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [323957302] [2019-12-27 16:01:17,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:17,613 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:17,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 71 transitions. [2019-12-27 16:01:17,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:17,633 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:01:17,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:01:17,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:17,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:01:17,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:01:17,634 INFO L87 Difference]: Start difference. First operand 23978 states and 71675 transitions. Second operand 7 states. [2019-12-27 16:01:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:18,895 INFO L93 Difference]: Finished difference Result 42400 states and 124554 transitions. [2019-12-27 16:01:18,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:01:18,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 16:01:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:18,956 INFO L225 Difference]: With dead ends: 42400 [2019-12-27 16:01:18,956 INFO L226 Difference]: Without dead ends: 42400 [2019-12-27 16:01:18,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 16:01:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42400 states. [2019-12-27 16:01:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42400 to 22695. [2019-12-27 16:01:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22695 states. [2019-12-27 16:01:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22695 states to 22695 states and 67928 transitions. [2019-12-27 16:01:19,841 INFO L78 Accepts]: Start accepts. Automaton has 22695 states and 67928 transitions. Word has length 34 [2019-12-27 16:01:19,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:19,841 INFO L462 AbstractCegarLoop]: Abstraction has 22695 states and 67928 transitions. [2019-12-27 16:01:19,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:01:19,841 INFO L276 IsEmpty]: Start isEmpty. Operand 22695 states and 67928 transitions. [2019-12-27 16:01:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:01:19,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:19,864 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:01:19,865 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:01:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:19,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2107636055, now seen corresponding path program 2 times [2019-12-27 16:01:19,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:19,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387559811] [2019-12-27 16:01:19,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:19,969 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:19,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387559811] [2019-12-27 16:01:19,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:19,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:01:19,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1217061076] [2019-12-27 16:01:19,970 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:19,977 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:20,003 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 98 transitions. [2019-12-27 16:01:20,004 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:20,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:01:20,033 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:01:20,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:01:20,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:20,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:01:20,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:01:20,034 INFO L87 Difference]: Start difference. First operand 22695 states and 67928 transitions. Second operand 9 states. [2019-12-27 16:01:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:23,046 INFO L93 Difference]: Finished difference Result 50118 states and 144896 transitions. [2019-12-27 16:01:23,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 16:01:23,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 16:01:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:23,119 INFO L225 Difference]: With dead ends: 50118 [2019-12-27 16:01:23,120 INFO L226 Difference]: Without dead ends: 50118 [2019-12-27 16:01:23,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=1021, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 16:01:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50118 states. [2019-12-27 16:01:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50118 to 21088. [2019-12-27 16:01:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21088 states. [2019-12-27 16:01:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21088 states to 21088 states and 63086 transitions. [2019-12-27 16:01:23,630 INFO L78 Accepts]: Start accepts. Automaton has 21088 states and 63086 transitions. Word has length 34 [2019-12-27 16:01:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:23,631 INFO L462 AbstractCegarLoop]: Abstraction has 21088 states and 63086 transitions. [2019-12-27 16:01:23,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:01:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 21088 states and 63086 transitions. [2019-12-27 16:01:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:01:23,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:23,655 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:01:23,655 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:01:23,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:23,656 INFO L82 PathProgramCache]: Analyzing trace with hash -887512480, now seen corresponding path program 1 times [2019-12-27 16:01:23,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:23,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284286232] [2019-12-27 16:01:23,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:23,714 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:23,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284286232] [2019-12-27 16:01:23,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:23,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:01:23,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [425409796] [2019-12-27 16:01:23,716 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:23,723 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:23,787 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 339 transitions. [2019-12-27 16:01:23,788 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:23,803 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:01:23,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:01:23,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:23,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:01:23,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:01:23,804 INFO L87 Difference]: Start difference. First operand 21088 states and 63086 transitions. Second operand 5 states. [2019-12-27 16:01:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:23,957 INFO L93 Difference]: Finished difference Result 37215 states and 111529 transitions. [2019-12-27 16:01:23,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:01:23,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 16:01:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:23,991 INFO L225 Difference]: With dead ends: 37215 [2019-12-27 16:01:23,991 INFO L226 Difference]: Without dead ends: 19200 [2019-12-27 16:01:23,992 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:01:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19200 states. [2019-12-27 16:01:24,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19200 to 18930. [2019-12-27 16:01:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18930 states. [2019-12-27 16:01:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18930 states to 18930 states and 55667 transitions. [2019-12-27 16:01:24,295 INFO L78 Accepts]: Start accepts. Automaton has 18930 states and 55667 transitions. Word has length 39 [2019-12-27 16:01:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:24,296 INFO L462 AbstractCegarLoop]: Abstraction has 18930 states and 55667 transitions. [2019-12-27 16:01:24,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:01:24,296 INFO L276 IsEmpty]: Start isEmpty. Operand 18930 states and 55667 transitions. [2019-12-27 16:01:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:01:24,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:24,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:01:24,319 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:01:24,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:24,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1585510358, now seen corresponding path program 2 times [2019-12-27 16:01:24,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:24,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342982865] [2019-12-27 16:01:24,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:24,361 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:24,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342982865] [2019-12-27 16:01:24,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:24,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:01:24,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [357307066] [2019-12-27 16:01:24,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:24,370 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:24,432 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 355 transitions. [2019-12-27 16:01:24,432 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:24,433 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:01:24,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:01:24,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:24,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:01:24,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:01:24,435 INFO L87 Difference]: Start difference. First operand 18930 states and 55667 transitions. Second operand 3 states. [2019-12-27 16:01:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:24,718 INFO L93 Difference]: Finished difference Result 18929 states and 55665 transitions. [2019-12-27 16:01:24,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:01:24,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:01:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:24,745 INFO L225 Difference]: With dead ends: 18929 [2019-12-27 16:01:24,745 INFO L226 Difference]: Without dead ends: 18929 [2019-12-27 16:01:24,745 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:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18929 states. [2019-12-27 16:01:24,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18929 to 18929. [2019-12-27 16:01:24,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18929 states. [2019-12-27 16:01:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18929 states to 18929 states and 55665 transitions. [2019-12-27 16:01:25,003 INFO L78 Accepts]: Start accepts. Automaton has 18929 states and 55665 transitions. Word has length 39 [2019-12-27 16:01:25,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:25,003 INFO L462 AbstractCegarLoop]: Abstraction has 18929 states and 55665 transitions. [2019-12-27 16:01:25,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:01:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 18929 states and 55665 transitions. [2019-12-27 16:01:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:01:25,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:25,021 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:01:25,021 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:01:25,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:25,022 INFO L82 PathProgramCache]: Analyzing trace with hash -408863373, now seen corresponding path program 1 times [2019-12-27 16:01:25,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:25,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538144366] [2019-12-27 16:01:25,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:25,076 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:25,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538144366] [2019-12-27 16:01:25,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:25,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:01:25,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1745640323] [2019-12-27 16:01:25,077 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:25,086 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:25,118 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 122 transitions. [2019-12-27 16:01:25,118 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:25,130 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:01:25,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:01:25,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:25,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:01:25,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:01:25,131 INFO L87 Difference]: Start difference. First operand 18929 states and 55665 transitions. Second operand 5 states. [2019-12-27 16:01:25,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:25,614 INFO L93 Difference]: Finished difference Result 43022 states and 126341 transitions. [2019-12-27 16:01:25,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:01:25,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 16:01:25,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:25,661 INFO L225 Difference]: With dead ends: 43022 [2019-12-27 16:01:25,661 INFO L226 Difference]: Without dead ends: 26440 [2019-12-27 16:01:25,662 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:01:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26440 states. [2019-12-27 16:01:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26440 to 17258. [2019-12-27 16:01:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17258 states. [2019-12-27 16:01:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17258 states to 17258 states and 49452 transitions. [2019-12-27 16:01:26,038 INFO L78 Accepts]: Start accepts. Automaton has 17258 states and 49452 transitions. Word has length 40 [2019-12-27 16:01:26,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:26,039 INFO L462 AbstractCegarLoop]: Abstraction has 17258 states and 49452 transitions. [2019-12-27 16:01:26,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:01:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 17258 states and 49452 transitions. [2019-12-27 16:01:26,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:01:26,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:26,056 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:01:26,056 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:01:26,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:26,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1542545665, now seen corresponding path program 2 times [2019-12-27 16:01:26,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:26,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020270298] [2019-12-27 16:01:26,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:26,144 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:26,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020270298] [2019-12-27 16:01:26,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:26,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:01:26,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [320936121] [2019-12-27 16:01:26,145 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:26,153 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:26,235 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 16:01:26,235 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:26,237 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:01:26,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:01:26,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:26,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:01:26,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:01:26,238 INFO L87 Difference]: Start difference. First operand 17258 states and 49452 transitions. Second operand 3 states. [2019-12-27 16:01:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:26,296 INFO L93 Difference]: Finished difference Result 17170 states and 49183 transitions. [2019-12-27 16:01:26,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:01:26,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 16:01:26,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:26,319 INFO L225 Difference]: With dead ends: 17170 [2019-12-27 16:01:26,319 INFO L226 Difference]: Without dead ends: 17170 [2019-12-27 16:01:26,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:01:26,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17170 states. [2019-12-27 16:01:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17170 to 15351. [2019-12-27 16:01:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15351 states. [2019-12-27 16:01:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15351 states to 15351 states and 44414 transitions. [2019-12-27 16:01:26,546 INFO L78 Accepts]: Start accepts. Automaton has 15351 states and 44414 transitions. Word has length 40 [2019-12-27 16:01:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:26,547 INFO L462 AbstractCegarLoop]: Abstraction has 15351 states and 44414 transitions. [2019-12-27 16:01:26,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:01:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 15351 states and 44414 transitions. [2019-12-27 16:01:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:01:26,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:26,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:01:26,562 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:01:26,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:26,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1254097199, now seen corresponding path program 1 times [2019-12-27 16:01:26,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:26,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403496808] [2019-12-27 16:01:26,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:01:26,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403496808] [2019-12-27 16:01:26,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:26,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:01:26,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1969534487] [2019-12-27 16:01:26,613 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:26,629 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:26,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 426 transitions. [2019-12-27 16:01:26,741 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:26,784 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:01:26,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:01:26,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:26,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:01:26,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:01:26,785 INFO L87 Difference]: Start difference. First operand 15351 states and 44414 transitions. Second operand 7 states. [2019-12-27 16:01:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:26,911 INFO L93 Difference]: Finished difference Result 14165 states and 41863 transitions. [2019-12-27 16:01:26,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:01:26,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 16:01:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:26,938 INFO L225 Difference]: With dead ends: 14165 [2019-12-27 16:01:26,938 INFO L226 Difference]: Without dead ends: 11454 [2019-12-27 16:01:26,939 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:01:27,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11454 states. [2019-12-27 16:01:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11454 to 11454. [2019-12-27 16:01:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11454 states. [2019-12-27 16:01:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11454 states to 11454 states and 35706 transitions. [2019-12-27 16:01:27,286 INFO L78 Accepts]: Start accepts. Automaton has 11454 states and 35706 transitions. Word has length 41 [2019-12-27 16:01:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:27,287 INFO L462 AbstractCegarLoop]: Abstraction has 11454 states and 35706 transitions. [2019-12-27 16:01:27,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:01:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 11454 states and 35706 transitions. [2019-12-27 16:01:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:01:27,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:27,307 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:01:27,307 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:01:27,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:27,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1814888115, now seen corresponding path program 1 times [2019-12-27 16:01:27,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:27,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755503914] [2019-12-27 16:01:27,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:27,406 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:27,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755503914] [2019-12-27 16:01:27,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:27,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:01:27,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [677369073] [2019-12-27 16:01:27,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:27,453 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:27,929 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 226 states and 425 transitions. [2019-12-27 16:01:27,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:28,136 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 16:01:28,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:01:28,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:28,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:01:28,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:01:28,137 INFO L87 Difference]: Start difference. First operand 11454 states and 35706 transitions. Second operand 13 states. [2019-12-27 16:01:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:29,750 INFO L93 Difference]: Finished difference Result 33211 states and 100032 transitions. [2019-12-27 16:01:29,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:01:29,751 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 16:01:29,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:29,784 INFO L225 Difference]: With dead ends: 33211 [2019-12-27 16:01:29,784 INFO L226 Difference]: Without dead ends: 23959 [2019-12-27 16:01:29,785 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:01:29,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23959 states. [2019-12-27 16:01:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23959 to 13157. [2019-12-27 16:01:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13157 states. [2019-12-27 16:01:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13157 states to 13157 states and 40670 transitions. [2019-12-27 16:01:30,065 INFO L78 Accepts]: Start accepts. Automaton has 13157 states and 40670 transitions. Word has length 65 [2019-12-27 16:01:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:30,065 INFO L462 AbstractCegarLoop]: Abstraction has 13157 states and 40670 transitions. [2019-12-27 16:01:30,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:01:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 13157 states and 40670 transitions. [2019-12-27 16:01:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:01:30,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:30,080 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:01:30,080 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:01:30,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1698408595, now seen corresponding path program 2 times [2019-12-27 16:01:30,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:30,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411038933] [2019-12-27 16:01:30,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:30,162 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:30,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411038933] [2019-12-27 16:01:30,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:30,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:01:30,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1986113973] [2019-12-27 16:01:30,163 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:30,184 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:30,396 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 262 states and 484 transitions. [2019-12-27 16:01:30,396 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:30,586 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 16:01:30,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:01:30,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:30,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:01:30,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:01:30,587 INFO L87 Difference]: Start difference. First operand 13157 states and 40670 transitions. Second operand 13 states. [2019-12-27 16:01:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:31,141 INFO L93 Difference]: Finished difference Result 25249 states and 76974 transitions. [2019-12-27 16:01:31,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:01:31,142 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 16:01:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:31,170 INFO L225 Difference]: With dead ends: 25249 [2019-12-27 16:01:31,170 INFO L226 Difference]: Without dead ends: 18141 [2019-12-27 16:01:31,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:01:31,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18141 states. [2019-12-27 16:01:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18141 to 15291. [2019-12-27 16:01:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15291 states. [2019-12-27 16:01:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15291 states to 15291 states and 46928 transitions. [2019-12-27 16:01:31,425 INFO L78 Accepts]: Start accepts. Automaton has 15291 states and 46928 transitions. Word has length 65 [2019-12-27 16:01:31,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:31,425 INFO L462 AbstractCegarLoop]: Abstraction has 15291 states and 46928 transitions. [2019-12-27 16:01:31,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:01:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 15291 states and 46928 transitions. [2019-12-27 16:01:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:01:31,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:31,441 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:01:31,441 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:01:31,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:31,442 INFO L82 PathProgramCache]: Analyzing trace with hash 441727413, now seen corresponding path program 3 times [2019-12-27 16:01:31,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:31,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667764056] [2019-12-27 16:01:31,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:31,748 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:31,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667764056] [2019-12-27 16:01:31,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:31,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:01:31,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1529989524] [2019-12-27 16:01:31,751 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:31,773 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:31,952 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 422 transitions. [2019-12-27 16:01:31,952 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:32,125 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 16:01:32,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:01:32,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:32,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:01:32,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:01:32,126 INFO L87 Difference]: Start difference. First operand 15291 states and 46928 transitions. Second operand 12 states. [2019-12-27 16:01:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:33,877 INFO L93 Difference]: Finished difference Result 44498 states and 135302 transitions. [2019-12-27 16:01:33,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 16:01:33,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 16:01:33,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:33,936 INFO L225 Difference]: With dead ends: 44498 [2019-12-27 16:01:33,936 INFO L226 Difference]: Without dead ends: 41609 [2019-12-27 16:01:33,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=369, Invalid=1271, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 16:01:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41609 states. [2019-12-27 16:01:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41609 to 15259. [2019-12-27 16:01:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15259 states. [2019-12-27 16:01:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15259 states to 15259 states and 46830 transitions. [2019-12-27 16:01:34,364 INFO L78 Accepts]: Start accepts. Automaton has 15259 states and 46830 transitions. Word has length 65 [2019-12-27 16:01:34,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:34,364 INFO L462 AbstractCegarLoop]: Abstraction has 15259 states and 46830 transitions. [2019-12-27 16:01:34,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:01:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 15259 states and 46830 transitions. [2019-12-27 16:01:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:01:34,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:34,381 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:01:34,381 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:01:34,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:34,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1717231753, now seen corresponding path program 4 times [2019-12-27 16:01:34,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:34,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952841327] [2019-12-27 16:01:34,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:34,443 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:34,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952841327] [2019-12-27 16:01:34,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:34,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:01:34,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1262330658] [2019-12-27 16:01:34,444 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:34,464 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:34,672 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 226 states and 403 transitions. [2019-12-27 16:01:34,672 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:34,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:01:34,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:01:34,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:34,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:01:34,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:01:34,675 INFO L87 Difference]: Start difference. First operand 15259 states and 46830 transitions. Second operand 3 states. [2019-12-27 16:01:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:34,766 INFO L93 Difference]: Finished difference Result 17249 states and 53014 transitions. [2019-12-27 16:01:34,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:01:34,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 16:01:34,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:34,789 INFO L225 Difference]: With dead ends: 17249 [2019-12-27 16:01:34,790 INFO L226 Difference]: Without dead ends: 17249 [2019-12-27 16:01:34,790 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:01:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17249 states. [2019-12-27 16:01:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17249 to 15116. [2019-12-27 16:01:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15116 states. [2019-12-27 16:01:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15116 states to 15116 states and 46735 transitions. [2019-12-27 16:01:35,253 INFO L78 Accepts]: Start accepts. Automaton has 15116 states and 46735 transitions. Word has length 65 [2019-12-27 16:01:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:35,253 INFO L462 AbstractCegarLoop]: Abstraction has 15116 states and 46735 transitions. [2019-12-27 16:01:35,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:01:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 15116 states and 46735 transitions. [2019-12-27 16:01:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:01:35,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:35,271 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:01:35,271 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:01:35,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:35,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1333392690, now seen corresponding path program 1 times [2019-12-27 16:01:35,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:35,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750451908] [2019-12-27 16:01:35,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:35,378 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:35,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750451908] [2019-12-27 16:01:35,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:35,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:01:35,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1598352124] [2019-12-27 16:01:35,380 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:35,405 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:35,665 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 409 transitions. [2019-12-27 16:01:35,666 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:36,010 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 16:01:36,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:01:36,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:36,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:01:36,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:01:36,012 INFO L87 Difference]: Start difference. First operand 15116 states and 46735 transitions. Second operand 14 states. [2019-12-27 16:01:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:40,193 INFO L93 Difference]: Finished difference Result 59666 states and 181956 transitions. [2019-12-27 16:01:40,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 16:01:40,194 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 16:01:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:40,259 INFO L225 Difference]: With dead ends: 59666 [2019-12-27 16:01:40,259 INFO L226 Difference]: Without dead ends: 45103 [2019-12-27 16:01:40,260 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:01:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45103 states. [2019-12-27 16:01:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45103 to 15537. [2019-12-27 16:01:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15537 states. [2019-12-27 16:01:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15537 states to 15537 states and 47623 transitions. [2019-12-27 16:01:40,736 INFO L78 Accepts]: Start accepts. Automaton has 15537 states and 47623 transitions. Word has length 66 [2019-12-27 16:01:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:40,736 INFO L462 AbstractCegarLoop]: Abstraction has 15537 states and 47623 transitions. [2019-12-27 16:01:40,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:01:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 15537 states and 47623 transitions. [2019-12-27 16:01:40,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:01:40,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:40,755 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:01:40,755 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:01:40,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:40,756 INFO L82 PathProgramCache]: Analyzing trace with hash 283101390, now seen corresponding path program 2 times [2019-12-27 16:01:40,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:40,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500145318] [2019-12-27 16:01:40,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:40,848 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:40,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500145318] [2019-12-27 16:01:40,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:40,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:01:40,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [182236547] [2019-12-27 16:01:40,849 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:40,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:41,361 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 406 transitions. [2019-12-27 16:01:41,361 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:41,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:01:41,517 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 16:01:41,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:01:41,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:41,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:01:41,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:01:41,518 INFO L87 Difference]: Start difference. First operand 15537 states and 47623 transitions. Second operand 10 states. [2019-12-27 16:01:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:44,606 INFO L93 Difference]: Finished difference Result 34707 states and 103817 transitions. [2019-12-27 16:01:44,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 16:01:44,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 16:01:44,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:44,653 INFO L225 Difference]: With dead ends: 34707 [2019-12-27 16:01:44,653 INFO L226 Difference]: Without dead ends: 34487 [2019-12-27 16:01:44,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:01:44,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34487 states. [2019-12-27 16:01:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34487 to 19559. [2019-12-27 16:01:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19559 states. [2019-12-27 16:01:45,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19559 states to 19559 states and 59689 transitions. [2019-12-27 16:01:45,052 INFO L78 Accepts]: Start accepts. Automaton has 19559 states and 59689 transitions. Word has length 66 [2019-12-27 16:01:45,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:45,052 INFO L462 AbstractCegarLoop]: Abstraction has 19559 states and 59689 transitions. [2019-12-27 16:01:45,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:01:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand 19559 states and 59689 transitions. [2019-12-27 16:01:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:01:45,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:45,072 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:01:45,072 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:01:45,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:45,072 INFO L82 PathProgramCache]: Analyzing trace with hash 346599794, now seen corresponding path program 1 times [2019-12-27 16:01:45,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:45,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652461525] [2019-12-27 16:01:45,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:45,135 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:45,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652461525] [2019-12-27 16:01:45,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:45,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:01:45,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1232083928] [2019-12-27 16:01:45,136 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:45,157 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:45,492 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 274 states and 526 transitions. [2019-12-27 16:01:45,493 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:45,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:01:45,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:01:45,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:45,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:01:45,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:01:45,500 INFO L87 Difference]: Start difference. First operand 19559 states and 59689 transitions. Second operand 4 states. [2019-12-27 16:01:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:45,613 INFO L93 Difference]: Finished difference Result 19397 states and 58975 transitions. [2019-12-27 16:01:45,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:01:45,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 16:01:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:45,639 INFO L225 Difference]: With dead ends: 19397 [2019-12-27 16:01:45,639 INFO L226 Difference]: Without dead ends: 19397 [2019-12-27 16:01:45,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 5 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:01:45,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19397 states. [2019-12-27 16:01:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19397 to 17376. [2019-12-27 16:01:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17376 states. [2019-12-27 16:01:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17376 states to 17376 states and 53042 transitions. [2019-12-27 16:01:46,177 INFO L78 Accepts]: Start accepts. Automaton has 17376 states and 53042 transitions. Word has length 66 [2019-12-27 16:01:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:46,177 INFO L462 AbstractCegarLoop]: Abstraction has 17376 states and 53042 transitions. [2019-12-27 16:01:46,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:01:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 17376 states and 53042 transitions. [2019-12-27 16:01:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:01:46,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:46,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:01:46,196 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:01:46,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:46,197 INFO L82 PathProgramCache]: Analyzing trace with hash 889984155, now seen corresponding path program 1 times [2019-12-27 16:01:46,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:46,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029849672] [2019-12-27 16:01:46,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:46,265 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:46,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029849672] [2019-12-27 16:01:46,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:46,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:01:46,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2130224256] [2019-12-27 16:01:46,266 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:46,286 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:46,485 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 406 transitions. [2019-12-27 16:01:46,485 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:46,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:01:46,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:01:46,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:46,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:01:46,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:01:46,528 INFO L87 Difference]: Start difference. First operand 17376 states and 53042 transitions. Second operand 6 states. [2019-12-27 16:01:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:01:46,815 INFO L93 Difference]: Finished difference Result 17153 states and 51513 transitions. [2019-12-27 16:01:46,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:01:46,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 16:01:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:01:46,838 INFO L225 Difference]: With dead ends: 17153 [2019-12-27 16:01:46,838 INFO L226 Difference]: Without dead ends: 17153 [2019-12-27 16:01:46,839 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:01:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17153 states. [2019-12-27 16:01:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17153 to 12581. [2019-12-27 16:01:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12581 states. [2019-12-27 16:01:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12581 states to 12581 states and 38175 transitions. [2019-12-27 16:01:47,061 INFO L78 Accepts]: Start accepts. Automaton has 12581 states and 38175 transitions. Word has length 66 [2019-12-27 16:01:47,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:01:47,061 INFO L462 AbstractCegarLoop]: Abstraction has 12581 states and 38175 transitions. [2019-12-27 16:01:47,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:01:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 12581 states and 38175 transitions. [2019-12-27 16:01:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:01:47,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:01:47,075 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:01:47,075 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:01:47,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:01:47,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2078724657, now seen corresponding path program 1 times [2019-12-27 16:01:47,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:01:47,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834775693] [2019-12-27 16:01:47,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:01:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:01:47,232 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:47,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834775693] [2019-12-27 16:01:47,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:01:47,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:01:47,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [96178045] [2019-12-27 16:01:47,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:01:47,254 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:01:47,612 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 250 states and 482 transitions. [2019-12-27 16:01:47,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:01:48,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:01:48,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:01:48,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:01:48,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:01:48,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:01:48,861 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 37 times. [2019-12-27 16:01:48,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 16:01:48,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:01:48,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 16:01:48,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:01:48,862 INFO L87 Difference]: Start difference. First operand 12581 states and 38175 transitions. Second operand 24 states. [2019-12-27 16:01:50,976 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 16:01:52,012 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 16:01:52,738 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-27 16:01:53,646 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:01:53,904 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 16:01:55,175 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 16:01:55,410 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-27 16:01:56,937 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:01:57,125 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 16:01:57,319 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2019-12-27 16:01:58,856 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-27 16:02:01,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:01,908 INFO L93 Difference]: Finished difference Result 43908 states and 130397 transitions. [2019-12-27 16:02:01,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-27 16:02:01,908 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-27 16:02:01,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:01,951 INFO L225 Difference]: With dead ends: 43908 [2019-12-27 16:02:01,951 INFO L226 Difference]: Without dead ends: 30218 [2019-12-27 16:02:01,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 11 SyntacticMatches, 11 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1842 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1269, Invalid=5537, Unknown=0, NotChecked=0, Total=6806 [2019-12-27 16:02:02,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30218 states. [2019-12-27 16:02:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30218 to 13767. [2019-12-27 16:02:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13767 states. [2019-12-27 16:02:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13767 states to 13767 states and 41453 transitions. [2019-12-27 16:02:02,287 INFO L78 Accepts]: Start accepts. Automaton has 13767 states and 41453 transitions. Word has length 67 [2019-12-27 16:02:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:02,287 INFO L462 AbstractCegarLoop]: Abstraction has 13767 states and 41453 transitions. [2019-12-27 16:02:02,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 16:02:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 13767 states and 41453 transitions. [2019-12-27 16:02:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:02:02,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:02,302 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:02,302 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:02:02,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:02,303 INFO L82 PathProgramCache]: Analyzing trace with hash 721495091, now seen corresponding path program 2 times [2019-12-27 16:02:02,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:02,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275321464] [2019-12-27 16:02:02,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:02,486 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:02,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275321464] [2019-12-27 16:02:02,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:02,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:02:02,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [460984806] [2019-12-27 16:02:02,487 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:02,503 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:03,122 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 230 states and 432 transitions. [2019-12-27 16:02:03,123 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:03,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:03,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:03,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:03,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:03,915 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 16:02:03,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 16:02:03,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:03,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 16:02:03,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-27 16:02:03,916 INFO L87 Difference]: Start difference. First operand 13767 states and 41453 transitions. Second operand 19 states. [2019-12-27 16:02:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:07,121 INFO L93 Difference]: Finished difference Result 24076 states and 71651 transitions. [2019-12-27 16:02:07,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 16:02:07,122 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 16:02:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:07,151 INFO L225 Difference]: With dead ends: 24076 [2019-12-27 16:02:07,151 INFO L226 Difference]: Without dead ends: 21671 [2019-12-27 16:02:07,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 9 SyntacticMatches, 11 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=409, Invalid=1943, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 16:02:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21671 states. [2019-12-27 16:02:07,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21671 to 17251. [2019-12-27 16:02:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17251 states. [2019-12-27 16:02:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17251 states to 17251 states and 51882 transitions. [2019-12-27 16:02:07,446 INFO L78 Accepts]: Start accepts. Automaton has 17251 states and 51882 transitions. Word has length 67 [2019-12-27 16:02:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:07,446 INFO L462 AbstractCegarLoop]: Abstraction has 17251 states and 51882 transitions. [2019-12-27 16:02:07,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 16:02:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 17251 states and 51882 transitions. [2019-12-27 16:02:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:02:07,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:07,465 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,465 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:02:07,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:07,465 INFO L82 PathProgramCache]: Analyzing trace with hash 957967249, now seen corresponding path program 3 times [2019-12-27 16:02:07,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:07,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530291248] [2019-12-27 16:02:07,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:07,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530291248] [2019-12-27 16:02:07,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:07,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:02:07,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [381694573] [2019-12-27 16:02:07,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:07,660 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:07,931 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 308 states and 625 transitions. [2019-12-27 16:02:07,931 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:08,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:08,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:08,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:08,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:08,576 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 16:02:08,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 16:02:08,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:08,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 16:02:08,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:02:08,577 INFO L87 Difference]: Start difference. First operand 17251 states and 51882 transitions. Second operand 20 states. [2019-12-27 16:02:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:12,488 INFO L93 Difference]: Finished difference Result 26392 states and 77769 transitions. [2019-12-27 16:02:12,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 16:02:12,489 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-27 16:02:12,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:12,519 INFO L225 Difference]: With dead ends: 26392 [2019-12-27 16:02:12,519 INFO L226 Difference]: Without dead ends: 22644 [2019-12-27 16:02:12,520 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:02:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22644 states. [2019-12-27 16:02:12,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22644 to 13655. [2019-12-27 16:02:12,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13655 states. [2019-12-27 16:02:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13655 states to 13655 states and 41105 transitions. [2019-12-27 16:02:12,790 INFO L78 Accepts]: Start accepts. Automaton has 13655 states and 41105 transitions. Word has length 67 [2019-12-27 16:02:12,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:12,790 INFO L462 AbstractCegarLoop]: Abstraction has 13655 states and 41105 transitions. [2019-12-27 16:02:12,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 16:02:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 13655 states and 41105 transitions. [2019-12-27 16:02:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:02:12,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:12,807 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:12,807 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:02:12,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:12,807 INFO L82 PathProgramCache]: Analyzing trace with hash 88464887, now seen corresponding path program 4 times [2019-12-27 16:02:12,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:12,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246735127] [2019-12-27 16:02:12,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:13,033 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:13,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246735127] [2019-12-27 16:02:13,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:13,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:02:13,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1955559509] [2019-12-27 16:02:13,035 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:13,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:13,377 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 406 transitions. [2019-12-27 16:02:13,378 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:13,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:13,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:13,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:14,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:14,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 16:02:14,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 16:02:14,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:14,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 16:02:14,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:02:14,163 INFO L87 Difference]: Start difference. First operand 13655 states and 41105 transitions. Second operand 20 states. [2019-12-27 16:02:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:17,889 INFO L93 Difference]: Finished difference Result 36170 states and 108379 transitions. [2019-12-27 16:02:17,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 16:02:17,890 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-27 16:02:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:17,933 INFO L225 Difference]: With dead ends: 36170 [2019-12-27 16:02:17,933 INFO L226 Difference]: Without dead ends: 31525 [2019-12-27 16:02:17,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 16 SyntacticMatches, 12 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=646, Invalid=3644, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 16:02:18,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31525 states. [2019-12-27 16:02:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31525 to 19061. [2019-12-27 16:02:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19061 states. [2019-12-27 16:02:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19061 states to 19061 states and 57661 transitions. [2019-12-27 16:02:18,652 INFO L78 Accepts]: Start accepts. Automaton has 19061 states and 57661 transitions. Word has length 67 [2019-12-27 16:02:18,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:18,652 INFO L462 AbstractCegarLoop]: Abstraction has 19061 states and 57661 transitions. [2019-12-27 16:02:18,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 16:02:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 19061 states and 57661 transitions. [2019-12-27 16:02:18,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:02:18,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:18,672 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:18,673 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:02:18,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:18,673 INFO L82 PathProgramCache]: Analyzing trace with hash 324937045, now seen corresponding path program 5 times [2019-12-27 16:02:18,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:18,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341928011] [2019-12-27 16:02:18,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:19,113 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,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341928011] [2019-12-27 16:02:19,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:19,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 16:02:19,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1019881639] [2019-12-27 16:02:19,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:19,123 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:19,382 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 599 transitions. [2019-12-27 16:02:19,382 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:20,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:20,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:02:20,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:02:20,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:02:20,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-12-27 16:02:21,146 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-12-27 16:02:21,211 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 55 times. [2019-12-27 16:02:21,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 16:02:21,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:21,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 16:02:21,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2019-12-27 16:02:21,213 INFO L87 Difference]: Start difference. First operand 19061 states and 57661 transitions. Second operand 31 states. [2019-12-27 16:02:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:36,835 INFO L93 Difference]: Finished difference Result 49330 states and 146250 transitions. [2019-12-27 16:02:36,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-12-27 16:02:36,836 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 67 [2019-12-27 16:02:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:36,881 INFO L225 Difference]: With dead ends: 49330 [2019-12-27 16:02:36,881 INFO L226 Difference]: Without dead ends: 32026 [2019-12-27 16:02:36,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 25 SyntacticMatches, 23 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4321 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1735, Invalid=12307, Unknown=0, NotChecked=0, Total=14042 [2019-12-27 16:02:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32026 states. [2019-12-27 16:02:37,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32026 to 17563. [2019-12-27 16:02:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17563 states. [2019-12-27 16:02:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17563 states to 17563 states and 52702 transitions. [2019-12-27 16:02:37,258 INFO L78 Accepts]: Start accepts. Automaton has 17563 states and 52702 transitions. Word has length 67 [2019-12-27 16:02:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:37,259 INFO L462 AbstractCegarLoop]: Abstraction has 17563 states and 52702 transitions. [2019-12-27 16:02:37,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 16:02:37,259 INFO L276 IsEmpty]: Start isEmpty. Operand 17563 states and 52702 transitions. [2019-12-27 16:02:37,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:02:37,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:37,280 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:37,281 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:02:37,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:37,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2144730909, now seen corresponding path program 6 times [2019-12-27 16:02:37,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:37,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030945353] [2019-12-27 16:02:37,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:37,452 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,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030945353] [2019-12-27 16:02:37,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:37,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:02:37,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [514651186] [2019-12-27 16:02:37,454 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:37,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:37,839 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 478 transitions. [2019-12-27 16:02:37,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:38,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:38,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:38,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:38,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 16:02:38,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 16:02:38,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:38,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 16:02:38,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-27 16:02:38,456 INFO L87 Difference]: Start difference. First operand 17563 states and 52702 transitions. Second operand 17 states. [2019-12-27 16:02:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:41,176 INFO L93 Difference]: Finished difference Result 22001 states and 64651 transitions. [2019-12-27 16:02:41,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 16:02:41,177 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 16:02:41,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:41,202 INFO L225 Difference]: With dead ends: 22001 [2019-12-27 16:02:41,202 INFO L226 Difference]: Without dead ends: 17557 [2019-12-27 16:02:41,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2019-12-27 16:02:41,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17557 states. [2019-12-27 16:02:41,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17557 to 15339. [2019-12-27 16:02:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15339 states. [2019-12-27 16:02:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15339 states to 15339 states and 45758 transitions. [2019-12-27 16:02:41,449 INFO L78 Accepts]: Start accepts. Automaton has 15339 states and 45758 transitions. Word has length 67 [2019-12-27 16:02:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:41,449 INFO L462 AbstractCegarLoop]: Abstraction has 15339 states and 45758 transitions. [2019-12-27 16:02:41,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 16:02:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 15339 states and 45758 transitions. [2019-12-27 16:02:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:02:41,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:41,466 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:41,466 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:02:41,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:41,466 INFO L82 PathProgramCache]: Analyzing trace with hash 690906387, now seen corresponding path program 7 times [2019-12-27 16:02:41,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:41,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173976580] [2019-12-27 16:02:41,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:41,623 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:41,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173976580] [2019-12-27 16:02:41,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:41,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:02:41,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [264307467] [2019-12-27 16:02:41,624 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:41,645 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:41,990 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 265 states and 510 transitions. [2019-12-27 16:02:41,990 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:42,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:42,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:42,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:42,440 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 35 times. [2019-12-27 16:02:42,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 16:02:42,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:42,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 16:02:42,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-27 16:02:42,441 INFO L87 Difference]: Start difference. First operand 15339 states and 45758 transitions. Second operand 17 states. [2019-12-27 16:02:45,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:45,009 INFO L93 Difference]: Finished difference Result 19716 states and 57644 transitions. [2019-12-27 16:02:45,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:02:45,010 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 16:02:45,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:45,033 INFO L225 Difference]: With dead ends: 19716 [2019-12-27 16:02:45,033 INFO L226 Difference]: Without dead ends: 17976 [2019-12-27 16:02:45,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 14 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2019-12-27 16:02:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17976 states. [2019-12-27 16:02:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17976 to 15318. [2019-12-27 16:02:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15318 states. [2019-12-27 16:02:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15318 states to 15318 states and 45687 transitions. [2019-12-27 16:02:45,274 INFO L78 Accepts]: Start accepts. Automaton has 15318 states and 45687 transitions. Word has length 67 [2019-12-27 16:02:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:45,274 INFO L462 AbstractCegarLoop]: Abstraction has 15318 states and 45687 transitions. [2019-12-27 16:02:45,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 16:02:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 15318 states and 45687 transitions. [2019-12-27 16:02:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:02:45,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:45,290 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:45,291 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:02:45,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:45,291 INFO L82 PathProgramCache]: Analyzing trace with hash -346859621, now seen corresponding path program 8 times [2019-12-27 16:02:45,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:45,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424796926] [2019-12-27 16:02:45,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:45,469 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:45,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424796926] [2019-12-27 16:02:45,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:45,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:02:45,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [818926246] [2019-12-27 16:02:45,470 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:45,487 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:45,844 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 259 states and 498 transitions. [2019-12-27 16:02:45,845 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:46,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:46,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:46,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:46,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:02:46,486 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 16:02:46,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 16:02:46,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:46,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 16:02:46,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:02:46,488 INFO L87 Difference]: Start difference. First operand 15318 states and 45687 transitions. Second operand 21 states. [2019-12-27 16:02:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:48,177 INFO L93 Difference]: Finished difference Result 17900 states and 52500 transitions. [2019-12-27 16:02:48,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 16:02:48,177 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 16:02:48,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:48,200 INFO L225 Difference]: With dead ends: 17900 [2019-12-27 16:02:48,200 INFO L226 Difference]: Without dead ends: 16167 [2019-12-27 16:02:48,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 15 SyntacticMatches, 15 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 16:02:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16167 states. [2019-12-27 16:02:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16167 to 13732. [2019-12-27 16:02:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13732 states. [2019-12-27 16:02:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13732 states to 13732 states and 41165 transitions. [2019-12-27 16:02:48,417 INFO L78 Accepts]: Start accepts. Automaton has 13732 states and 41165 transitions. Word has length 67 [2019-12-27 16:02:48,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:48,417 INFO L462 AbstractCegarLoop]: Abstraction has 13732 states and 41165 transitions. [2019-12-27 16:02:48,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 16:02:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 13732 states and 41165 transitions. [2019-12-27 16:02:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:02:48,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:48,431 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:48,432 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:02:48,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:48,432 INFO L82 PathProgramCache]: Analyzing trace with hash -494782975, now seen corresponding path program 9 times [2019-12-27 16:02:48,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:48,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383260123] [2019-12-27 16:02:48,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:02:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:02:48,557 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:02:48,557 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:02:48,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t391~0.base_29|) (= 0 v_~weak$$choice0~0_10) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t391~0.base_29| 4)) (= v_~a$r_buff1_thd0~0_132 0) (= 0 v_~a$w_buff0_used~0_689) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t391~0.base_29| 1)) (= 0 v_~a$w_buff1_used~0_376) (= v_~a$r_buff0_thd3~0_328 0) (= |v_#NULL.offset_6| 0) (= v_~y~0_79 0) (= 0 |v_ULTIMATE.start_main_~#t391~0.offset_22|) (= 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) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p0_EBX~0_92 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t391~0.base_29|)) (= 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|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t391~0.base_29| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t391~0.base_29|) |v_ULTIMATE.start_main_~#t391~0.offset_22| 0)) |v_#memory_int_21|) (= 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) (= 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{~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, ULTIMATE.start_main_~#t392~0.base=|v_ULTIMATE.start_main_~#t392~0.base_29|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, 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, ~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, ULTIMATE.start_main_~#t391~0.base=|v_ULTIMATE.start_main_~#t391~0.base_29|, ~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_~#t393~0.offset=|v_ULTIMATE.start_main_~#t393~0.offset_15|, 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, ULTIMATE.start_main_~#t392~0.offset=|v_ULTIMATE.start_main_~#t392~0.offset_22|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t393~0.base=|v_ULTIMATE.start_main_~#t393~0.base_17|, ~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|, ~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, ULTIMATE.start_main_~#t391~0.offset=|v_ULTIMATE.start_main_~#t391~0.offset_22|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t392~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t391~0.base, ~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_~#t393~0.offset, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t392~0.offset, #NULL.base, ULTIMATE.start_main_~#t393~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t391~0.offset] because there is no mapped edge [2019-12-27 16:02:48,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L837-1-->L839: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t392~0.base_12|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t392~0.base_12|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t392~0.base_12| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t392~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t392~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t392~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t392~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t392~0.base_12|) |v_ULTIMATE.start_main_~#t392~0.offset_10| 1)) |v_#memory_int_11|)) 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_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t392~0.base=|v_ULTIMATE.start_main_~#t392~0.base_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t392~0.offset=|v_ULTIMATE.start_main_~#t392~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t392~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t392~0.offset] because there is no mapped edge [2019-12-27 16:02:48,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L839-1-->L841: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t393~0.offset_11|) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t393~0.base_13| 1) |v_#valid_36|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t393~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t393~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t393~0.base_13|) |v_ULTIMATE.start_main_~#t393~0.offset_11| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t393~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t393~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t393~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#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_~#t393~0.offset=|v_ULTIMATE.start_main_~#t393~0.offset_11|, ULTIMATE.start_main_~#t393~0.base=|v_ULTIMATE.start_main_~#t393~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t393~0.offset, ULTIMATE.start_main_~#t393~0.base] because there is no mapped edge [2019-12-27 16:02:48,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L758: Formula: (and (= ~a$r_buff0_thd0~0_In-423132674 ~a$r_buff1_thd0~0_Out-423132674) (= ~y~0_In-423132674 ~__unbuffered_p0_EBX~0_Out-423132674) (= ~a$r_buff1_thd3~0_Out-423132674 ~a$r_buff0_thd3~0_In-423132674) (= ~a$r_buff0_thd1~0_In-423132674 ~a$r_buff1_thd1~0_Out-423132674) (= 1 ~a$r_buff0_thd1~0_Out-423132674) (= ~x~0_Out-423132674 ~__unbuffered_p0_EAX~0_Out-423132674) (= ~a$r_buff1_thd2~0_Out-423132674 ~a$r_buff0_thd2~0_In-423132674) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-423132674 0)) (= 1 ~x~0_Out-423132674)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-423132674, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-423132674, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-423132674, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-423132674, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-423132674, ~y~0=~y~0_In-423132674} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out-423132674, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-423132674, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-423132674, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-423132674, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-423132674, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-423132674, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-423132674, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-423132674, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-423132674, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-423132674, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-423132674, ~y~0=~y~0_In-423132674, ~x~0=~x~0_Out-423132674} 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:02:48,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-491581007 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-491581007 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out-491581007| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-491581007 |P0Thread1of1ForFork1_#t~ite5_Out-491581007|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-491581007, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-491581007} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-491581007|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-491581007, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-491581007} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:02:48,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-1481217843 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1481217843 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1481217843 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1481217843 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1481217843|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In-1481217843 |P0Thread1of1ForFork1_#t~ite6_Out-1481217843|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1481217843, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1481217843, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1481217843, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1481217843} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1481217843|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1481217843, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1481217843, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1481217843, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1481217843} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:02:48,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In764302974 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In764302974 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out764302974| ~a$w_buff1~0_In764302974)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out764302974| ~a~0_In764302974)))) InVars {~a~0=~a~0_In764302974, ~a$w_buff1~0=~a$w_buff1~0_In764302974, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In764302974, ~a$w_buff1_used~0=~a$w_buff1_used~0_In764302974} OutVars{~a~0=~a~0_In764302974, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out764302974|, ~a$w_buff1~0=~a$w_buff1~0_In764302974, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In764302974, ~a$w_buff1_used~0=~a$w_buff1_used~0_In764302974} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 16:02:48,569 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:02:48,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-607041446 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-607041446 256)))) (or (and (= ~a$r_buff0_thd1~0_In-607041446 ~a$r_buff0_thd1~0_Out-607041446) (or .cse0 .cse1)) (and (= 0 ~a$r_buff0_thd1~0_Out-607041446) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-607041446, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-607041446} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-607041446|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-607041446, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-607041446} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:02:48,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In91207700 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In91207700 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In91207700 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In91207700 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out91207700|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In91207700 |P0Thread1of1ForFork1_#t~ite8_Out91207700|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In91207700, ~a$w_buff0_used~0=~a$w_buff0_used~0_In91207700, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In91207700, ~a$w_buff1_used~0=~a$w_buff1_used~0_In91207700} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out91207700|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In91207700, ~a$w_buff0_used~0=~a$w_buff0_used~0_In91207700, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In91207700, ~a$w_buff1_used~0=~a$w_buff1_used~0_In91207700} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:02:48,570 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:02:48,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1835512072 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1835512072 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1835512072| ~a$w_buff0_used~0_In1835512072)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1835512072|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1835512072, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1835512072} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1835512072, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1835512072, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1835512072|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:02:48,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-653910738 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-653910738 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-653910738 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-653910738 256)) (and (= 0 (mod ~a$r_buff1_thd3~0_In-653910738 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite20_Out-653910738| |P2Thread1of1ForFork0_#t~ite21_Out-653910738|) (= ~a$w_buff0~0_In-653910738 |P2Thread1of1ForFork0_#t~ite20_Out-653910738|)) (and (= |P2Thread1of1ForFork0_#t~ite20_In-653910738| |P2Thread1of1ForFork0_#t~ite20_Out-653910738|) (= ~a$w_buff0~0_In-653910738 |P2Thread1of1ForFork0_#t~ite21_Out-653910738|) (not .cse0)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-653910738, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-653910738, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-653910738, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-653910738, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-653910738, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-653910738|, ~weak$$choice2~0=~weak$$choice2~0_In-653910738} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-653910738|, ~a$w_buff0~0=~a$w_buff0~0_In-653910738, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-653910738, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-653910738, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-653910738, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-653910738|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-653910738, ~weak$$choice2~0=~weak$$choice2~0_In-653910738} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 16:02:48,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1138177848 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In1138177848| |P2Thread1of1ForFork0_#t~ite23_Out1138177848|) (= |P2Thread1of1ForFork0_#t~ite24_Out1138177848| ~a$w_buff1~0_In1138177848) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite24_Out1138177848| |P2Thread1of1ForFork0_#t~ite23_Out1138177848|) (= |P2Thread1of1ForFork0_#t~ite23_Out1138177848| ~a$w_buff1~0_In1138177848) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1138177848 256) 0))) (or (= (mod ~a$w_buff0_used~0_In1138177848 256) 0) (and (= (mod ~a$r_buff1_thd3~0_In1138177848 256) 0) .cse1) (and (= (mod ~a$w_buff1_used~0_In1138177848 256) 0) .cse1)))))) InVars {~a$w_buff1~0=~a$w_buff1~0_In1138177848, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1138177848|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1138177848, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1138177848, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1138177848, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1138177848, ~weak$$choice2~0=~weak$$choice2~0_In1138177848} OutVars{~a$w_buff1~0=~a$w_buff1~0_In1138177848, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1138177848|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1138177848|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1138177848, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1138177848, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1138177848, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1138177848, ~weak$$choice2~0=~weak$$choice2~0_In1138177848} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 16:02:48,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1968870246 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out1968870246| |P2Thread1of1ForFork0_#t~ite26_Out1968870246|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1968870246 256)))) (or (= (mod ~a$w_buff0_used~0_In1968870246 256) 0) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1968870246 256))) (and (= 0 (mod ~a$r_buff1_thd3~0_In1968870246 256)) .cse1))) (= ~a$w_buff0_used~0_In1968870246 |P2Thread1of1ForFork0_#t~ite26_Out1968870246|)) (and (= |P2Thread1of1ForFork0_#t~ite26_In1968870246| |P2Thread1of1ForFork0_#t~ite26_Out1968870246|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out1968870246| ~a$w_buff0_used~0_In1968870246)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1968870246|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1968870246, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1968870246, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1968870246, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1968870246, ~weak$$choice2~0=~weak$$choice2~0_In1968870246} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1968870246|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1968870246|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1968870246, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1968870246, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1968870246, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1968870246, ~weak$$choice2~0=~weak$$choice2~0_In1968870246} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 16:02:48,574 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:02:48,576 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:02:48,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In587232743 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In587232743 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out587232743| ~a$w_buff1~0_In587232743)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out587232743| ~a~0_In587232743)))) InVars {~a~0=~a~0_In587232743, ~a$w_buff1~0=~a$w_buff1~0_In587232743, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In587232743, ~a$w_buff1_used~0=~a$w_buff1_used~0_In587232743} OutVars{~a~0=~a~0_In587232743, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out587232743|, ~a$w_buff1~0=~a$w_buff1~0_In587232743, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In587232743, ~a$w_buff1_used~0=~a$w_buff1_used~0_In587232743} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:02:48,577 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:02:48,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-555665656 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-555665656 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-555665656| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-555665656| ~a$w_buff0_used~0_In-555665656) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-555665656, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-555665656} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-555665656|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-555665656, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-555665656} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:02:48,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd3~0_In443878647 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In443878647 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In443878647 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In443878647 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out443878647|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In443878647 |P2Thread1of1ForFork0_#t~ite41_Out443878647|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In443878647, ~a$w_buff0_used~0=~a$w_buff0_used~0_In443878647, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In443878647, ~a$w_buff1_used~0=~a$w_buff1_used~0_In443878647} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In443878647, ~a$w_buff0_used~0=~a$w_buff0_used~0_In443878647, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In443878647, ~a$w_buff1_used~0=~a$w_buff1_used~0_In443878647, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out443878647|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:02:48,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-647582894 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-647582894 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-647582894| ~a$r_buff0_thd3~0_In-647582894)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-647582894| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-647582894, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-647582894} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-647582894, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-647582894, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-647582894|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:02:48,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-1537533854 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-1537533854 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-1537533854 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1537533854 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In-1537533854 |P2Thread1of1ForFork0_#t~ite43_Out-1537533854|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1537533854|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1537533854, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1537533854, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1537533854, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1537533854} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1537533854|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1537533854, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1537533854, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1537533854, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1537533854} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:02:48,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-815660940 256))) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-815660940 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-815660940 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-815660940 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-815660940 |P1Thread1of1ForFork2_#t~ite12_Out-815660940|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-815660940| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-815660940, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-815660940, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-815660940, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-815660940} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-815660940, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-815660940, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-815660940, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-815660940|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-815660940} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:02:48,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In2093877464 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2093877464 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out2093877464|)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In2093877464 |P1Thread1of1ForFork2_#t~ite13_Out2093877464|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2093877464, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2093877464} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2093877464, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2093877464, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out2093877464|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:02:48,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In1426899968 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In1426899968 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1426899968 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1426899968 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out1426899968| ~a$r_buff1_thd2~0_In1426899968)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out1426899968| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1426899968, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1426899968, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1426899968, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1426899968} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1426899968, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1426899968, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1426899968, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1426899968, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1426899968|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:02:48,584 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:02:48,584 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:02:48,584 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:02:48,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1451567527 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1451567527 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1451567527| ~a~0_In1451567527)) (and (= ~a$w_buff1~0_In1451567527 |ULTIMATE.start_main_#t~ite47_Out1451567527|) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In1451567527, ~a$w_buff1~0=~a$w_buff1~0_In1451567527, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1451567527, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1451567527} OutVars{~a~0=~a~0_In1451567527, ~a$w_buff1~0=~a$w_buff1~0_In1451567527, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1451567527|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1451567527, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1451567527} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:02:48,586 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:02:48,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In707898043 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In707898043 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out707898043| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out707898043| ~a$w_buff0_used~0_In707898043)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In707898043, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In707898043} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In707898043, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out707898043|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In707898043} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:02:48,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd0~0_In-2044505109 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-2044505109 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2044505109 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-2044505109 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-2044505109| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out-2044505109| ~a$w_buff1_used~0_In-2044505109)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2044505109, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2044505109, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2044505109, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2044505109} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2044505109|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2044505109, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2044505109, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2044505109, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2044505109} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:02:48,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In2120318635 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2120318635 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In2120318635 |ULTIMATE.start_main_#t~ite51_Out2120318635|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out2120318635|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2120318635, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2120318635} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2120318635|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2120318635, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2120318635} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:02:48,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In505472049 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In505472049 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In505472049 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In505472049 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In505472049 |ULTIMATE.start_main_#t~ite52_Out505472049|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite52_Out505472049|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In505472049, ~a$w_buff0_used~0=~a$w_buff0_used~0_In505472049, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In505472049, ~a$w_buff1_used~0=~a$w_buff1_used~0_In505472049} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out505472049|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In505472049, ~a$w_buff0_used~0=~a$w_buff0_used~0_In505472049, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In505472049, ~a$w_buff1_used~0=~a$w_buff1_used~0_In505472049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:02:48,589 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:02:48,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:02:48 BasicIcfg [2019-12-27 16:02:48,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:02:48,702 INFO L168 Benchmark]: Toolchain (without parser) took 168731.90 ms. Allocated memory was 139.5 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 101.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 16:02:48,703 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 16:02:48,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.74 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 157.2 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:02:48,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.36 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.6 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:02:48,704 INFO L168 Benchmark]: Boogie Preprocessor took 39.68 ms. Allocated memory is still 203.9 MB. Free memory was 154.6 MB in the beginning and 152.0 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:02:48,704 INFO L168 Benchmark]: RCFGBuilder took 968.39 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 101.2 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:02:48,704 INFO L168 Benchmark]: TraceAbstraction took 166831.81 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 16:02:48,707 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.17 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 819.74 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 157.2 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.36 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.68 ms. Allocated memory is still 203.9 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 968.39 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 101.2 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 166831.81 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.5 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(&t391, ((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(&t392, ((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(&t393, ((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: 166.4s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 84.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8986 SDtfs, 17429 SDslu, 45185 SDs, 0 SdLazy, 37066 SolverSat, 1202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1201 GetRequests, 263 SyntacticMatches, 164 SemanticMatches, 774 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11691 ImplicationChecksByTransitivity, 26.4s 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: 37.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 340371 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1692 NumberOfCodeBlocks, 1692 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1589 ConstructedInterpolants, 0 QuantifiedInterpolants, 325570 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...