/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/mix016_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:03:03,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:03:03,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:03:03,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:03:03,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:03:03,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:03:03,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:03:03,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:03:03,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:03:03,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:03:03,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:03:03,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:03:03,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:03:03,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:03:03,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:03:03,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:03:03,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:03:03,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:03:03,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:03:03,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:03:03,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:03:03,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:03:03,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:03:03,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:03:03,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:03:03,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:03:03,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:03:03,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:03:03,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:03:03,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:03:03,660 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:03:03,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:03:03,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:03:03,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:03:03,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:03:03,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:03:03,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:03:03,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:03:03,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:03:03,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:03:03,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:03:03,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:03:03,681 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:03:03,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:03:03,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:03:03,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:03:03,683 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:03:03,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:03:03,683 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:03:03,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:03:03,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:03:03,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:03:03,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:03:03,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:03:03,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:03:03,685 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:03:03,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:03:03,685 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:03:03,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:03:03,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:03:03,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:03:03,686 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:03:03,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:03:03,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:03:03,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:03:03,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:03:03,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:03:03,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:03:03,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:03:03,688 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:03:03,688 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:03:03,688 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:03:03,688 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:03:03,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:03:03,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:03:03,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:03:03,992 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:03:03,993 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:03:03,993 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_tso.oepc.i [2019-12-27 16:03:04,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240c70757/d1b9cc9e8abd4569852ffafecead6393/FLAG431bcc42b [2019-12-27 16:03:04,616 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:03:04,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_tso.oepc.i [2019-12-27 16:03:04,639 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240c70757/d1b9cc9e8abd4569852ffafecead6393/FLAG431bcc42b [2019-12-27 16:03:04,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240c70757/d1b9cc9e8abd4569852ffafecead6393 [2019-12-27 16:03:04,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:03:04,966 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:03:04,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:03:04,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:03:04,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:03:04,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:03:04" (1/1) ... [2019-12-27 16:03:04,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659be6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:04, skipping insertion in model container [2019-12-27 16:03:04,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:03:04" (1/1) ... [2019-12-27 16:03:04,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:03:05,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:03:05,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:03:05,658 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:03:05,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:03:05,832 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:03:05,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:05 WrapperNode [2019-12-27 16:03:05,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:03:05,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:03:05,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:03:05,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:03:05,843 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:03:05" (1/1) ... [2019-12-27 16:03:05,872 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:03:05" (1/1) ... [2019-12-27 16:03:05,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:03:05,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:03:05,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:03:05,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:03:05,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:05" (1/1) ... [2019-12-27 16:03:05,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:05" (1/1) ... [2019-12-27 16:03:05,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:05" (1/1) ... [2019-12-27 16:03:05,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:05" (1/1) ... [2019-12-27 16:03:05,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:05" (1/1) ... [2019-12-27 16:03:05,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:05" (1/1) ... [2019-12-27 16:03:05,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:05" (1/1) ... [2019-12-27 16:03:05,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:03:05,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:03:05,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:03:05,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:03:05,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:05" (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:03:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:03:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:03:06,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:03:06,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:03:06,006 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:03:06,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:03:06,006 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:03:06,007 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:03:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:03:06,007 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:03:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:03:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:03:06,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:03:06,009 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:03:06,807 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:03:06,807 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:03:06,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:03:06 BoogieIcfgContainer [2019-12-27 16:03:06,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:03:06,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:03:06,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:03:06,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:03:06,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:03:04" (1/3) ... [2019-12-27 16:03:06,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5737083c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:03:06, skipping insertion in model container [2019-12-27 16:03:06,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:03:05" (2/3) ... [2019-12-27 16:03:06,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5737083c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:03:06, skipping insertion in model container [2019-12-27 16:03:06,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:03:06" (3/3) ... [2019-12-27 16:03:06,818 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_tso.oepc.i [2019-12-27 16:03:06,829 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:03:06,829 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:03:06,836 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:03:06,837 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:03:06,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,879 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,879 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,879 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,880 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,880 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,933 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,933 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,979 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,981 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:06,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:07,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:07,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:07,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:07,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:07,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:07,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:03:07,020 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:03:07,042 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:03:07,042 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:03:07,042 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:03:07,042 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:03:07,042 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:03:07,043 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:03:07,043 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:03:07,043 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:03:07,063 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 16:03:07,065 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 16:03:07,199 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 16:03:07,200 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:03:07,217 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:03:07,240 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 16:03:07,294 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 16:03:07,294 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:03:07,302 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:03:07,322 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:03:07,323 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:03:11,570 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-12-27 16:03:12,438 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-27 16:03:12,550 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-27 16:03:12,789 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 16:03:12,917 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 16:03:12,946 INFO L206 etLargeBlockEncoding]: Checked pairs total: 89688 [2019-12-27 16:03:12,946 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 16:03:12,950 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 16:03:28,399 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106864 states. [2019-12-27 16:03:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 106864 states. [2019-12-27 16:03:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:03:28,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:28,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:03:28,408 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:03:28,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:28,413 INFO L82 PathProgramCache]: Analyzing trace with hash 921701, now seen corresponding path program 1 times [2019-12-27 16:03:28,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:28,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206617486] [2019-12-27 16:03:28,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:03:28,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206617486] [2019-12-27 16:03:28,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:28,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:03:28,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1889842349] [2019-12-27 16:03:28,641 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:28,645 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:28,661 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:03:28,661 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:28,665 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:03:28,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:03:28,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:28,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:03:28,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:03:28,685 INFO L87 Difference]: Start difference. First operand 106864 states. Second operand 3 states. [2019-12-27 16:03:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:30,837 INFO L93 Difference]: Finished difference Result 106034 states and 453004 transitions. [2019-12-27 16:03:30,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:03:30,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:03:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:31,534 INFO L225 Difference]: With dead ends: 106034 [2019-12-27 16:03:31,535 INFO L226 Difference]: Without dead ends: 99950 [2019-12-27 16:03:31,538 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:03:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99950 states. [2019-12-27 16:03:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99950 to 99950. [2019-12-27 16:03:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99950 states. [2019-12-27 16:03:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99950 states to 99950 states and 426445 transitions. [2019-12-27 16:03:42,791 INFO L78 Accepts]: Start accepts. Automaton has 99950 states and 426445 transitions. Word has length 3 [2019-12-27 16:03:42,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:42,792 INFO L462 AbstractCegarLoop]: Abstraction has 99950 states and 426445 transitions. [2019-12-27 16:03:42,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:03:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 99950 states and 426445 transitions. [2019-12-27 16:03:42,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:03:42,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:42,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:03:42,797 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:03:42,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:42,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1680645281, now seen corresponding path program 1 times [2019-12-27 16:03:42,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:42,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457167069] [2019-12-27 16:03:42,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:03:42,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457167069] [2019-12-27 16:03:42,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:42,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:03:42,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1683888553] [2019-12-27 16:03:42,929 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:42,930 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:42,933 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:03:42,933 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:42,934 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:03:42,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:03:42,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:42,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:03:42,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:03:42,936 INFO L87 Difference]: Start difference. First operand 99950 states and 426445 transitions. Second operand 4 states. [2019-12-27 16:03:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:48,194 INFO L93 Difference]: Finished difference Result 159384 states and 652094 transitions. [2019-12-27 16:03:48,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:03:48,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:03:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:48,734 INFO L225 Difference]: With dead ends: 159384 [2019-12-27 16:03:48,734 INFO L226 Difference]: Without dead ends: 159335 [2019-12-27 16:03:48,735 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:03:53,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159335 states. [2019-12-27 16:03:57,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159335 to 143879. [2019-12-27 16:03:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143879 states. [2019-12-27 16:03:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143879 states to 143879 states and 597281 transitions. [2019-12-27 16:03:58,249 INFO L78 Accepts]: Start accepts. Automaton has 143879 states and 597281 transitions. Word has length 11 [2019-12-27 16:03:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:58,250 INFO L462 AbstractCegarLoop]: Abstraction has 143879 states and 597281 transitions. [2019-12-27 16:03:58,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:03:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 143879 states and 597281 transitions. [2019-12-27 16:03:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:03:58,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:58,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:03:58,262 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:03:58,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:58,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1535099311, now seen corresponding path program 1 times [2019-12-27 16:03:58,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:58,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131526484] [2019-12-27 16:03:58,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:03:58,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131526484] [2019-12-27 16:03:58,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:58,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:03:58,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [776205268] [2019-12-27 16:03:58,393 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:58,394 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:58,396 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:03:58,396 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:58,396 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:03:58,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:03:58,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:58,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:03:58,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:03:58,397 INFO L87 Difference]: Start difference. First operand 143879 states and 597281 transitions. Second operand 4 states. [2019-12-27 16:04:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:04:05,301 INFO L93 Difference]: Finished difference Result 202801 states and 822791 transitions. [2019-12-27 16:04:05,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:04:05,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 16:04:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:04:06,024 INFO L225 Difference]: With dead ends: 202801 [2019-12-27 16:04:06,024 INFO L226 Difference]: Without dead ends: 202745 [2019-12-27 16:04:06,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:04:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202745 states. [2019-12-27 16:04:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202745 to 170256. [2019-12-27 16:04:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170256 states. [2019-12-27 16:04:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170256 states to 170256 states and 703222 transitions. [2019-12-27 16:04:15,890 INFO L78 Accepts]: Start accepts. Automaton has 170256 states and 703222 transitions. Word has length 13 [2019-12-27 16:04:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:04:15,892 INFO L462 AbstractCegarLoop]: Abstraction has 170256 states and 703222 transitions. [2019-12-27 16:04:15,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:04:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 170256 states and 703222 transitions. [2019-12-27 16:04:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:04:15,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:04:15,899 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:04:15,899 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:04:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:04:15,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1228744872, now seen corresponding path program 1 times [2019-12-27 16:04:15,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:04:15,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234613152] [2019-12-27 16:04:15,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:04:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:04:15,989 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:04:15,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234613152] [2019-12-27 16:04:15,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:04:15,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:04:15,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [85075654] [2019-12-27 16:04:15,990 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:04:15,992 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:04:15,995 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:04:15,995 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:04:15,995 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:04:15,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:04:15,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:04:15,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:04:15,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:04:15,996 INFO L87 Difference]: Start difference. First operand 170256 states and 703222 transitions. Second operand 4 states. [2019-12-27 16:04:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:04:22,733 INFO L93 Difference]: Finished difference Result 214467 states and 881100 transitions. [2019-12-27 16:04:22,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:04:22,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:04:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:04:23,452 INFO L225 Difference]: With dead ends: 214467 [2019-12-27 16:04:23,452 INFO L226 Difference]: Without dead ends: 214467 [2019-12-27 16:04:23,452 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:04:29,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214467 states. [2019-12-27 16:04:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214467 to 183252. [2019-12-27 16:04:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183252 states. [2019-12-27 16:04:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183252 states to 183252 states and 757164 transitions. [2019-12-27 16:04:38,980 INFO L78 Accepts]: Start accepts. Automaton has 183252 states and 757164 transitions. Word has length 16 [2019-12-27 16:04:38,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:04:38,980 INFO L462 AbstractCegarLoop]: Abstraction has 183252 states and 757164 transitions. [2019-12-27 16:04:38,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:04:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 183252 states and 757164 transitions. [2019-12-27 16:04:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:04:38,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:04:38,992 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:04:38,992 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:04:38,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:04:38,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1228651655, now seen corresponding path program 1 times [2019-12-27 16:04:38,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:04:38,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297767058] [2019-12-27 16:04:38,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:04:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:04:39,105 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:04:39,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297767058] [2019-12-27 16:04:39,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:04:39,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:04:39,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2010567897] [2019-12-27 16:04:39,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:04:39,108 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:04:39,111 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:04:39,111 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:04:39,111 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:04:39,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:04:39,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:04:39,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:04:39,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:04:39,113 INFO L87 Difference]: Start difference. First operand 183252 states and 757164 transitions. Second operand 4 states. [2019-12-27 16:04:47,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:04:47,722 INFO L93 Difference]: Finished difference Result 223450 states and 919042 transitions. [2019-12-27 16:04:47,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:04:47,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:04:47,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:04:48,418 INFO L225 Difference]: With dead ends: 223450 [2019-12-27 16:04:48,418 INFO L226 Difference]: Without dead ends: 223450 [2019-12-27 16:04:48,418 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:04:54,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223450 states. [2019-12-27 16:04:57,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223450 to 182620. [2019-12-27 16:04:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182620 states. [2019-12-27 16:04:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182620 states to 182620 states and 754482 transitions. [2019-12-27 16:04:58,188 INFO L78 Accepts]: Start accepts. Automaton has 182620 states and 754482 transitions. Word has length 16 [2019-12-27 16:04:58,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:04:58,188 INFO L462 AbstractCegarLoop]: Abstraction has 182620 states and 754482 transitions. [2019-12-27 16:04:58,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:04:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 182620 states and 754482 transitions. [2019-12-27 16:04:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 16:04:58,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:04:58,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:04:58,204 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:04:58,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:04:58,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1477868963, now seen corresponding path program 1 times [2019-12-27 16:04:58,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:04:58,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497958882] [2019-12-27 16:04:58,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:04:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:04:58,289 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:04:58,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497958882] [2019-12-27 16:04:58,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:04:58,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:04:58,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [994809892] [2019-12-27 16:04:58,291 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:04:58,296 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:04:58,300 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 28 transitions. [2019-12-27 16:04:58,300 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:04:58,303 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:04:58,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:04:58,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:04:58,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:04:58,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:04:58,304 INFO L87 Difference]: Start difference. First operand 182620 states and 754482 transitions. Second operand 3 states. [2019-12-27 16:05:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:04,629 INFO L93 Difference]: Finished difference Result 182256 states and 753055 transitions. [2019-12-27 16:05:04,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:05:04,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 16:05:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:05,159 INFO L225 Difference]: With dead ends: 182256 [2019-12-27 16:05:05,160 INFO L226 Difference]: Without dead ends: 182256 [2019-12-27 16:05:05,160 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:05:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182256 states. [2019-12-27 16:05:17,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182256 to 182256. [2019-12-27 16:05:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182256 states. [2019-12-27 16:05:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182256 states to 182256 states and 753055 transitions. [2019-12-27 16:05:18,609 INFO L78 Accepts]: Start accepts. Automaton has 182256 states and 753055 transitions. Word has length 18 [2019-12-27 16:05:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:18,609 INFO L462 AbstractCegarLoop]: Abstraction has 182256 states and 753055 transitions. [2019-12-27 16:05:18,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:05:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 182256 states and 753055 transitions. [2019-12-27 16:05:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 16:05:18,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:18,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:18,624 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:05:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1719186322, now seen corresponding path program 1 times [2019-12-27 16:05:18,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:18,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007985853] [2019-12-27 16:05:18,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:18,671 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:05:18,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007985853] [2019-12-27 16:05:18,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:18,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:05:18,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2010579877] [2019-12-27 16:05:18,672 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:18,675 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:18,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 38 transitions. [2019-12-27 16:05:18,678 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:18,682 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:05:18,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:05:18,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:18,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:05:18,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:05:18,683 INFO L87 Difference]: Start difference. First operand 182256 states and 753055 transitions. Second operand 3 states. [2019-12-27 16:05:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:20,627 INFO L93 Difference]: Finished difference Result 171684 states and 701366 transitions. [2019-12-27 16:05:20,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:05:20,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 16:05:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:21,094 INFO L225 Difference]: With dead ends: 171684 [2019-12-27 16:05:21,095 INFO L226 Difference]: Without dead ends: 171684 [2019-12-27 16:05:21,095 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:05:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171684 states. [2019-12-27 16:05:35,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171684 to 168552. [2019-12-27 16:05:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168552 states. [2019-12-27 16:05:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168552 states to 168552 states and 689782 transitions. [2019-12-27 16:05:35,936 INFO L78 Accepts]: Start accepts. Automaton has 168552 states and 689782 transitions. Word has length 19 [2019-12-27 16:05:35,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:35,936 INFO L462 AbstractCegarLoop]: Abstraction has 168552 states and 689782 transitions. [2019-12-27 16:05:35,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:05:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 168552 states and 689782 transitions. [2019-12-27 16:05:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 16:05:35,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:35,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:35,948 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:05:35,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:35,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2011667091, now seen corresponding path program 1 times [2019-12-27 16:05:35,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:35,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372311934] [2019-12-27 16:05:35,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:36,043 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:05:36,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372311934] [2019-12-27 16:05:36,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:36,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:36,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [283437976] [2019-12-27 16:05:36,044 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:36,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:36,051 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 55 transitions. [2019-12-27 16:05:36,051 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:36,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:05:36,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:36,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:36,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:36,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:36,087 INFO L87 Difference]: Start difference. First operand 168552 states and 689782 transitions. Second operand 5 states. [2019-12-27 16:05:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:36,479 INFO L93 Difference]: Finished difference Result 45362 states and 155053 transitions. [2019-12-27 16:05:36,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:05:36,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 16:05:36,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:36,545 INFO L225 Difference]: With dead ends: 45362 [2019-12-27 16:05:36,545 INFO L226 Difference]: Without dead ends: 35231 [2019-12-27 16:05:36,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 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:05:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35231 states. [2019-12-27 16:05:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35231 to 33284. [2019-12-27 16:05:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33284 states. [2019-12-27 16:05:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33284 states to 33284 states and 107536 transitions. [2019-12-27 16:05:38,336 INFO L78 Accepts]: Start accepts. Automaton has 33284 states and 107536 transitions. Word has length 19 [2019-12-27 16:05:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:38,336 INFO L462 AbstractCegarLoop]: Abstraction has 33284 states and 107536 transitions. [2019-12-27 16:05:38,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 33284 states and 107536 transitions. [2019-12-27 16:05:38,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:05:38,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:38,342 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:05:38,342 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:05:38,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:38,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1838789338, now seen corresponding path program 1 times [2019-12-27 16:05:38,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:38,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317351826] [2019-12-27 16:05:38,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:38,432 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:05:38,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317351826] [2019-12-27 16:05:38,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:38,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:38,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [941515961] [2019-12-27 16:05:38,433 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:38,437 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:38,444 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:05:38,445 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:38,445 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:38,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:38,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:38,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:38,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:38,446 INFO L87 Difference]: Start difference. First operand 33284 states and 107536 transitions. Second operand 5 states. [2019-12-27 16:05:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:39,097 INFO L93 Difference]: Finished difference Result 51113 states and 162480 transitions. [2019-12-27 16:05:39,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:05:39,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:05:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:39,188 INFO L225 Difference]: With dead ends: 51113 [2019-12-27 16:05:39,188 INFO L226 Difference]: Without dead ends: 51057 [2019-12-27 16:05:39,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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:05:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51057 states. [2019-12-27 16:05:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51057 to 34974. [2019-12-27 16:05:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34974 states. [2019-12-27 16:05:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34974 states to 34974 states and 113053 transitions. [2019-12-27 16:05:42,362 INFO L78 Accepts]: Start accepts. Automaton has 34974 states and 113053 transitions. Word has length 22 [2019-12-27 16:05:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:42,363 INFO L462 AbstractCegarLoop]: Abstraction has 34974 states and 113053 transitions. [2019-12-27 16:05:42,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 34974 states and 113053 transitions. [2019-12-27 16:05:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:05:42,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:42,369 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:05:42,369 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:05:42,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:42,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1838882555, now seen corresponding path program 1 times [2019-12-27 16:05:42,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:42,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212267793] [2019-12-27 16:05:42,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:42,453 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:05:42,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212267793] [2019-12-27 16:05:42,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:42,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:42,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1168292666] [2019-12-27 16:05:42,454 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:42,457 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:42,464 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:05:42,465 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:42,465 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:42,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:42,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:42,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:42,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:42,466 INFO L87 Difference]: Start difference. First operand 34974 states and 113053 transitions. Second operand 5 states. [2019-12-27 16:05:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:43,101 INFO L93 Difference]: Finished difference Result 52028 states and 165097 transitions. [2019-12-27 16:05:43,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:05:43,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:05:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:43,193 INFO L225 Difference]: With dead ends: 52028 [2019-12-27 16:05:43,193 INFO L226 Difference]: Without dead ends: 51972 [2019-12-27 16:05:43,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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:05:43,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51972 states. [2019-12-27 16:05:43,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51972 to 32731. [2019-12-27 16:05:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32731 states. [2019-12-27 16:05:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32731 states to 32731 states and 105533 transitions. [2019-12-27 16:05:43,914 INFO L78 Accepts]: Start accepts. Automaton has 32731 states and 105533 transitions. Word has length 22 [2019-12-27 16:05:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:43,914 INFO L462 AbstractCegarLoop]: Abstraction has 32731 states and 105533 transitions. [2019-12-27 16:05:43,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 32731 states and 105533 transitions. [2019-12-27 16:05:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:05:43,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:43,922 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:05:43,922 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:05:43,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:43,923 INFO L82 PathProgramCache]: Analyzing trace with hash 320469370, now seen corresponding path program 1 times [2019-12-27 16:05:43,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:43,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36035270] [2019-12-27 16:05:43,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:44,280 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 16:05:44,310 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:05:44,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36035270] [2019-12-27 16:05:44,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:44,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:05:44,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1017521980] [2019-12-27 16:05:44,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:44,315 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:44,326 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:05:44,326 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:44,376 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:05:44,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:44,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:44,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:44,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:44,378 INFO L87 Difference]: Start difference. First operand 32731 states and 105533 transitions. Second operand 6 states. [2019-12-27 16:05:44,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:44,527 INFO L93 Difference]: Finished difference Result 14600 states and 45354 transitions. [2019-12-27 16:05:44,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:05:44,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 16:05:44,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:44,556 INFO L225 Difference]: With dead ends: 14600 [2019-12-27 16:05:44,556 INFO L226 Difference]: Without dead ends: 12861 [2019-12-27 16:05:44,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:05:44,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-27 16:05:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12797. [2019-12-27 16:05:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12797 states. [2019-12-27 16:05:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12797 states to 12797 states and 39664 transitions. [2019-12-27 16:05:44,841 INFO L78 Accepts]: Start accepts. Automaton has 12797 states and 39664 transitions. Word has length 25 [2019-12-27 16:05:44,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:44,841 INFO L462 AbstractCegarLoop]: Abstraction has 12797 states and 39664 transitions. [2019-12-27 16:05:44,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:44,841 INFO L276 IsEmpty]: Start isEmpty. Operand 12797 states and 39664 transitions. [2019-12-27 16:05:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:05:44,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:44,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:44,852 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:05:44,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:44,852 INFO L82 PathProgramCache]: Analyzing trace with hash 270212897, now seen corresponding path program 1 times [2019-12-27 16:05:44,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:44,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494721632] [2019-12-27 16:05:44,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:44,887 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:05:44,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494721632] [2019-12-27 16:05:44,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:44,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:44,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1082142904] [2019-12-27 16:05:44,888 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:44,892 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:44,899 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:05:44,899 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:44,899 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:44,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:05:44,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:44,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:05:44,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:05:44,901 INFO L87 Difference]: Start difference. First operand 12797 states and 39664 transitions. Second operand 3 states. [2019-12-27 16:05:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:45,030 INFO L93 Difference]: Finished difference Result 19381 states and 59631 transitions. [2019-12-27 16:05:45,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:05:45,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:05:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:45,072 INFO L225 Difference]: With dead ends: 19381 [2019-12-27 16:05:45,072 INFO L226 Difference]: Without dead ends: 19381 [2019-12-27 16:05:45,073 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:05:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19381 states. [2019-12-27 16:05:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19381 to 15031. [2019-12-27 16:05:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15031 states. [2019-12-27 16:05:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15031 states to 15031 states and 46790 transitions. [2019-12-27 16:05:45,359 INFO L78 Accepts]: Start accepts. Automaton has 15031 states and 46790 transitions. Word has length 27 [2019-12-27 16:05:45,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:45,359 INFO L462 AbstractCegarLoop]: Abstraction has 15031 states and 46790 transitions. [2019-12-27 16:05:45,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:05:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 15031 states and 46790 transitions. [2019-12-27 16:05:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:05:45,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:45,372 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:05:45,372 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:05:45,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:45,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2064759266, now seen corresponding path program 1 times [2019-12-27 16:05:45,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:45,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901728008] [2019-12-27 16:05:45,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:45,410 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:05:45,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901728008] [2019-12-27 16:05:45,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:45,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:45,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [30545256] [2019-12-27 16:05:45,411 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:45,415 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:45,421 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:05:45,421 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:45,421 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:45,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:05:45,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:45,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:05:45,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:05:45,423 INFO L87 Difference]: Start difference. First operand 15031 states and 46790 transitions. Second operand 3 states. [2019-12-27 16:05:45,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:45,537 INFO L93 Difference]: Finished difference Result 19381 states and 58113 transitions. [2019-12-27 16:05:45,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:05:45,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:05:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:45,570 INFO L225 Difference]: With dead ends: 19381 [2019-12-27 16:05:45,571 INFO L226 Difference]: Without dead ends: 19381 [2019-12-27 16:05:45,571 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:05:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19381 states. [2019-12-27 16:05:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19381 to 15031. [2019-12-27 16:05:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15031 states. [2019-12-27 16:05:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15031 states to 15031 states and 45272 transitions. [2019-12-27 16:05:45,834 INFO L78 Accepts]: Start accepts. Automaton has 15031 states and 45272 transitions. Word has length 27 [2019-12-27 16:05:45,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:45,834 INFO L462 AbstractCegarLoop]: Abstraction has 15031 states and 45272 transitions. [2019-12-27 16:05:45,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:05:45,834 INFO L276 IsEmpty]: Start isEmpty. Operand 15031 states and 45272 transitions. [2019-12-27 16:05:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:05:45,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:45,846 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:05:45,846 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:05:45,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:45,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2010439622, now seen corresponding path program 1 times [2019-12-27 16:05:45,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:45,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298409217] [2019-12-27 16:05:45,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:45,924 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:05:45,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298409217] [2019-12-27 16:05:45,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:45,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:45,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1073524419] [2019-12-27 16:05:45,925 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:45,929 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:45,935 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:05:45,935 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:45,935 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:45,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:45,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:45,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:45,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:45,936 INFO L87 Difference]: Start difference. First operand 15031 states and 45272 transitions. Second operand 5 states. [2019-12-27 16:05:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:46,315 INFO L93 Difference]: Finished difference Result 18811 states and 55759 transitions. [2019-12-27 16:05:46,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:05:46,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 16:05:46,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:46,343 INFO L225 Difference]: With dead ends: 18811 [2019-12-27 16:05:46,343 INFO L226 Difference]: Without dead ends: 18656 [2019-12-27 16:05:46,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:05:46,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18656 states. [2019-12-27 16:05:46,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18656 to 16026. [2019-12-27 16:05:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16026 states. [2019-12-27 16:05:46,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16026 states to 16026 states and 48226 transitions. [2019-12-27 16:05:46,796 INFO L78 Accepts]: Start accepts. Automaton has 16026 states and 48226 transitions. Word has length 27 [2019-12-27 16:05:46,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:46,797 INFO L462 AbstractCegarLoop]: Abstraction has 16026 states and 48226 transitions. [2019-12-27 16:05:46,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 16026 states and 48226 transitions. [2019-12-27 16:05:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:05:46,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:46,809 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:05:46,810 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:05:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:46,810 INFO L82 PathProgramCache]: Analyzing trace with hash 773295241, now seen corresponding path program 1 times [2019-12-27 16:05:46,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:46,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644148575] [2019-12-27 16:05:46,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:46,926 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:05:46,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644148575] [2019-12-27 16:05:46,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:46,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:05:46,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [469718379] [2019-12-27 16:05:46,927 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:46,932 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:46,939 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:05:46,940 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:46,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:46,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:46,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:46,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:46,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:46,942 INFO L87 Difference]: Start difference. First operand 16026 states and 48226 transitions. Second operand 6 states. [2019-12-27 16:05:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:47,132 INFO L93 Difference]: Finished difference Result 20253 states and 60205 transitions. [2019-12-27 16:05:47,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:05:47,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 16:05:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:47,172 INFO L225 Difference]: With dead ends: 20253 [2019-12-27 16:05:47,173 INFO L226 Difference]: Without dead ends: 20253 [2019-12-27 16:05:47,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:05:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20253 states. [2019-12-27 16:05:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20253 to 16366. [2019-12-27 16:05:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16366 states. [2019-12-27 16:05:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16366 states to 16366 states and 49150 transitions. [2019-12-27 16:05:47,494 INFO L78 Accepts]: Start accepts. Automaton has 16366 states and 49150 transitions. Word has length 28 [2019-12-27 16:05:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:47,494 INFO L462 AbstractCegarLoop]: Abstraction has 16366 states and 49150 transitions. [2019-12-27 16:05:47,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 16366 states and 49150 transitions. [2019-12-27 16:05:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 16:05:47,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:47,507 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] [2019-12-27 16:05:47,507 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:05:47,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:47,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1192824778, now seen corresponding path program 1 times [2019-12-27 16:05:47,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:47,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455166355] [2019-12-27 16:05:47,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:47,614 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:05:47,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455166355] [2019-12-27 16:05:47,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:47,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:47,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [272192105] [2019-12-27 16:05:47,616 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:47,623 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:47,631 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 16:05:47,631 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:47,632 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:47,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:47,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:47,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:47,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:47,633 INFO L87 Difference]: Start difference. First operand 16366 states and 49150 transitions. Second operand 5 states. [2019-12-27 16:05:48,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:48,003 INFO L93 Difference]: Finished difference Result 19702 states and 58034 transitions. [2019-12-27 16:05:48,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:05:48,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 16:05:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:48,029 INFO L225 Difference]: With dead ends: 19702 [2019-12-27 16:05:48,029 INFO L226 Difference]: Without dead ends: 19540 [2019-12-27 16:05:48,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:05:48,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19540 states. [2019-12-27 16:05:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19540 to 16090. [2019-12-27 16:05:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16090 states. [2019-12-27 16:05:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16090 states to 16090 states and 48263 transitions. [2019-12-27 16:05:48,300 INFO L78 Accepts]: Start accepts. Automaton has 16090 states and 48263 transitions. Word has length 29 [2019-12-27 16:05:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:48,301 INFO L462 AbstractCegarLoop]: Abstraction has 16090 states and 48263 transitions. [2019-12-27 16:05:48,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 16090 states and 48263 transitions. [2019-12-27 16:05:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:05:48,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:48,315 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:05:48,315 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:05:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash -809721720, now seen corresponding path program 1 times [2019-12-27 16:05:48,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:48,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571005597] [2019-12-27 16:05:48,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:48,481 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:05:48,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571005597] [2019-12-27 16:05:48,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:48,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:05:48,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1336316259] [2019-12-27 16:05:48,482 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:48,488 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:48,505 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 16:05:48,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:48,506 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:48,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:48,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:48,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:48,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:48,508 INFO L87 Difference]: Start difference. First operand 16090 states and 48263 transitions. Second operand 6 states. [2019-12-27 16:05:49,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:49,188 INFO L93 Difference]: Finished difference Result 21301 states and 62588 transitions. [2019-12-27 16:05:49,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:05:49,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 16:05:49,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:49,233 INFO L225 Difference]: With dead ends: 21301 [2019-12-27 16:05:49,233 INFO L226 Difference]: Without dead ends: 20980 [2019-12-27 16:05:49,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:05:49,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20980 states. [2019-12-27 16:05:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20980 to 16150. [2019-12-27 16:05:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16150 states. [2019-12-27 16:05:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16150 states to 16150 states and 48426 transitions. [2019-12-27 16:05:49,676 INFO L78 Accepts]: Start accepts. Automaton has 16150 states and 48426 transitions. Word has length 33 [2019-12-27 16:05:49,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:49,676 INFO L462 AbstractCegarLoop]: Abstraction has 16150 states and 48426 transitions. [2019-12-27 16:05:49,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 16150 states and 48426 transitions. [2019-12-27 16:05:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 16:05:49,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:49,693 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] [2019-12-27 16:05:49,693 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:05:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1243510664, now seen corresponding path program 1 times [2019-12-27 16:05:49,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:49,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131604803] [2019-12-27 16:05:49,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:49,800 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:05:49,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131604803] [2019-12-27 16:05:49,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:49,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:05:49,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [534868254] [2019-12-27 16:05:49,801 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:49,808 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:49,823 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 63 transitions. [2019-12-27 16:05:49,823 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:49,823 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:49,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:49,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:49,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:49,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:49,824 INFO L87 Difference]: Start difference. First operand 16150 states and 48426 transitions. Second operand 6 states. [2019-12-27 16:05:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:50,510 INFO L93 Difference]: Finished difference Result 20328 states and 59884 transitions. [2019-12-27 16:05:50,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:05:50,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-27 16:05:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:50,540 INFO L225 Difference]: With dead ends: 20328 [2019-12-27 16:05:50,540 INFO L226 Difference]: Without dead ends: 19953 [2019-12-27 16:05:50,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:05:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19953 states. [2019-12-27 16:05:50,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19953 to 15004. [2019-12-27 16:05:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15004 states. [2019-12-27 16:05:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15004 states to 15004 states and 45066 transitions. [2019-12-27 16:05:50,804 INFO L78 Accepts]: Start accepts. Automaton has 15004 states and 45066 transitions. Word has length 35 [2019-12-27 16:05:50,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:50,804 INFO L462 AbstractCegarLoop]: Abstraction has 15004 states and 45066 transitions. [2019-12-27 16:05:50,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:50,804 INFO L276 IsEmpty]: Start isEmpty. Operand 15004 states and 45066 transitions. [2019-12-27 16:05:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:05:50,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:50,822 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:05:50,822 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:05:50,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:50,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1200265194, now seen corresponding path program 1 times [2019-12-27 16:05:50,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:50,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018222165] [2019-12-27 16:05:50,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:50,892 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:05:50,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018222165] [2019-12-27 16:05:50,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:50,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:05:50,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1012380892] [2019-12-27 16:05:50,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:50,902 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:50,948 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 189 transitions. [2019-12-27 16:05:50,948 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:50,994 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:05:50,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:50,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:50,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:50,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:50,995 INFO L87 Difference]: Start difference. First operand 15004 states and 45066 transitions. Second operand 6 states. [2019-12-27 16:05:51,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:51,778 INFO L93 Difference]: Finished difference Result 24603 states and 72694 transitions. [2019-12-27 16:05:51,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:05:51,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 16:05:51,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:51,816 INFO L225 Difference]: With dead ends: 24603 [2019-12-27 16:05:51,816 INFO L226 Difference]: Without dead ends: 24603 [2019-12-27 16:05:51,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:05:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24603 states. [2019-12-27 16:05:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24603 to 18105. [2019-12-27 16:05:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18105 states. [2019-12-27 16:05:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18105 states to 18105 states and 54450 transitions. [2019-12-27 16:05:52,240 INFO L78 Accepts]: Start accepts. Automaton has 18105 states and 54450 transitions. Word has length 41 [2019-12-27 16:05:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:52,240 INFO L462 AbstractCegarLoop]: Abstraction has 18105 states and 54450 transitions. [2019-12-27 16:05:52,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 18105 states and 54450 transitions. [2019-12-27 16:05:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:05:52,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:52,265 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:05:52,266 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:05:52,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:52,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1472692188, now seen corresponding path program 2 times [2019-12-27 16:05:52,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:52,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667524902] [2019-12-27 16:05:52,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:52,349 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:05:52,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667524902] [2019-12-27 16:05:52,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:52,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:05:52,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556240764] [2019-12-27 16:05:52,350 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:52,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:52,404 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 108 states and 187 transitions. [2019-12-27 16:05:52,405 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:52,416 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:05:52,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:52,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:52,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:52,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:52,418 INFO L87 Difference]: Start difference. First operand 18105 states and 54450 transitions. Second operand 6 states. [2019-12-27 16:05:52,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:52,544 INFO L93 Difference]: Finished difference Result 16993 states and 52027 transitions. [2019-12-27 16:05:52,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:05:52,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 16:05:52,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:52,568 INFO L225 Difference]: With dead ends: 16993 [2019-12-27 16:05:52,569 INFO L226 Difference]: Without dead ends: 16868 [2019-12-27 16:05:52,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:05:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16868 states. [2019-12-27 16:05:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16868 to 16868. [2019-12-27 16:05:52,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16868 states. [2019-12-27 16:05:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16868 states to 16868 states and 51763 transitions. [2019-12-27 16:05:52,826 INFO L78 Accepts]: Start accepts. Automaton has 16868 states and 51763 transitions. Word has length 41 [2019-12-27 16:05:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:52,827 INFO L462 AbstractCegarLoop]: Abstraction has 16868 states and 51763 transitions. [2019-12-27 16:05:52,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 16868 states and 51763 transitions. [2019-12-27 16:05:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:05:52,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:52,844 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:05:52,845 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:05:52,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:52,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1424537019, now seen corresponding path program 1 times [2019-12-27 16:05:52,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:52,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885730173] [2019-12-27 16:05:52,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:52,928 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:05:52,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885730173] [2019-12-27 16:05:52,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:52,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:05:52,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1541581202] [2019-12-27 16:05:52,929 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:52,950 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:53,142 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 425 transitions. [2019-12-27 16:05:53,142 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:53,158 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:05:53,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:05:53,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:53,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:05:53,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:05:53,160 INFO L87 Difference]: Start difference. First operand 16868 states and 51763 transitions. Second operand 7 states. [2019-12-27 16:05:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:53,625 INFO L93 Difference]: Finished difference Result 48420 states and 146954 transitions. [2019-12-27 16:05:53,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:05:53,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 16:05:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:53,815 INFO L225 Difference]: With dead ends: 48420 [2019-12-27 16:05:53,816 INFO L226 Difference]: Without dead ends: 35498 [2019-12-27 16:05:53,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:05:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35498 states. [2019-12-27 16:05:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35498 to 19884. [2019-12-27 16:05:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19884 states. [2019-12-27 16:05:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19884 states to 19884 states and 60700 transitions. [2019-12-27 16:05:54,224 INFO L78 Accepts]: Start accepts. Automaton has 19884 states and 60700 transitions. Word has length 65 [2019-12-27 16:05:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:54,224 INFO L462 AbstractCegarLoop]: Abstraction has 19884 states and 60700 transitions. [2019-12-27 16:05:54,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:05:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 19884 states and 60700 transitions. [2019-12-27 16:05:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:05:54,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:54,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:54,244 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:05:54,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:54,245 INFO L82 PathProgramCache]: Analyzing trace with hash 292633507, now seen corresponding path program 2 times [2019-12-27 16:05:54,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:54,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632924385] [2019-12-27 16:05:54,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:05:54,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632924385] [2019-12-27 16:05:54,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:54,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:05:54,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [595367402] [2019-12-27 16:05:54,357 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:54,383 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:54,808 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 293 states and 584 transitions. [2019-12-27 16:05:54,808 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:54,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 16:05:54,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:05:54,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:54,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:05:54,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:05:54,942 INFO L87 Difference]: Start difference. First operand 19884 states and 60700 transitions. Second operand 10 states. [2019-12-27 16:05:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:57,224 INFO L93 Difference]: Finished difference Result 117609 states and 351393 transitions. [2019-12-27 16:05:57,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 16:05:57,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 16:05:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:57,356 INFO L225 Difference]: With dead ends: 117609 [2019-12-27 16:05:57,356 INFO L226 Difference]: Without dead ends: 87600 [2019-12-27 16:05:57,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=481, Invalid=1775, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 16:05:57,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87600 states. [2019-12-27 16:05:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87600 to 24332. [2019-12-27 16:05:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24332 states. [2019-12-27 16:05:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24332 states to 24332 states and 74381 transitions. [2019-12-27 16:05:58,269 INFO L78 Accepts]: Start accepts. Automaton has 24332 states and 74381 transitions. Word has length 65 [2019-12-27 16:05:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:58,269 INFO L462 AbstractCegarLoop]: Abstraction has 24332 states and 74381 transitions. [2019-12-27 16:05:58,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:05:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 24332 states and 74381 transitions. [2019-12-27 16:05:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:05:58,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:58,298 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:05:58,299 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:05:58,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:58,299 INFO L82 PathProgramCache]: Analyzing trace with hash 937822065, now seen corresponding path program 3 times [2019-12-27 16:05:58,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:58,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616537919] [2019-12-27 16:05:58,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:58,384 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:05:58,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616537919] [2019-12-27 16:05:58,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:58,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:05:58,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [569198348] [2019-12-27 16:05:58,385 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:58,406 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:58,760 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 241 states and 459 transitions. [2019-12-27 16:05:58,760 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:58,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 16:05:58,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:05:58,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:58,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:05:58,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:05:58,923 INFO L87 Difference]: Start difference. First operand 24332 states and 74381 transitions. Second operand 11 states. [2019-12-27 16:06:01,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:06:01,232 INFO L93 Difference]: Finished difference Result 58097 states and 175480 transitions. [2019-12-27 16:06:01,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:06:01,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 16:06:01,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:06:01,310 INFO L225 Difference]: With dead ends: 58097 [2019-12-27 16:06:01,310 INFO L226 Difference]: Without dead ends: 49534 [2019-12-27 16:06:01,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:06:01,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49534 states. [2019-12-27 16:06:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49534 to 24668. [2019-12-27 16:06:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24668 states. [2019-12-27 16:06:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24668 states to 24668 states and 75363 transitions. [2019-12-27 16:06:01,896 INFO L78 Accepts]: Start accepts. Automaton has 24668 states and 75363 transitions. Word has length 65 [2019-12-27 16:06:01,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:06:01,896 INFO L462 AbstractCegarLoop]: Abstraction has 24668 states and 75363 transitions. [2019-12-27 16:06:01,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:06:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 24668 states and 75363 transitions. [2019-12-27 16:06:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:06:01,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:06:01,924 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:06:01,924 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:06:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:06:01,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1903736173, now seen corresponding path program 4 times [2019-12-27 16:06:01,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:06:01,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478176844] [2019-12-27 16:06:01,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:06:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:06:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:06:02,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478176844] [2019-12-27 16:06:02,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:06:02,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:06:02,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901395423] [2019-12-27 16:06:02,090 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:06:02,111 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:06:02,396 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 418 transitions. [2019-12-27 16:06:02,396 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:06:02,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:06:02,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:06:02,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:06:02,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:06:02,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:06:02,398 INFO L87 Difference]: Start difference. First operand 24668 states and 75363 transitions. Second operand 3 states. [2019-12-27 16:06:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:06:02,517 INFO L93 Difference]: Finished difference Result 27344 states and 83338 transitions. [2019-12-27 16:06:02,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:06:02,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 16:06:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:06:02,566 INFO L225 Difference]: With dead ends: 27344 [2019-12-27 16:06:02,566 INFO L226 Difference]: Without dead ends: 27344 [2019-12-27 16:06:02,566 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:06:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27344 states. [2019-12-27 16:06:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27344 to 23231. [2019-12-27 16:06:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23231 states. [2019-12-27 16:06:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23231 states to 23231 states and 71446 transitions. [2019-12-27 16:06:02,962 INFO L78 Accepts]: Start accepts. Automaton has 23231 states and 71446 transitions. Word has length 65 [2019-12-27 16:06:02,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:06:02,963 INFO L462 AbstractCegarLoop]: Abstraction has 23231 states and 71446 transitions. [2019-12-27 16:06:02,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:06:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 23231 states and 71446 transitions. [2019-12-27 16:06:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:06:02,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:06:02,990 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:06:02,990 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:06:02,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:06:02,991 INFO L82 PathProgramCache]: Analyzing trace with hash -243481851, now seen corresponding path program 1 times [2019-12-27 16:06:02,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:06:02,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894103508] [2019-12-27 16:06:02,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:06:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:06:03,082 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:06:03,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894103508] [2019-12-27 16:06:03,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:06:03,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:06:03,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1972039041] [2019-12-27 16:06:03,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:06:03,110 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:06:03,444 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 312 transitions. [2019-12-27 16:06:03,444 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:06:03,516 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 16:06:03,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:06:03,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:06:03,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:06:03,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:06:03,517 INFO L87 Difference]: Start difference. First operand 23231 states and 71446 transitions. Second operand 9 states. [2019-12-27 16:06:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:06:05,885 INFO L93 Difference]: Finished difference Result 39555 states and 118523 transitions. [2019-12-27 16:06:05,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 16:06:05,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 16:06:05,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:06:05,943 INFO L225 Difference]: With dead ends: 39555 [2019-12-27 16:06:05,944 INFO L226 Difference]: Without dead ends: 39555 [2019-12-27 16:06:05,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2019-12-27 16:06:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39555 states. [2019-12-27 16:06:06,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39555 to 23147. [2019-12-27 16:06:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23147 states. [2019-12-27 16:06:06,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23147 states to 23147 states and 71178 transitions. [2019-12-27 16:06:06,446 INFO L78 Accepts]: Start accepts. Automaton has 23147 states and 71178 transitions. Word has length 66 [2019-12-27 16:06:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:06:06,446 INFO L462 AbstractCegarLoop]: Abstraction has 23147 states and 71178 transitions. [2019-12-27 16:06:06,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:06:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 23147 states and 71178 transitions. [2019-12-27 16:06:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:06:06,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:06:06,473 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:06:06,473 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:06:06,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:06:06,473 INFO L82 PathProgramCache]: Analyzing trace with hash -44744943, now seen corresponding path program 2 times [2019-12-27 16:06:06,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:06:06,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269272843] [2019-12-27 16:06:06,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:06:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:06:06,566 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:06:06,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269272843] [2019-12-27 16:06:06,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:06:06,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:06:06,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365779365] [2019-12-27 16:06:06,567 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:06:06,595 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:06:06,818 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 307 transitions. [2019-12-27 16:06:06,819 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:06:06,831 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:06:06,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:06:06,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:06:06,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:06:06,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:06:06,833 INFO L87 Difference]: Start difference. First operand 23147 states and 71178 transitions. Second operand 7 states. [2019-12-27 16:06:06,980 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-27 16:06:08,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:06:08,150 INFO L93 Difference]: Finished difference Result 30616 states and 92074 transitions. [2019-12-27 16:06:08,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:06:08,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 16:06:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:06:08,195 INFO L225 Difference]: With dead ends: 30616 [2019-12-27 16:06:08,195 INFO L226 Difference]: Without dead ends: 30616 [2019-12-27 16:06:08,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-27 16:06:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30616 states. [2019-12-27 16:06:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30616 to 22749. [2019-12-27 16:06:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22749 states. [2019-12-27 16:06:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22749 states to 22749 states and 69979 transitions. [2019-12-27 16:06:08,605 INFO L78 Accepts]: Start accepts. Automaton has 22749 states and 69979 transitions. Word has length 66 [2019-12-27 16:06:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:06:08,605 INFO L462 AbstractCegarLoop]: Abstraction has 22749 states and 69979 transitions. [2019-12-27 16:06:08,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:06:08,606 INFO L276 IsEmpty]: Start isEmpty. Operand 22749 states and 69979 transitions. [2019-12-27 16:06:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:06:08,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:06:08,630 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:06:08,630 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:06:08,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:06:08,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1480053167, now seen corresponding path program 3 times [2019-12-27 16:06:08,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:06:08,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855071541] [2019-12-27 16:06:08,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:06:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:06:08,689 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:06:08,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855071541] [2019-12-27 16:06:08,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:06:08,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:06:08,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1101296607] [2019-12-27 16:06:08,690 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:06:08,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:06:08,890 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 294 transitions. [2019-12-27 16:06:08,890 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:06:08,891 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:06:08,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:06:08,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:06:08,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:06:08,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:06:08,892 INFO L87 Difference]: Start difference. First operand 22749 states and 69979 transitions. Second operand 3 states. [2019-12-27 16:06:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:06:08,951 INFO L93 Difference]: Finished difference Result 17337 states and 52737 transitions. [2019-12-27 16:06:08,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:06:08,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 16:06:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:06:08,973 INFO L225 Difference]: With dead ends: 17337 [2019-12-27 16:06:08,973 INFO L226 Difference]: Without dead ends: 17337 [2019-12-27 16:06:08,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:06:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17337 states. [2019-12-27 16:06:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17337 to 16045. [2019-12-27 16:06:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16045 states. [2019-12-27 16:06:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16045 states to 16045 states and 48799 transitions. [2019-12-27 16:06:09,218 INFO L78 Accepts]: Start accepts. Automaton has 16045 states and 48799 transitions. Word has length 66 [2019-12-27 16:06:09,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:06:09,218 INFO L462 AbstractCegarLoop]: Abstraction has 16045 states and 48799 transitions. [2019-12-27 16:06:09,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:06:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 16045 states and 48799 transitions. [2019-12-27 16:06:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:06:09,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:06:09,234 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:06:09,234 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:06:09,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:06:09,235 INFO L82 PathProgramCache]: Analyzing trace with hash 817808390, now seen corresponding path program 1 times [2019-12-27 16:06:09,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:06:09,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482278504] [2019-12-27 16:06:09,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:06:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:06:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:06:09,353 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:06:09,353 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:06:09,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= v_~z$r_buff1_thd1~0_114 0) (= 0 |v_ULTIMATE.start_main_~#t427~0.offset_30|) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~z$r_buff0_thd3~0_325) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t427~0.base_44| 4) |v_#length_23|) (= v_~z$mem_tmp~0_16 0) (= 0 v_~z$r_buff1_thd3~0_218) (= |v_#NULL.offset_3| 0) (= v_~z$read_delayed~0_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t427~0.base_44|)) (= (store .cse0 |v_ULTIMATE.start_main_~#t427~0.base_44| 1) |v_#valid_71|) (= 0 v_~weak$$choice0~0_15) (= v_~z$w_buff1~0_167 0) (= v_~z$r_buff0_thd0~0_136 0) (= v_~x~0_84 0) (= v_~z$r_buff0_thd1~0_185 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_46) (= 0 v_~weak$$choice2~0_93) (= 0 v_~__unbuffered_p1_EAX~0_60) (= v_~z$w_buff0~0_229 0) (= 0 v_~__unbuffered_p0_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_63) (= v_~z$r_buff0_thd2~0_132 0) (= v_~z~0_167 0) (= v_~main$tmp_guard0~0_44 0) (= v_~y~0_39 0) (= v_~z$w_buff1_used~0_386 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t427~0.base_44|) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~z$r_buff1_thd0~0_148 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t427~0.base_44| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t427~0.base_44|) |v_ULTIMATE.start_main_~#t427~0.offset_30| 0)) |v_#memory_int_21|) (= 0 |v_#NULL.base_3|) (= v_~z$w_buff0_used~0_680 0) (= v_~z$r_buff1_thd2~0_108 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_108, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_86|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_44|, ULTIMATE.start_main_~#t428~0.offset=|v_ULTIMATE.start_main_~#t428~0.offset_30|, ULTIMATE.start_main_~#t429~0.base=|v_ULTIMATE.start_main_~#t429~0.base_24|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_140|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_82|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_136, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_95, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_~#t427~0.base=|v_ULTIMATE.start_main_~#t427~0.base_44|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_11|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_114, ULTIMATE.start_main_~#t427~0.offset=|v_ULTIMATE.start_main_~#t427~0.offset_30|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~x~0=v_~x~0_84, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_103|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_42|, ULTIMATE.start_main_~#t429~0.offset=|v_ULTIMATE.start_main_~#t429~0.offset_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_148, ULTIMATE.start_main_~#t428~0.base=|v_ULTIMATE.start_main_~#t428~0.base_44|, ~y~0=v_~y~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_132, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_680, ~z$w_buff0~0=v_~z$w_buff0~0_229, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_218, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_93, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_185} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t428~0.offset, ULTIMATE.start_main_~#t429~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t427~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t427~0.offset, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t429~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t428~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:06:09,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L748: Formula: (and (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1170985415)) (= ~z$r_buff1_thd3~0_Out1170985415 ~z$r_buff0_thd3~0_In1170985415) (= ~z$r_buff1_thd2~0_Out1170985415 ~z$r_buff0_thd2~0_In1170985415) (= ~__unbuffered_p0_EAX~0_Out1170985415 ~x~0_In1170985415) (= ~z$r_buff0_thd1~0_Out1170985415 1) (= ~z$r_buff0_thd1~0_In1170985415 ~z$r_buff1_thd1~0_Out1170985415) (= ~z$r_buff1_thd0~0_Out1170985415 ~z$r_buff0_thd0~0_In1170985415)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1170985415, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1170985415, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1170985415, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1170985415, ~x~0=~x~0_In1170985415, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1170985415} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1170985415, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1170985415, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1170985415, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1170985415, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1170985415, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1170985415, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1170985415, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1170985415, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1170985415, ~x~0=~x~0_In1170985415, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1170985415} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:06:09,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L827-1-->L829: Formula: (and (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t428~0.base_13|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t428~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t428~0.base_13|) |v_ULTIMATE.start_main_~#t428~0.offset_11| 1)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t428~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t428~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t428~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t428~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t428~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t428~0.offset=|v_ULTIMATE.start_main_~#t428~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t428~0.base=|v_ULTIMATE.start_main_~#t428~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t428~0.offset, #length, ULTIMATE.start_main_~#t428~0.base] because there is no mapped edge [2019-12-27 16:06:09,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-2-->L768-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out1867879563| |P1Thread1of1ForFork2_#t~ite10_Out1867879563|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1867879563 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In1867879563 256) 0))) (or (and .cse0 (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1867879563| ~z$w_buff1~0_In1867879563) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out1867879563| ~z~0_In1867879563)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1867879563, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1867879563, ~z$w_buff1~0=~z$w_buff1~0_In1867879563, ~z~0=~z~0_In1867879563} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1867879563|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1867879563, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1867879563|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1867879563, ~z$w_buff1~0=~z$w_buff1~0_In1867879563, ~z~0=~z~0_In1867879563} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 16:06:09,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In872033522 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In872033522 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In872033522 |P1Thread1of1ForFork2_#t~ite11_Out872033522|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out872033522|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In872033522, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In872033522} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In872033522, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out872033522|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In872033522} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:06:09,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In319038911 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In319038911 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In319038911 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In319038911 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In319038911 |P1Thread1of1ForFork2_#t~ite12_Out319038911|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out319038911|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In319038911, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In319038911, ~z$w_buff1_used~0=~z$w_buff1_used~0_In319038911, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In319038911} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In319038911, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In319038911, ~z$w_buff1_used~0=~z$w_buff1_used~0_In319038911, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out319038911|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In319038911} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:06:09,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L829-1-->L831: Formula: (and (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t429~0.base_10| 1) |v_#valid_32|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t429~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t429~0.base_10|) (= |v_ULTIMATE.start_main_~#t429~0.offset_9| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t429~0.base_10| 4) |v_#length_13|) (not (= |v_ULTIMATE.start_main_~#t429~0.base_10| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t429~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t429~0.base_10|) |v_ULTIMATE.start_main_~#t429~0.offset_9| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t429~0.offset=|v_ULTIMATE.start_main_~#t429~0.offset_9|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t429~0.base=|v_ULTIMATE.start_main_~#t429~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t429~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t429~0.base] because there is no mapped edge [2019-12-27 16:06:09,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L793-->L793-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In597229560 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out597229560| ~z$w_buff0~0_In597229560) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In597229560| |P2Thread1of1ForFork0_#t~ite20_Out597229560|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out597229560| ~z$w_buff0~0_In597229560) (= |P2Thread1of1ForFork0_#t~ite21_Out597229560| |P2Thread1of1ForFork0_#t~ite20_Out597229560|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In597229560 256) 0))) (or (= (mod ~z$w_buff0_used~0_In597229560 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In597229560 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In597229560 256) 0))))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In597229560, ~z$w_buff0_used~0=~z$w_buff0_used~0_In597229560, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In597229560, ~z$w_buff1_used~0=~z$w_buff1_used~0_In597229560, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In597229560, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In597229560|, ~weak$$choice2~0=~weak$$choice2~0_In597229560} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out597229560|, ~z$w_buff0~0=~z$w_buff0~0_In597229560, ~z$w_buff0_used~0=~z$w_buff0_used~0_In597229560, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In597229560, ~z$w_buff1_used~0=~z$w_buff1_used~0_In597229560, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In597229560, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out597229560|, ~weak$$choice2~0=~weak$$choice2~0_In597229560} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 16:06:09,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L794-->L794-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1521258172 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1521258172 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1521258172 256)) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1521258172 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In1521258172 256)) .cse0))) .cse1 (= ~z$w_buff1~0_In1521258172 |P2Thread1of1ForFork0_#t~ite23_Out1521258172|) (= |P2Thread1of1ForFork0_#t~ite23_Out1521258172| |P2Thread1of1ForFork0_#t~ite24_Out1521258172|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite23_In1521258172| |P2Thread1of1ForFork0_#t~ite23_Out1521258172|) (= ~z$w_buff1~0_In1521258172 |P2Thread1of1ForFork0_#t~ite24_Out1521258172|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1521258172, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1521258172, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1521258172|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1521258172, ~z$w_buff1~0=~z$w_buff1~0_In1521258172, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1521258172, ~weak$$choice2~0=~weak$$choice2~0_In1521258172} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1521258172, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1521258172|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1521258172, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1521258172|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1521258172, ~z$w_buff1~0=~z$w_buff1~0_In1521258172, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1521258172, ~weak$$choice2~0=~weak$$choice2~0_In1521258172} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 16:06:09,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L797-->L798: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_160 v_~z$r_buff0_thd3~0_161)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_161, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_8|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_160, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 16:06:09,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L800-->L804: Formula: (and (= v_~z~0_54 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:06:09,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L804-2-->L804-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-1947390120 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1947390120 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1947390120| ~z$w_buff1~0_In-1947390120) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1947390120| ~z~0_In-1947390120) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1947390120, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1947390120, ~z$w_buff1~0=~z$w_buff1~0_In-1947390120, ~z~0=~z~0_In-1947390120} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1947390120|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1947390120, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1947390120, ~z$w_buff1~0=~z$w_buff1~0_In-1947390120, ~z~0=~z~0_In-1947390120} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:06:09,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L804-4-->L805: Formula: (= v_~z~0_30 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|, ~z~0=v_~z~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 16:06:09,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-449441455 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-449441455 256)))) (or (and (= ~z$w_buff0_used~0_In-449441455 |P2Thread1of1ForFork0_#t~ite40_Out-449441455|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-449441455|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-449441455, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-449441455} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-449441455, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-449441455|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-449441455} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:06:09,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In55458481 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In55458481 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out55458481| 0)) (and (= ~z$r_buff0_thd2~0_In55458481 |P1Thread1of1ForFork2_#t~ite13_Out55458481|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In55458481, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In55458481} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In55458481, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out55458481|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In55458481} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:06:09,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In728872103 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In728872103 256) 0))) (or (and (= ~z$w_buff0_used~0_In728872103 |P0Thread1of1ForFork1_#t~ite5_Out728872103|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out728872103|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In728872103, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In728872103} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out728872103|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In728872103, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In728872103} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:06:09,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1827756332 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1827756332 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1827756332 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1827756332 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out1827756332| ~z$w_buff1_used~0_In1827756332)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite6_Out1827756332| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1827756332, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1827756332, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1827756332, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1827756332} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1827756332, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1827756332|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1827756332, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1827756332, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1827756332} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:06:09,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1365166295 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1365166295 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out1365166295) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In1365166295 ~z$r_buff0_thd1~0_Out1365166295) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1365166295, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1365166295} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1365166295, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1365166295|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1365166295} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:06:09,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In602132045 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In602132045 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In602132045 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In602132045 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out602132045| ~z$r_buff1_thd1~0_In602132045)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out602132045|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In602132045, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In602132045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In602132045, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In602132045} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out602132045|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In602132045, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In602132045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In602132045, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In602132045} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:06:09,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L752-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_77 |v_P0Thread1of1ForFork1_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_23|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_77, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:06:09,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L806-->L806-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In545008567 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In545008567 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In545008567 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In545008567 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out545008567| 0)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out545008567| ~z$w_buff1_used~0_In545008567) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In545008567, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In545008567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In545008567, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In545008567} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In545008567, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In545008567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In545008567, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In545008567, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out545008567|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:06:09,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1064998912 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1064998912 256)))) (or (and (= ~z$r_buff0_thd3~0_In1064998912 |P2Thread1of1ForFork0_#t~ite42_Out1064998912|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1064998912|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1064998912, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1064998912} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1064998912, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1064998912, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1064998912|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:06:09,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1416064928 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1416064928 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1416064928 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1416064928 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1416064928|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-1416064928 |P2Thread1of1ForFork0_#t~ite43_Out-1416064928|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1416064928, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1416064928, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1416064928, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1416064928} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1416064928|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1416064928, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1416064928, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1416064928, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1416064928} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:06:09,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L808-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= v_~z$r_buff1_thd3~0_131 |v_P2Thread1of1ForFork0_#t~ite43_26|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:06:09,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L772-->L772-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In338560648 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In338560648 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In338560648 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In338560648 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In338560648 |P1Thread1of1ForFork2_#t~ite14_Out338560648|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite14_Out338560648| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In338560648, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In338560648, ~z$w_buff1_used~0=~z$w_buff1_used~0_In338560648, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In338560648} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In338560648, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In338560648, ~z$w_buff1_used~0=~z$w_buff1_used~0_In338560648, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out338560648|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In338560648} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:06:09,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L772-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P1Thread1of1ForFork2_#t~ite14_26| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_26|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_25|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:06:09,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L835-->L837-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_51 256)) (= 0 (mod v_~z$w_buff0_used~0_293 256))) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 16:06:09,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L837-2-->L837-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1488449443 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1488449443 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-1488449443 |ULTIMATE.start_main_#t~ite47_Out-1488449443|)) (and (not .cse0) (= ~z$w_buff1~0_In-1488449443 |ULTIMATE.start_main_#t~ite47_Out-1488449443|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1488449443, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1488449443, ~z$w_buff1~0=~z$w_buff1~0_In-1488449443, ~z~0=~z~0_In-1488449443} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1488449443, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1488449443|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1488449443, ~z$w_buff1~0=~z$w_buff1~0_In-1488449443, ~z~0=~z~0_In-1488449443} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:06:09,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L837-4-->L838: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_14|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 16:06:09,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1032094316 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1032094316 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1032094316|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1032094316 |ULTIMATE.start_main_#t~ite49_Out-1032094316|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1032094316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1032094316} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1032094316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1032094316, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1032094316|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:06:09,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L839-->L839-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1149405393 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1149405393 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1149405393 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1149405393 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1149405393| 0)) (and (= |ULTIMATE.start_main_#t~ite50_Out1149405393| ~z$w_buff1_used~0_In1149405393) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1149405393, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1149405393, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1149405393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1149405393} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1149405393|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1149405393, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1149405393, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1149405393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1149405393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:06:09,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1346436645 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1346436645 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1346436645|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1346436645 |ULTIMATE.start_main_#t~ite51_Out1346436645|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1346436645, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1346436645} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1346436645, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1346436645|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1346436645} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:06:09,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2024846859 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-2024846859 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-2024846859 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2024846859 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-2024846859| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite52_Out-2024846859| ~z$r_buff1_thd0~0_In-2024846859) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2024846859, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2024846859, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2024846859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2024846859} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2024846859|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2024846859, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2024846859, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2024846859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2024846859} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:06:09,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L841-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p0_EAX~0_72) (= v_~z$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_~__unbuffered_p2_EBX~0_32 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~main$tmp_guard1~0_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:06:09,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:06:09 BasicIcfg [2019-12-27 16:06:09,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:06:09,542 INFO L168 Benchmark]: Toolchain (without parser) took 184577.14 ms. Allocated memory was 145.2 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 101.2 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 16:06:09,543 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 16:06:09,543 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.84 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.8 MB in the beginning and 156.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:06:09,544 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.95 ms. Allocated memory is still 202.4 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:06:09,546 INFO L168 Benchmark]: Boogie Preprocessor took 40.57 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:06:09,547 INFO L168 Benchmark]: RCFGBuilder took 862.77 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 100.2 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:06:09,547 INFO L168 Benchmark]: TraceAbstraction took 182730.85 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.2 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 16:06:09,553 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 866.84 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.8 MB in the beginning and 156.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.95 ms. Allocated memory is still 202.4 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.57 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 862.77 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 100.2 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 182730.85 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.2 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 7082 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 89688 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t427, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L829] FCALL, FORK 0 pthread_create(&t428, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 x = 1 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L769] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L831] FCALL, FORK 0 pthread_create(&t429, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 [L785] 3 __unbuffered_p2_EAX = y [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L771] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L806] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L807] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 182.3s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 57.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5569 SDtfs, 6944 SDslu, 13737 SDs, 0 SdLazy, 8794 SolverSat, 351 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 142 SyntacticMatches, 43 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183252occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 96.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 328829 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 997 NumberOfCodeBlocks, 997 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 903 ConstructedInterpolants, 0 QuantifiedInterpolants, 133359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...