/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/mix006_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:40:42,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:40:42,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:40:42,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:40:42,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:40:42,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:40:42,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:40:42,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:40:42,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:40:42,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:40:42,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:40:42,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:40:42,606 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:40:42,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:40:42,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:40:42,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:40:42,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:40:42,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:40:42,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:40:42,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:40:42,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:40:42,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:40:42,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:40:42,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:40:42,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:40:42,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:40:42,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:40:42,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:40:42,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:40:42,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:40:42,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:40:42,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:40:42,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:40:42,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:40:42,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:40:42,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:40:42,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:40:42,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:40:42,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:40:42,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:40:42,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:40:42,641 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:40:42,654 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:40:42,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:40:42,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:40:42,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:40:42,656 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:40:42,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:40:42,657 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:40:42,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:40:42,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:40:42,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:40:42,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:40:42,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:40:42,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:40:42,658 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:40:42,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:40:42,658 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:40:42,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:40:42,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:40:42,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:40:42,659 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:40:42,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:40:42,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:40:42,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:40:42,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:40:42,660 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:40:42,660 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:40:42,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:40:42,661 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:40:42,661 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:40:42,661 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:40:42,661 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:40:42,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:40:42,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:40:42,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:40:42,974 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:40:42,974 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:40:42,975 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_rmo.oepc.i [2019-12-27 15:40:43,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c21e09b9/666fcf3857d542dfa5f14e328c697d3e/FLAGd30ded89c [2019-12-27 15:40:43,713 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:40:43,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_rmo.oepc.i [2019-12-27 15:40:43,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c21e09b9/666fcf3857d542dfa5f14e328c697d3e/FLAGd30ded89c [2019-12-27 15:40:43,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c21e09b9/666fcf3857d542dfa5f14e328c697d3e [2019-12-27 15:40:43,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:40:43,943 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:40:43,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:40:43,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:40:43,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:40:43,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:40:43" (1/1) ... [2019-12-27 15:40:43,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6248610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:43, skipping insertion in model container [2019-12-27 15:40:43,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:40:43" (1/1) ... [2019-12-27 15:40:43,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:40:44,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:40:44,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:40:44,586 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:40:44,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:40:44,760 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:40:44,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:44 WrapperNode [2019-12-27 15:40:44,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:40:44,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:40:44,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:40:44,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:40:44,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:44" (1/1) ... [2019-12-27 15:40:44,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:44" (1/1) ... [2019-12-27 15:40:44,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:40:44,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:40:44,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:40:44,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:40:44,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:44" (1/1) ... [2019-12-27 15:40:44,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:44" (1/1) ... [2019-12-27 15:40:44,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:44" (1/1) ... [2019-12-27 15:40:44,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:44" (1/1) ... [2019-12-27 15:40:44,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:44" (1/1) ... [2019-12-27 15:40:44,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:44" (1/1) ... [2019-12-27 15:40:44,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:44" (1/1) ... [2019-12-27 15:40:44,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:40:44,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:40:44,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:40:44,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:40:44,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:44" (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 15:40:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:40:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:40:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:40:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:40:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:40:44,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:40:44,962 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:40:44,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:40:44,962 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:40:44,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:40:44,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:40:44,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:40:44,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:40:44,965 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 15:40:45,753 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:40:45,754 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:40:45,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:40:45 BoogieIcfgContainer [2019-12-27 15:40:45,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:40:45,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:40:45,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:40:45,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:40:45,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:40:43" (1/3) ... [2019-12-27 15:40:45,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f96fed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:40:45, skipping insertion in model container [2019-12-27 15:40:45,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:44" (2/3) ... [2019-12-27 15:40:45,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f96fed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:40:45, skipping insertion in model container [2019-12-27 15:40:45,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:40:45" (3/3) ... [2019-12-27 15:40:45,766 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_rmo.oepc.i [2019-12-27 15:40:45,777 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:40:45,777 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:40:45,784 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:40:45,785 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:40:45,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,827 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,827 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,828 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,829 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,829 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,838 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,846 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,847 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,891 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,893 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,901 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,901 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,901 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,903 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,904 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:45,923 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:40:45,943 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:40:45,943 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:40:45,943 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:40:45,943 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:40:45,943 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:40:45,944 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:40:45,944 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:40:45,944 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:40:45,960 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 15:40:45,962 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 15:40:46,064 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 15:40:46,065 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:40:46,082 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 15:40:46,106 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 15:40:46,160 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 15:40:46,161 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:40:46,169 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 15:40:46,190 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 15:40:46,191 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:40:51,691 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 15:40:51,824 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 15:40:51,852 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78628 [2019-12-27 15:40:51,852 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 15:40:51,856 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 15:41:09,303 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110182 states. [2019-12-27 15:41:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 110182 states. [2019-12-27 15:41:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:41:09,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:09,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:41:09,311 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 15:41:09,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:09,317 INFO L82 PathProgramCache]: Analyzing trace with hash 917838, now seen corresponding path program 1 times [2019-12-27 15:41:09,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:09,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830410653] [2019-12-27 15:41:09,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:09,620 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 15:41:09,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830410653] [2019-12-27 15:41:09,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:09,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:41:09,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [746531077] [2019-12-27 15:41:09,626 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:09,630 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:09,642 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:41:09,643 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:09,647 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:09,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:41:09,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:09,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:41:09,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:41:09,664 INFO L87 Difference]: Start difference. First operand 110182 states. Second operand 3 states. [2019-12-27 15:41:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:10,989 INFO L93 Difference]: Finished difference Result 109312 states and 463550 transitions. [2019-12-27 15:41:10,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:41:10,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:41:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:11,592 INFO L225 Difference]: With dead ends: 109312 [2019-12-27 15:41:11,593 INFO L226 Difference]: Without dead ends: 102592 [2019-12-27 15:41:11,594 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 15:41:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102592 states. [2019-12-27 15:41:21,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102592 to 102592. [2019-12-27 15:41:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102592 states. [2019-12-27 15:41:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102592 states to 102592 states and 434430 transitions. [2019-12-27 15:41:21,775 INFO L78 Accepts]: Start accepts. Automaton has 102592 states and 434430 transitions. Word has length 3 [2019-12-27 15:41:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:21,775 INFO L462 AbstractCegarLoop]: Abstraction has 102592 states and 434430 transitions. [2019-12-27 15:41:21,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:41:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 102592 states and 434430 transitions. [2019-12-27 15:41:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:41:21,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:21,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:21,779 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 15:41:21,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:21,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1857942485, now seen corresponding path program 1 times [2019-12-27 15:41:21,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:21,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38319793] [2019-12-27 15:41:21,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:21,867 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 15:41:21,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38319793] [2019-12-27 15:41:21,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:21,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:41:21,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1037914402] [2019-12-27 15:41:21,869 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:21,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:21,874 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:41:21,874 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:21,875 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:21,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:41:21,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:21,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:41:21,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:41:21,877 INFO L87 Difference]: Start difference. First operand 102592 states and 434430 transitions. Second operand 4 states. [2019-12-27 15:41:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:27,534 INFO L93 Difference]: Finished difference Result 159508 states and 648686 transitions. [2019-12-27 15:41:27,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:41:27,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:41:27,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:28,262 INFO L225 Difference]: With dead ends: 159508 [2019-12-27 15:41:28,263 INFO L226 Difference]: Without dead ends: 159459 [2019-12-27 15:41:28,265 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 15:41:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159459 states. [2019-12-27 15:41:38,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159459 to 146095. [2019-12-27 15:41:38,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146095 states. [2019-12-27 15:41:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146095 states to 146095 states and 601450 transitions. [2019-12-27 15:41:39,145 INFO L78 Accepts]: Start accepts. Automaton has 146095 states and 601450 transitions. Word has length 11 [2019-12-27 15:41:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:39,145 INFO L462 AbstractCegarLoop]: Abstraction has 146095 states and 601450 transitions. [2019-12-27 15:41:39,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:41:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 146095 states and 601450 transitions. [2019-12-27 15:41:43,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:41:43,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:43,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:43,236 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 15:41:43,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:43,237 INFO L82 PathProgramCache]: Analyzing trace with hash 230844073, now seen corresponding path program 1 times [2019-12-27 15:41:43,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:43,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780174228] [2019-12-27 15:41:43,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:43,338 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 15:41:43,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780174228] [2019-12-27 15:41:43,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:43,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:41:43,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2132543102] [2019-12-27 15:41:43,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:43,341 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:43,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:41:43,343 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:43,343 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:43,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:41:43,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:43,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:41:43,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:41:43,344 INFO L87 Difference]: Start difference. First operand 146095 states and 601450 transitions. Second operand 3 states. [2019-12-27 15:41:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:43,492 INFO L93 Difference]: Finished difference Result 32284 states and 104220 transitions. [2019-12-27 15:41:43,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:41:43,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:41:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:43,568 INFO L225 Difference]: With dead ends: 32284 [2019-12-27 15:41:43,569 INFO L226 Difference]: Without dead ends: 32284 [2019-12-27 15:41:43,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:41:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32284 states. [2019-12-27 15:41:44,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32284 to 32284. [2019-12-27 15:41:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32284 states. [2019-12-27 15:41:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32284 states to 32284 states and 104220 transitions. [2019-12-27 15:41:44,187 INFO L78 Accepts]: Start accepts. Automaton has 32284 states and 104220 transitions. Word has length 13 [2019-12-27 15:41:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:44,188 INFO L462 AbstractCegarLoop]: Abstraction has 32284 states and 104220 transitions. [2019-12-27 15:41:44,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:41:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 32284 states and 104220 transitions. [2019-12-27 15:41:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:41:44,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:44,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:44,192 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 15:41:44,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:44,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1069845708, now seen corresponding path program 1 times [2019-12-27 15:41:44,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:44,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820262426] [2019-12-27 15:41:44,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:44,266 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 15:41:44,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820262426] [2019-12-27 15:41:44,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:44,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:41:44,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [597947307] [2019-12-27 15:41:44,267 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:44,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:44,273 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:41:44,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:44,273 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:44,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:41:44,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:44,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:41:44,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:41:44,275 INFO L87 Difference]: Start difference. First operand 32284 states and 104220 transitions. Second operand 4 states. [2019-12-27 15:41:44,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:44,597 INFO L93 Difference]: Finished difference Result 40215 states and 129418 transitions. [2019-12-27 15:41:44,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:41:44,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 15:41:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:44,675 INFO L225 Difference]: With dead ends: 40215 [2019-12-27 15:41:44,675 INFO L226 Difference]: Without dead ends: 40215 [2019-12-27 15:41:44,676 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 15:41:44,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40215 states. [2019-12-27 15:41:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40215 to 36090. [2019-12-27 15:41:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36090 states. [2019-12-27 15:41:45,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36090 states to 36090 states and 116495 transitions. [2019-12-27 15:41:45,919 INFO L78 Accepts]: Start accepts. Automaton has 36090 states and 116495 transitions. Word has length 16 [2019-12-27 15:41:45,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:45,920 INFO L462 AbstractCegarLoop]: Abstraction has 36090 states and 116495 transitions. [2019-12-27 15:41:45,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:41:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 36090 states and 116495 transitions. [2019-12-27 15:41:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:41:45,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:45,929 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 15:41:45,930 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 15:41:45,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:45,930 INFO L82 PathProgramCache]: Analyzing trace with hash 6986775, now seen corresponding path program 1 times [2019-12-27 15:41:45,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:45,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116519728] [2019-12-27 15:41:45,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:46,074 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 15:41:46,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116519728] [2019-12-27 15:41:46,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:46,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:41:46,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1156312845] [2019-12-27 15:41:46,076 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:46,080 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:46,087 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 15:41:46,088 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:46,089 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:46,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:41:46,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:46,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:41:46,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:41:46,090 INFO L87 Difference]: Start difference. First operand 36090 states and 116495 transitions. Second operand 5 states. [2019-12-27 15:41:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:46,754 INFO L93 Difference]: Finished difference Result 46566 states and 147831 transitions. [2019-12-27 15:41:46,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:41:46,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 15:41:46,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:46,833 INFO L225 Difference]: With dead ends: 46566 [2019-12-27 15:41:46,833 INFO L226 Difference]: Without dead ends: 46559 [2019-12-27 15:41:46,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:41:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46559 states. [2019-12-27 15:41:47,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46559 to 35784. [2019-12-27 15:41:47,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2019-12-27 15:41:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 115349 transitions. [2019-12-27 15:41:47,517 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 115349 transitions. Word has length 22 [2019-12-27 15:41:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:47,518 INFO L462 AbstractCegarLoop]: Abstraction has 35784 states and 115349 transitions. [2019-12-27 15:41:47,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:41:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 115349 transitions. [2019-12-27 15:41:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:41:47,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:47,530 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 15:41:47,530 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 15:41:47,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:47,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1437372217, now seen corresponding path program 1 times [2019-12-27 15:41:47,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:47,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523214701] [2019-12-27 15:41:47,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:47,587 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 15:41:47,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523214701] [2019-12-27 15:41:47,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:47,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:41:47,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1619495726] [2019-12-27 15:41:47,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:47,592 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:47,601 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 15:41:47,602 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:47,638 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:41:47,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:41:47,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:47,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:41:47,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:41:47,639 INFO L87 Difference]: Start difference. First operand 35784 states and 115349 transitions. Second operand 5 states. [2019-12-27 15:41:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:47,728 INFO L93 Difference]: Finished difference Result 14498 states and 44125 transitions. [2019-12-27 15:41:47,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:41:47,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 15:41:47,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:47,748 INFO L225 Difference]: With dead ends: 14498 [2019-12-27 15:41:47,748 INFO L226 Difference]: Without dead ends: 14498 [2019-12-27 15:41:47,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:41:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2019-12-27 15:41:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 14254. [2019-12-27 15:41:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14254 states. [2019-12-27 15:41:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14254 states to 14254 states and 43429 transitions. [2019-12-27 15:41:47,966 INFO L78 Accepts]: Start accepts. Automaton has 14254 states and 43429 transitions. Word has length 25 [2019-12-27 15:41:47,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:47,966 INFO L462 AbstractCegarLoop]: Abstraction has 14254 states and 43429 transitions. [2019-12-27 15:41:47,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:41:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states and 43429 transitions. [2019-12-27 15:41:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:41:47,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:47,977 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 15:41:47,977 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 15:41:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:47,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1947963172, now seen corresponding path program 1 times [2019-12-27 15:41:47,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:47,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976874791] [2019-12-27 15:41:47,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:48,078 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 15:41:48,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976874791] [2019-12-27 15:41:48,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:48,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:41:48,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [956091701] [2019-12-27 15:41:48,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:48,085 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:48,091 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:41:48,091 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:48,092 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:48,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:41:48,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:48,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:41:48,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:41:48,093 INFO L87 Difference]: Start difference. First operand 14254 states and 43429 transitions. Second operand 6 states. [2019-12-27 15:41:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:48,932 INFO L93 Difference]: Finished difference Result 39008 states and 118911 transitions. [2019-12-27 15:41:48,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:41:48,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 15:41:48,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:48,990 INFO L225 Difference]: With dead ends: 39008 [2019-12-27 15:41:48,991 INFO L226 Difference]: Without dead ends: 39008 [2019-12-27 15:41:48,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:41:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39008 states. [2019-12-27 15:41:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39008 to 21620. [2019-12-27 15:41:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21620 states. [2019-12-27 15:41:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 66985 transitions. [2019-12-27 15:41:49,577 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 66985 transitions. Word has length 27 [2019-12-27 15:41:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:49,578 INFO L462 AbstractCegarLoop]: Abstraction has 21620 states and 66985 transitions. [2019-12-27 15:41:49,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:41:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 66985 transitions. [2019-12-27 15:41:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 15:41:49,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:49,596 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 15:41:49,596 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 15:41:49,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:49,596 INFO L82 PathProgramCache]: Analyzing trace with hash -89566793, now seen corresponding path program 1 times [2019-12-27 15:41:49,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:49,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477815961] [2019-12-27 15:41:49,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:49,681 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 15:41:49,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477815961] [2019-12-27 15:41:49,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:49,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:41:49,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1239019453] [2019-12-27 15:41:49,682 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:49,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:49,695 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 15:41:49,695 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:49,696 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:49,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:41:49,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:49,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:41:49,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:41:49,697 INFO L87 Difference]: Start difference. First operand 21620 states and 66985 transitions. Second operand 6 states. [2019-12-27 15:41:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:50,453 INFO L93 Difference]: Finished difference Result 43584 states and 132186 transitions. [2019-12-27 15:41:50,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:41:50,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 15:41:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:50,520 INFO L225 Difference]: With dead ends: 43584 [2019-12-27 15:41:50,520 INFO L226 Difference]: Without dead ends: 43584 [2019-12-27 15:41:50,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:41:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43584 states. [2019-12-27 15:41:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43584 to 21360. [2019-12-27 15:41:50,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21360 states. [2019-12-27 15:41:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21360 states to 21360 states and 66500 transitions. [2019-12-27 15:41:50,988 INFO L78 Accepts]: Start accepts. Automaton has 21360 states and 66500 transitions. Word has length 28 [2019-12-27 15:41:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:50,989 INFO L462 AbstractCegarLoop]: Abstraction has 21360 states and 66500 transitions. [2019-12-27 15:41:50,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:41:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 21360 states and 66500 transitions. [2019-12-27 15:41:51,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:41:51,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:51,013 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 15:41:51,013 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 15:41:51,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:51,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1720610055, now seen corresponding path program 1 times [2019-12-27 15:41:51,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:51,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456701894] [2019-12-27 15:41:51,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:51,107 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 15:41:51,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456701894] [2019-12-27 15:41:51,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:51,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:41:51,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [289152519] [2019-12-27 15:41:51,108 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:51,115 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:51,128 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 15:41:51,128 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:51,129 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:51,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:41:51,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:51,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:41:51,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:41:51,130 INFO L87 Difference]: Start difference. First operand 21360 states and 66500 transitions. Second operand 7 states. [2019-12-27 15:41:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:52,506 INFO L93 Difference]: Finished difference Result 51613 states and 157651 transitions. [2019-12-27 15:41:52,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 15:41:52,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 15:41:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:52,592 INFO L225 Difference]: With dead ends: 51613 [2019-12-27 15:41:52,592 INFO L226 Difference]: Without dead ends: 51613 [2019-12-27 15:41:52,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:41:52,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51613 states. [2019-12-27 15:41:53,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51613 to 23540. [2019-12-27 15:41:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23540 states. [2019-12-27 15:41:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23540 states to 23540 states and 73219 transitions. [2019-12-27 15:41:53,379 INFO L78 Accepts]: Start accepts. Automaton has 23540 states and 73219 transitions. Word has length 33 [2019-12-27 15:41:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:53,379 INFO L462 AbstractCegarLoop]: Abstraction has 23540 states and 73219 transitions. [2019-12-27 15:41:53,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:41:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 23540 states and 73219 transitions. [2019-12-27 15:41:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:41:53,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:53,407 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 15:41:53,407 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 15:41:53,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:53,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1518720007, now seen corresponding path program 2 times [2019-12-27 15:41:53,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:53,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310013938] [2019-12-27 15:41:53,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:53,516 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 15:41:53,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310013938] [2019-12-27 15:41:53,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:53,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:41:53,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [10264425] [2019-12-27 15:41:53,518 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:53,526 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:53,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 15:41:53,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:53,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:41:53,600 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:41:53,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:41:53,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:53,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:41:53,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:41:53,601 INFO L87 Difference]: Start difference. First operand 23540 states and 73219 transitions. Second operand 9 states. [2019-12-27 15:41:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:56,871 INFO L93 Difference]: Finished difference Result 87829 states and 263704 transitions. [2019-12-27 15:41:56,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 15:41:56,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 15:41:56,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:57,013 INFO L225 Difference]: With dead ends: 87829 [2019-12-27 15:41:57,013 INFO L226 Difference]: Without dead ends: 87829 [2019-12-27 15:41:57,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=389, Invalid=1333, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 15:41:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87829 states. [2019-12-27 15:41:57,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87829 to 25448. [2019-12-27 15:41:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25448 states. [2019-12-27 15:41:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25448 states to 25448 states and 78846 transitions. [2019-12-27 15:41:58,296 INFO L78 Accepts]: Start accepts. Automaton has 25448 states and 78846 transitions. Word has length 33 [2019-12-27 15:41:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:58,296 INFO L462 AbstractCegarLoop]: Abstraction has 25448 states and 78846 transitions. [2019-12-27 15:41:58,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:41:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 25448 states and 78846 transitions. [2019-12-27 15:41:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:41:58,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:58,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:58,326 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 15:41:58,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:58,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2146187134, now seen corresponding path program 1 times [2019-12-27 15:41:58,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:58,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525764479] [2019-12-27 15:41:58,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:58,449 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 15:41:58,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525764479] [2019-12-27 15:41:58,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:58,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:41:58,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1866745689] [2019-12-27 15:41:58,450 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:58,457 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:58,473 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 15:41:58,473 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:58,474 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:58,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:41:58,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:58,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:41:58,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:41:58,475 INFO L87 Difference]: Start difference. First operand 25448 states and 78846 transitions. Second operand 7 states. [2019-12-27 15:41:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:59,996 INFO L93 Difference]: Finished difference Result 51173 states and 154813 transitions. [2019-12-27 15:41:59,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 15:41:59,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 15:41:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:00,078 INFO L225 Difference]: With dead ends: 51173 [2019-12-27 15:42:00,078 INFO L226 Difference]: Without dead ends: 51173 [2019-12-27 15:42:00,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:42:00,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51173 states. [2019-12-27 15:42:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51173 to 23042. [2019-12-27 15:42:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23042 states. [2019-12-27 15:42:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23042 states to 23042 states and 71463 transitions. [2019-12-27 15:42:00,615 INFO L78 Accepts]: Start accepts. Automaton has 23042 states and 71463 transitions. Word has length 34 [2019-12-27 15:42:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:00,615 INFO L462 AbstractCegarLoop]: Abstraction has 23042 states and 71463 transitions. [2019-12-27 15:42:00,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:42:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 23042 states and 71463 transitions. [2019-12-27 15:42:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:42:00,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:00,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:00,635 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 15:42:00,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:00,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1401085166, now seen corresponding path program 2 times [2019-12-27 15:42:00,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:00,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905344227] [2019-12-27 15:42:00,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:00,771 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 15:42:00,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905344227] [2019-12-27 15:42:00,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:00,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:42:00,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [9179893] [2019-12-27 15:42:00,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:00,780 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:00,796 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 56 transitions. [2019-12-27 15:42:00,796 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:00,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:42:00,817 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:42:00,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:42:00,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:00,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:42:00,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:42:00,818 INFO L87 Difference]: Start difference. First operand 23042 states and 71463 transitions. Second operand 9 states. [2019-12-27 15:42:03,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:03,596 INFO L93 Difference]: Finished difference Result 67964 states and 203283 transitions. [2019-12-27 15:42:03,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 15:42:03,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 15:42:03,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:03,706 INFO L225 Difference]: With dead ends: 67964 [2019-12-27 15:42:03,707 INFO L226 Difference]: Without dead ends: 67964 [2019-12-27 15:42:03,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=356, Invalid=1204, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 15:42:03,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67964 states. [2019-12-27 15:42:04,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67964 to 21364. [2019-12-27 15:42:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21364 states. [2019-12-27 15:42:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21364 states to 21364 states and 66317 transitions. [2019-12-27 15:42:04,572 INFO L78 Accepts]: Start accepts. Automaton has 21364 states and 66317 transitions. Word has length 34 [2019-12-27 15:42:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:04,573 INFO L462 AbstractCegarLoop]: Abstraction has 21364 states and 66317 transitions. [2019-12-27 15:42:04,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:42:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 21364 states and 66317 transitions. [2019-12-27 15:42:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:42:04,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:04,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:04,599 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 15:42:04,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:04,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2037707369, now seen corresponding path program 1 times [2019-12-27 15:42:04,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:04,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917300258] [2019-12-27 15:42:04,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:04,649 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 15:42:04,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917300258] [2019-12-27 15:42:04,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:04,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:42:04,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911605554] [2019-12-27 15:42:04,650 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:04,658 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:04,721 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 341 transitions. [2019-12-27 15:42:04,721 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:04,722 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:42:04,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:42:04,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:04,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:42:04,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:42:04,723 INFO L87 Difference]: Start difference. First operand 21364 states and 66317 transitions. Second operand 3 states. [2019-12-27 15:42:04,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:04,809 INFO L93 Difference]: Finished difference Result 21363 states and 66315 transitions. [2019-12-27 15:42:04,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:42:04,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:42:04,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:04,839 INFO L225 Difference]: With dead ends: 21363 [2019-12-27 15:42:04,839 INFO L226 Difference]: Without dead ends: 21363 [2019-12-27 15:42:04,840 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 15:42:04,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21363 states. [2019-12-27 15:42:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21363 to 21363. [2019-12-27 15:42:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21363 states. [2019-12-27 15:42:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21363 states to 21363 states and 66315 transitions. [2019-12-27 15:42:05,169 INFO L78 Accepts]: Start accepts. Automaton has 21363 states and 66315 transitions. Word has length 39 [2019-12-27 15:42:05,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:05,169 INFO L462 AbstractCegarLoop]: Abstraction has 21363 states and 66315 transitions. [2019-12-27 15:42:05,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:42:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 21363 states and 66315 transitions. [2019-12-27 15:42:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:42:05,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:05,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:05,202 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 15:42:05,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:05,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1505013692, now seen corresponding path program 1 times [2019-12-27 15:42:05,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:05,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520534312] [2019-12-27 15:42:05,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:05,275 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 15:42:05,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520534312] [2019-12-27 15:42:05,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:05,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:42:05,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [489086455] [2019-12-27 15:42:05,276 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:05,284 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:05,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 415 transitions. [2019-12-27 15:42:05,369 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:05,386 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:42:05,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:42:05,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:05,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:42:05,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:42:05,387 INFO L87 Difference]: Start difference. First operand 21363 states and 66315 transitions. Second operand 4 states. [2019-12-27 15:42:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:05,689 INFO L93 Difference]: Finished difference Result 41798 states and 130267 transitions. [2019-12-27 15:42:05,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:42:05,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 15:42:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:05,724 INFO L225 Difference]: With dead ends: 41798 [2019-12-27 15:42:05,725 INFO L226 Difference]: Without dead ends: 23522 [2019-12-27 15:42:05,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:42:05,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23522 states. [2019-12-27 15:42:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23522 to 19758. [2019-12-27 15:42:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19758 states. [2019-12-27 15:42:06,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19758 states to 19758 states and 60425 transitions. [2019-12-27 15:42:06,044 INFO L78 Accepts]: Start accepts. Automaton has 19758 states and 60425 transitions. Word has length 40 [2019-12-27 15:42:06,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:06,044 INFO L462 AbstractCegarLoop]: Abstraction has 19758 states and 60425 transitions. [2019-12-27 15:42:06,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:42:06,045 INFO L276 IsEmpty]: Start isEmpty. Operand 19758 states and 60425 transitions. [2019-12-27 15:42:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:42:06,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:06,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:06,064 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 15:42:06,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:06,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2071452234, now seen corresponding path program 2 times [2019-12-27 15:42:06,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:06,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420305957] [2019-12-27 15:42:06,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:06,154 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 15:42:06,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420305957] [2019-12-27 15:42:06,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:06,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:42:06,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [142384303] [2019-12-27 15:42:06,155 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:06,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:06,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 413 transitions. [2019-12-27 15:42:06,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:06,603 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 15:42:06,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 15:42:06,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:06,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 15:42:06,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:42:06,604 INFO L87 Difference]: Start difference. First operand 19758 states and 60425 transitions. Second operand 15 states. [2019-12-27 15:42:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:10,611 INFO L93 Difference]: Finished difference Result 55674 states and 166747 transitions. [2019-12-27 15:42:10,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 15:42:10,612 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-12-27 15:42:10,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:10,699 INFO L225 Difference]: With dead ends: 55674 [2019-12-27 15:42:10,699 INFO L226 Difference]: Without dead ends: 55674 [2019-12-27 15:42:10,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:42:10,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55674 states. [2019-12-27 15:42:11,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55674 to 25361. [2019-12-27 15:42:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25361 states. [2019-12-27 15:42:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25361 states to 25361 states and 77161 transitions. [2019-12-27 15:42:11,344 INFO L78 Accepts]: Start accepts. Automaton has 25361 states and 77161 transitions. Word has length 40 [2019-12-27 15:42:11,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:11,344 INFO L462 AbstractCegarLoop]: Abstraction has 25361 states and 77161 transitions. [2019-12-27 15:42:11,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 15:42:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 25361 states and 77161 transitions. [2019-12-27 15:42:11,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:42:11,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:11,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:11,372 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 15:42:11,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:11,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1944149328, now seen corresponding path program 3 times [2019-12-27 15:42:11,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:11,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68465058] [2019-12-27 15:42:11,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:11,435 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 15:42:11,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68465058] [2019-12-27 15:42:11,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:11,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:42:11,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1646330335] [2019-12-27 15:42:11,436 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:11,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:11,529 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 368 transitions. [2019-12-27 15:42:11,529 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:11,558 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:42:11,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:42:11,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:11,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:42:11,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:42:11,559 INFO L87 Difference]: Start difference. First operand 25361 states and 77161 transitions. Second operand 7 states. [2019-12-27 15:42:11,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:11,680 INFO L93 Difference]: Finished difference Result 23970 states and 73875 transitions. [2019-12-27 15:42:11,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:42:11,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 15:42:11,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:11,712 INFO L225 Difference]: With dead ends: 23970 [2019-12-27 15:42:11,712 INFO L226 Difference]: Without dead ends: 22286 [2019-12-27 15:42:11,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:42:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22286 states. [2019-12-27 15:42:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22286 to 21082. [2019-12-27 15:42:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21082 states. [2019-12-27 15:42:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21082 states to 21082 states and 66365 transitions. [2019-12-27 15:42:12,058 INFO L78 Accepts]: Start accepts. Automaton has 21082 states and 66365 transitions. Word has length 40 [2019-12-27 15:42:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:12,058 INFO L462 AbstractCegarLoop]: Abstraction has 21082 states and 66365 transitions. [2019-12-27 15:42:12,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:42:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 21082 states and 66365 transitions. [2019-12-27 15:42:12,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:42:12,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:12,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:12,085 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 15:42:12,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:12,086 INFO L82 PathProgramCache]: Analyzing trace with hash -157681056, now seen corresponding path program 1 times [2019-12-27 15:42:12,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:12,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436502851] [2019-12-27 15:42:12,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:12,233 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 15:42:12,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436502851] [2019-12-27 15:42:12,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:12,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:42:12,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [307548386] [2019-12-27 15:42:12,235 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:12,257 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:12,560 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 224 transitions. [2019-12-27 15:42:12,560 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:12,617 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:42:12,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:42:12,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:12,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:42:12,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:42:12,619 INFO L87 Difference]: Start difference. First operand 21082 states and 66365 transitions. Second operand 10 states. [2019-12-27 15:42:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:14,863 INFO L93 Difference]: Finished difference Result 183147 states and 568246 transitions. [2019-12-27 15:42:14,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 15:42:14,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 15:42:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:15,090 INFO L225 Difference]: With dead ends: 183147 [2019-12-27 15:42:15,090 INFO L226 Difference]: Without dead ends: 137572 [2019-12-27 15:42:15,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=426, Invalid=1296, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 15:42:15,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137572 states. [2019-12-27 15:42:16,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137572 to 29699. [2019-12-27 15:42:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29699 states. [2019-12-27 15:42:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29699 states to 29699 states and 93424 transitions. [2019-12-27 15:42:16,343 INFO L78 Accepts]: Start accepts. Automaton has 29699 states and 93424 transitions. Word has length 64 [2019-12-27 15:42:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:16,343 INFO L462 AbstractCegarLoop]: Abstraction has 29699 states and 93424 transitions. [2019-12-27 15:42:16,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:42:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 29699 states and 93424 transitions. [2019-12-27 15:42:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:42:16,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:16,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:16,379 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 15:42:16,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:16,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1424569061, now seen corresponding path program 1 times [2019-12-27 15:42:16,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:16,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013307456] [2019-12-27 15:42:16,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:16,439 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 15:42:16,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013307456] [2019-12-27 15:42:16,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:16,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:42:16,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1524903721] [2019-12-27 15:42:16,440 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:16,620 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:16,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 226 states and 421 transitions. [2019-12-27 15:42:16,815 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:16,819 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:42:16,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:42:16,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:16,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:42:16,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:42:16,820 INFO L87 Difference]: Start difference. First operand 29699 states and 93424 transitions. Second operand 3 states. [2019-12-27 15:42:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:16,953 INFO L93 Difference]: Finished difference Result 36604 states and 111916 transitions. [2019-12-27 15:42:16,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:42:16,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:42:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:17,004 INFO L225 Difference]: With dead ends: 36604 [2019-12-27 15:42:17,004 INFO L226 Difference]: Without dead ends: 35902 [2019-12-27 15:42:17,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 2 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 15:42:17,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35902 states. [2019-12-27 15:42:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35902 to 28194. [2019-12-27 15:42:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28194 states. [2019-12-27 15:42:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28194 states to 28194 states and 87321 transitions. [2019-12-27 15:42:17,517 INFO L78 Accepts]: Start accepts. Automaton has 28194 states and 87321 transitions. Word has length 64 [2019-12-27 15:42:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:17,517 INFO L462 AbstractCegarLoop]: Abstraction has 28194 states and 87321 transitions. [2019-12-27 15:42:17,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:42:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 28194 states and 87321 transitions. [2019-12-27 15:42:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:42:17,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:17,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:17,552 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 15:42:17,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:17,553 INFO L82 PathProgramCache]: Analyzing trace with hash -776372898, now seen corresponding path program 2 times [2019-12-27 15:42:17,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:17,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13963049] [2019-12-27 15:42:17,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:17,651 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 15:42:17,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13963049] [2019-12-27 15:42:17,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:17,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:42:17,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [567327739] [2019-12-27 15:42:17,653 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:17,670 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:17,874 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 264 states and 516 transitions. [2019-12-27 15:42:17,874 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:18,087 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 15:42:18,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:42:18,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:18,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:42:18,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:42:18,088 INFO L87 Difference]: Start difference. First operand 28194 states and 87321 transitions. Second operand 11 states. [2019-12-27 15:42:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:21,414 INFO L93 Difference]: Finished difference Result 179637 states and 542583 transitions. [2019-12-27 15:42:21,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 15:42:21,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 15:42:21,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:21,623 INFO L225 Difference]: With dead ends: 179637 [2019-12-27 15:42:21,623 INFO L226 Difference]: Without dead ends: 134057 [2019-12-27 15:42:21,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 13 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=560, Invalid=1990, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 15:42:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134057 states. [2019-12-27 15:42:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134057 to 30931. [2019-12-27 15:42:22,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30931 states. [2019-12-27 15:42:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30931 states to 30931 states and 95869 transitions. [2019-12-27 15:42:22,955 INFO L78 Accepts]: Start accepts. Automaton has 30931 states and 95869 transitions. Word has length 64 [2019-12-27 15:42:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:22,956 INFO L462 AbstractCegarLoop]: Abstraction has 30931 states and 95869 transitions. [2019-12-27 15:42:22,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:42:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 30931 states and 95869 transitions. [2019-12-27 15:42:22,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:42:22,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:22,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:22,993 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 15:42:22,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:22,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1881233072, now seen corresponding path program 3 times [2019-12-27 15:42:22,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:22,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807017185] [2019-12-27 15:42:22,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:42:23,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807017185] [2019-12-27 15:42:23,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:23,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:42:23,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1473040798] [2019-12-27 15:42:23,074 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:23,093 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:23,238 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 324 transitions. [2019-12-27 15:42:23,238 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:23,273 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:42:23,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:42:23,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:23,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:42:23,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:42:23,274 INFO L87 Difference]: Start difference. First operand 30931 states and 95869 transitions. Second operand 8 states. [2019-12-27 15:42:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:24,082 INFO L93 Difference]: Finished difference Result 87777 states and 266266 transitions. [2019-12-27 15:42:24,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:42:24,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 15:42:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:24,176 INFO L225 Difference]: With dead ends: 87777 [2019-12-27 15:42:24,177 INFO L226 Difference]: Without dead ends: 60946 [2019-12-27 15:42:24,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:42:24,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60946 states. [2019-12-27 15:42:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60946 to 34361. [2019-12-27 15:42:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34361 states. [2019-12-27 15:42:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34361 states to 34361 states and 106259 transitions. [2019-12-27 15:42:24,931 INFO L78 Accepts]: Start accepts. Automaton has 34361 states and 106259 transitions. Word has length 64 [2019-12-27 15:42:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:24,932 INFO L462 AbstractCegarLoop]: Abstraction has 34361 states and 106259 transitions. [2019-12-27 15:42:24,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:42:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 34361 states and 106259 transitions. [2019-12-27 15:42:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:42:24,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:24,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:24,974 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 15:42:24,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:24,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1457184858, now seen corresponding path program 4 times [2019-12-27 15:42:24,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:24,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423245905] [2019-12-27 15:42:24,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:25,059 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 15:42:25,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423245905] [2019-12-27 15:42:25,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:25,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:42:25,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2145161760] [2019-12-27 15:42:25,060 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:25,079 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:25,245 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 333 transitions. [2019-12-27 15:42:25,245 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:25,418 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 15:42:25,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:42:25,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:25,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:42:25,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:42:25,420 INFO L87 Difference]: Start difference. First operand 34361 states and 106259 transitions. Second operand 12 states. [2019-12-27 15:42:27,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:27,260 INFO L93 Difference]: Finished difference Result 86240 states and 261628 transitions. [2019-12-27 15:42:27,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:42:27,261 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 15:42:27,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:27,376 INFO L225 Difference]: With dead ends: 86240 [2019-12-27 15:42:27,377 INFO L226 Difference]: Without dead ends: 74691 [2019-12-27 15:42:27,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:42:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74691 states. [2019-12-27 15:42:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74691 to 34257. [2019-12-27 15:42:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34257 states. [2019-12-27 15:42:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34257 states to 34257 states and 105936 transitions. [2019-12-27 15:42:28,540 INFO L78 Accepts]: Start accepts. Automaton has 34257 states and 105936 transitions. Word has length 64 [2019-12-27 15:42:28,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:28,540 INFO L462 AbstractCegarLoop]: Abstraction has 34257 states and 105936 transitions. [2019-12-27 15:42:28,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:42:28,540 INFO L276 IsEmpty]: Start isEmpty. Operand 34257 states and 105936 transitions. [2019-12-27 15:42:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:42:28,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:28,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:28,583 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 15:42:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash 125444336, now seen corresponding path program 5 times [2019-12-27 15:42:28,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:28,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156330360] [2019-12-27 15:42:28,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:28,644 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 15:42:28,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156330360] [2019-12-27 15:42:28,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:28,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:42:28,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [729344684] [2019-12-27 15:42:28,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:28,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:28,872 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 316 transitions. [2019-12-27 15:42:28,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:28,873 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:42:28,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:42:28,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:28,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:42:28,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:42:28,876 INFO L87 Difference]: Start difference. First operand 34257 states and 105936 transitions. Second operand 3 states. [2019-12-27 15:42:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:29,194 INFO L93 Difference]: Finished difference Result 39718 states and 122101 transitions. [2019-12-27 15:42:29,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:42:29,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:42:29,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:29,303 INFO L225 Difference]: With dead ends: 39718 [2019-12-27 15:42:29,303 INFO L226 Difference]: Without dead ends: 39718 [2019-12-27 15:42:29,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:42:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39718 states. [2019-12-27 15:42:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39718 to 35205. [2019-12-27 15:42:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35205 states. [2019-12-27 15:42:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35205 states to 35205 states and 108931 transitions. [2019-12-27 15:42:30,107 INFO L78 Accepts]: Start accepts. Automaton has 35205 states and 108931 transitions. Word has length 64 [2019-12-27 15:42:30,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:30,107 INFO L462 AbstractCegarLoop]: Abstraction has 35205 states and 108931 transitions. [2019-12-27 15:42:30,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:42:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 35205 states and 108931 transitions. [2019-12-27 15:42:30,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:42:30,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:30,150 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 15:42:30,150 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 15:42:30,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:30,150 INFO L82 PathProgramCache]: Analyzing trace with hash -850815266, now seen corresponding path program 1 times [2019-12-27 15:42:30,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:30,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240254289] [2019-12-27 15:42:30,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:30,272 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 15:42:30,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240254289] [2019-12-27 15:42:30,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:30,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:42:30,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1477582188] [2019-12-27 15:42:30,276 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:30,297 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:30,420 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 227 transitions. [2019-12-27 15:42:30,420 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:30,473 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:42:30,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:42:30,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:30,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:42:30,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:42:30,474 INFO L87 Difference]: Start difference. First operand 35205 states and 108931 transitions. Second operand 10 states. [2019-12-27 15:42:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:32,421 INFO L93 Difference]: Finished difference Result 133356 states and 402735 transitions. [2019-12-27 15:42:32,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 15:42:32,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 15:42:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:32,612 INFO L225 Difference]: With dead ends: 133356 [2019-12-27 15:42:32,612 INFO L226 Difference]: Without dead ends: 122057 [2019-12-27 15:42:32,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2019-12-27 15:42:32,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122057 states. [2019-12-27 15:42:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122057 to 36925. [2019-12-27 15:42:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36925 states. [2019-12-27 15:42:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36925 states to 36925 states and 113758 transitions. [2019-12-27 15:42:33,855 INFO L78 Accepts]: Start accepts. Automaton has 36925 states and 113758 transitions. Word has length 65 [2019-12-27 15:42:33,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:33,856 INFO L462 AbstractCegarLoop]: Abstraction has 36925 states and 113758 transitions. [2019-12-27 15:42:33,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:42:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 36925 states and 113758 transitions. [2019-12-27 15:42:33,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:42:33,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:33,895 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 15:42:33,895 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 15:42:33,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:33,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2088772025, now seen corresponding path program 1 times [2019-12-27 15:42:33,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:33,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854611047] [2019-12-27 15:42:33,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:34,017 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 15:42:34,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854611047] [2019-12-27 15:42:34,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:34,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:42:34,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901570016] [2019-12-27 15:42:34,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:34,043 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:34,365 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 465 transitions. [2019-12-27 15:42:34,365 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:34,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:42:34,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 15:42:34,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:42:35,009 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-12-27 15:42:35,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:42:35,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 15:42:35,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 15:42:35,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:35,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 15:42:35,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:42:35,164 INFO L87 Difference]: Start difference. First operand 36925 states and 113758 transitions. Second operand 18 states. [2019-12-27 15:42:40,349 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-27 15:42:40,542 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-12-27 15:42:40,863 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-12-27 15:42:41,107 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-27 15:42:41,408 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-12-27 15:42:41,722 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-27 15:42:41,950 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-27 15:42:42,129 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-12-27 15:42:42,430 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-27 15:42:42,609 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-12-27 15:42:42,857 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-12-27 15:42:43,042 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-12-27 15:42:43,378 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-27 15:42:43,545 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-27 15:42:43,791 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-12-27 15:42:44,144 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-12-27 15:42:44,318 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-12-27 15:42:44,632 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-27 15:42:44,875 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-12-27 15:42:45,073 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-12-27 15:42:45,276 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-12-27 15:42:45,595 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-12-27 15:42:46,162 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-12-27 15:42:46,364 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-12-27 15:42:46,550 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 15:42:46,695 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 15:42:47,105 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-12-27 15:42:47,317 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-12-27 15:42:47,560 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 15:42:47,708 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 15:42:47,851 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 15:42:47,989 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 15:42:48,375 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-12-27 15:42:48,536 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 15:42:48,672 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 15:42:48,814 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 15:42:48,986 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 15:42:49,378 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-12-27 15:42:49,847 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 15:42:50,087 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 15:42:50,251 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-27 15:42:50,511 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-27 15:42:50,874 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 15:42:51,023 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-27 15:42:51,202 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-27 15:42:51,354 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 15:42:51,723 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 15:42:51,878 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-12-27 15:42:52,210 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 15:42:52,392 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-12-27 15:42:52,582 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-12-27 15:42:52,769 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-12-27 15:42:53,040 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-27 15:42:53,457 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 15:42:53,629 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-27 15:42:54,040 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 15:42:54,224 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-12-27 15:42:54,368 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 15:42:54,545 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-27 15:42:55,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:55,119 INFO L93 Difference]: Finished difference Result 164532 states and 494047 transitions. [2019-12-27 15:42:55,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-12-27 15:42:55,120 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2019-12-27 15:42:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:55,326 INFO L225 Difference]: With dead ends: 164532 [2019-12-27 15:42:55,326 INFO L226 Difference]: Without dead ends: 137537 [2019-12-27 15:42:55,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 16 SyntacticMatches, 9 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8328 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=3368, Invalid=16938, Unknown=0, NotChecked=0, Total=20306 [2019-12-27 15:42:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137537 states. [2019-12-27 15:42:56,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137537 to 37006. [2019-12-27 15:42:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37006 states. [2019-12-27 15:42:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37006 states to 37006 states and 114761 transitions. [2019-12-27 15:42:56,756 INFO L78 Accepts]: Start accepts. Automaton has 37006 states and 114761 transitions. Word has length 65 [2019-12-27 15:42:56,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:56,757 INFO L462 AbstractCegarLoop]: Abstraction has 37006 states and 114761 transitions. [2019-12-27 15:42:56,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 15:42:56,757 INFO L276 IsEmpty]: Start isEmpty. Operand 37006 states and 114761 transitions. [2019-12-27 15:42:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:42:57,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:57,001 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 15:42:57,001 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 15:42:57,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:57,001 INFO L82 PathProgramCache]: Analyzing trace with hash 372067404, now seen corresponding path program 1 times [2019-12-27 15:42:57,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:57,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069564377] [2019-12-27 15:42:57,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:57,153 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 15:42:57,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069564377] [2019-12-27 15:42:57,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:57,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:42:57,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1902334625] [2019-12-27 15:42:57,154 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:57,182 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:57,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 365 transitions. [2019-12-27 15:42:57,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:57,418 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:42:57,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:42:57,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:57,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:42:57,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:42:57,420 INFO L87 Difference]: Start difference. First operand 37006 states and 114761 transitions. Second operand 9 states. [2019-12-27 15:43:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:43:00,837 INFO L93 Difference]: Finished difference Result 90239 states and 272780 transitions. [2019-12-27 15:43:00,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 15:43:00,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 15:43:00,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:43:00,984 INFO L225 Difference]: With dead ends: 90239 [2019-12-27 15:43:00,984 INFO L226 Difference]: Without dead ends: 90239 [2019-12-27 15:43:00,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 15:43:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90239 states. [2019-12-27 15:43:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90239 to 39758. [2019-12-27 15:43:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39758 states. [2019-12-27 15:43:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39758 states to 39758 states and 123898 transitions. [2019-12-27 15:43:02,080 INFO L78 Accepts]: Start accepts. Automaton has 39758 states and 123898 transitions. Word has length 65 [2019-12-27 15:43:02,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:43:02,081 INFO L462 AbstractCegarLoop]: Abstraction has 39758 states and 123898 transitions. [2019-12-27 15:43:02,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:43:02,081 INFO L276 IsEmpty]: Start isEmpty. Operand 39758 states and 123898 transitions. [2019-12-27 15:43:02,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:43:02,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:43:02,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:43:02,124 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 15:43:02,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:43:02,125 INFO L82 PathProgramCache]: Analyzing trace with hash 140793632, now seen corresponding path program 2 times [2019-12-27 15:43:02,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:43:02,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397928354] [2019-12-27 15:43:02,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:43:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:43:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:43:02,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397928354] [2019-12-27 15:43:02,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:43:02,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:43:02,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [26356092] [2019-12-27 15:43:02,184 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:43:02,203 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:43:02,615 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 311 transitions. [2019-12-27 15:43:02,615 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:43:02,616 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:43:02,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:43:02,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:43:02,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:43:02,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:43:02,617 INFO L87 Difference]: Start difference. First operand 39758 states and 123898 transitions. Second operand 3 states. [2019-12-27 15:43:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:43:02,748 INFO L93 Difference]: Finished difference Result 30573 states and 94927 transitions. [2019-12-27 15:43:02,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:43:02,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:43:02,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:43:02,790 INFO L225 Difference]: With dead ends: 30573 [2019-12-27 15:43:02,790 INFO L226 Difference]: Without dead ends: 30573 [2019-12-27 15:43:02,790 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 15:43:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30573 states. [2019-12-27 15:43:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30573 to 28423. [2019-12-27 15:43:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28423 states. [2019-12-27 15:43:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28423 states to 28423 states and 87998 transitions. [2019-12-27 15:43:03,237 INFO L78 Accepts]: Start accepts. Automaton has 28423 states and 87998 transitions. Word has length 65 [2019-12-27 15:43:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:43:03,238 INFO L462 AbstractCegarLoop]: Abstraction has 28423 states and 87998 transitions. [2019-12-27 15:43:03,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:43:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 28423 states and 87998 transitions. [2019-12-27 15:43:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:43:03,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:43:03,272 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 15:43:03,273 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 15:43:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:43:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1442275055, now seen corresponding path program 1 times [2019-12-27 15:43:03,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:43:03,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986181523] [2019-12-27 15:43:03,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:43:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:43:03,573 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 15:43:03,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986181523] [2019-12-27 15:43:03,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:43:03,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 15:43:03,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [645723576] [2019-12-27 15:43:03,574 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:43:03,594 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:43:03,778 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 385 transitions. [2019-12-27 15:43:03,778 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:43:04,145 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 15:43:04,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 15:43:04,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:43:04,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 15:43:04,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:43:04,147 INFO L87 Difference]: Start difference. First operand 28423 states and 87998 transitions. Second operand 19 states. [2019-12-27 15:43:08,123 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 15:43:10,549 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-12-27 15:43:11,220 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-12-27 15:43:12,216 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-27 15:43:14,365 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 15:43:14,713 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-27 15:43:15,701 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-12-27 15:43:15,870 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 15:43:16,890 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-12-27 15:43:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:43:22,712 INFO L93 Difference]: Finished difference Result 110063 states and 323683 transitions. [2019-12-27 15:43:22,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-12-27 15:43:22,712 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-27 15:43:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:43:22,872 INFO L225 Difference]: With dead ends: 110063 [2019-12-27 15:43:22,872 INFO L226 Difference]: Without dead ends: 109895 [2019-12-27 15:43:22,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 45 SyntacticMatches, 11 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10514 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=3902, Invalid=22504, Unknown=0, NotChecked=0, Total=26406 [2019-12-27 15:43:23,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109895 states. [2019-12-27 15:43:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109895 to 32268. [2019-12-27 15:43:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32268 states. [2019-12-27 15:43:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32268 states to 32268 states and 100489 transitions. [2019-12-27 15:43:24,340 INFO L78 Accepts]: Start accepts. Automaton has 32268 states and 100489 transitions. Word has length 66 [2019-12-27 15:43:24,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:43:24,340 INFO L462 AbstractCegarLoop]: Abstraction has 32268 states and 100489 transitions. [2019-12-27 15:43:24,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 15:43:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand 32268 states and 100489 transitions. [2019-12-27 15:43:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:43:24,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:43:24,376 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 15:43:24,376 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 15:43:24,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:43:24,377 INFO L82 PathProgramCache]: Analyzing trace with hash -544773579, now seen corresponding path program 2 times [2019-12-27 15:43:24,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:43:24,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976745206] [2019-12-27 15:43:24,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:43:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:43:24,436 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 15:43:24,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976745206] [2019-12-27 15:43:24,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:43:24,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:43:24,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [679943061] [2019-12-27 15:43:24,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:43:24,459 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:43:24,690 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 339 transitions. [2019-12-27 15:43:24,690 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:43:24,691 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:43:24,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:43:24,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:43:24,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:43:24,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:43:24,692 INFO L87 Difference]: Start difference. First operand 32268 states and 100489 transitions. Second operand 3 states. [2019-12-27 15:43:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:43:24,888 INFO L93 Difference]: Finished difference Result 32268 states and 100488 transitions. [2019-12-27 15:43:24,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:43:24,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 15:43:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:43:24,968 INFO L225 Difference]: With dead ends: 32268 [2019-12-27 15:43:24,968 INFO L226 Difference]: Without dead ends: 32268 [2019-12-27 15:43:24,968 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 15:43:25,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32268 states. [2019-12-27 15:43:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32268 to 22761. [2019-12-27 15:43:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22761 states. [2019-12-27 15:43:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22761 states to 22761 states and 71136 transitions. [2019-12-27 15:43:25,697 INFO L78 Accepts]: Start accepts. Automaton has 22761 states and 71136 transitions. Word has length 66 [2019-12-27 15:43:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:43:25,697 INFO L462 AbstractCegarLoop]: Abstraction has 22761 states and 71136 transitions. [2019-12-27 15:43:25,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:43:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 22761 states and 71136 transitions. [2019-12-27 15:43:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:43:25,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:43:25,726 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 15:43:25,727 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:43:25,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:43:25,727 INFO L82 PathProgramCache]: Analyzing trace with hash 763340387, now seen corresponding path program 1 times [2019-12-27 15:43:25,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:43:25,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188232180] [2019-12-27 15:43:25,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:43:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:43:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:43:25,851 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:43:25,852 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:43:25,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~z$r_buff0_thd3~0_367) (= v_~z$r_buff0_thd0~0_147 0) (= v_~z$w_buff0_used~0_850 0) (= v_~z$w_buff0~0_393 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_322) (= v_~weak$$choice2~0_147 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t165~0.base_27|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd1~0_158 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t165~0.base_27| 4)) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_168 0) (= v_~z$w_buff1_used~0_568 0) (= v_~main$tmp_guard1~0_41 0) (= |v_ULTIMATE.start_main_~#t165~0.offset_17| 0) (= 0 v_~__unbuffered_p2_EAX~0_41) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_26) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~z$r_buff0_thd1~0_210 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t165~0.base_27| 1)) (= 0 v_~x~0_154) (= v_~z$r_buff0_thd2~0_129 0) (= 0 v_~__unbuffered_cnt~0_88) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t165~0.base_27| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t165~0.base_27|) |v_ULTIMATE.start_main_~#t165~0.offset_17| 0)) |v_#memory_int_19|) (= v_~z~0_181 0) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t165~0.base_27|)) (= v_~y~0_31 0) (= v_~z$r_buff1_thd0~0_191 0) (= v_~z$w_buff1~0_253 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_168, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_61|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_191|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ULTIMATE.start_main_~#t167~0.offset=|v_ULTIMATE.start_main_~#t167~0.offset_17|, ULTIMATE.start_main_~#t166~0.offset=|v_ULTIMATE.start_main_~#t166~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_568, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ULTIMATE.start_main_~#t165~0.base=|v_ULTIMATE.start_main_~#t165~0.base_27|, ~weak$$choice0~0=v_~weak$$choice0~0_13, ULTIMATE.start_main_~#t165~0.offset=|v_ULTIMATE.start_main_~#t165~0.offset_17|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t166~0.base=|v_ULTIMATE.start_main_~#t166~0.base_22|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_158, ~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_367, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~x~0=v_~x~0_154, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_253, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_39|, ~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_43|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_191, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_129, ULTIMATE.start_main_~#t167~0.base=|v_ULTIMATE.start_main_~#t167~0.base_23|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_850, ~z$w_buff0~0=v_~z$w_buff0~0_393, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_322, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t167~0.offset, ULTIMATE.start_main_~#t166~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t165~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t165~0.offset, ULTIMATE.start_main_~#t166~0.base, ~z$r_buff1_thd1~0, ~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, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t167~0.base, ~__unbuffered_p1_EBX~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 15:43:25,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L830-1-->L832: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t166~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t166~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t166~0.base_11|) |v_ULTIMATE.start_main_~#t166~0.offset_9| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t166~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t166~0.base_11|) (= |v_ULTIMATE.start_main_~#t166~0.offset_9| 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t166~0.base_11| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t166~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t166~0.offset=|v_ULTIMATE.start_main_~#t166~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t166~0.base=|v_ULTIMATE.start_main_~#t166~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t166~0.offset, ULTIMATE.start_main_~#t166~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 15:43:25,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_13) (= 1 v_~x~0_6) (= v_~z$r_buff0_thd1~0_21 1) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_31) (= v_~z$r_buff0_thd1~0_22 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_31, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_13, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_21, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~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, ~x~0] because there is no mapped edge [2019-12-27 15:43:25,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In80267309 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In80267309 256)))) (or (and (= ~z$w_buff1~0_In80267309 |P1Thread1of1ForFork2_#t~ite9_Out80267309|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out80267309| ~z~0_In80267309)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In80267309, ~z$w_buff1_used~0=~z$w_buff1_used~0_In80267309, ~z$w_buff1~0=~z$w_buff1~0_In80267309, ~z~0=~z~0_In80267309} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out80267309|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In80267309, ~z$w_buff1_used~0=~z$w_buff1_used~0_In80267309, ~z$w_buff1~0=~z$w_buff1~0_In80267309, ~z~0=~z~0_In80267309} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 15:43:25,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~z~0_27) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_17|, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 15:43:25,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-541807556 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-541807556 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-541807556| ~z$w_buff0_used~0_In-541807556) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-541807556|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-541807556, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-541807556} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-541807556, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-541807556|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-541807556} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 15:43:25,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In863389006 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In863389006 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In863389006 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In863389006 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out863389006| 0)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out863389006| ~z$w_buff1_used~0_In863389006) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In863389006, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In863389006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In863389006, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In863389006} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In863389006, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In863389006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In863389006, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out863389006|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In863389006} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 15:43:25,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t167~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t167~0.base_9| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t167~0.offset_8| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t167~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t167~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t167~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t167~0.base_9|) |v_ULTIMATE.start_main_~#t167~0.offset_8| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t167~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t167~0.offset=|v_ULTIMATE.start_main_~#t167~0.offset_8|, ULTIMATE.start_main_~#t167~0.base=|v_ULTIMATE.start_main_~#t167~0.base_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t167~0.offset, ULTIMATE.start_main_~#t167~0.base] because there is no mapped edge [2019-12-27 15:43:25,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1936152785 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_Out1936152785| ~z$w_buff0~0_In1936152785) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1936152785 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1936152785 256))) (= (mod ~z$w_buff0_used~0_In1936152785 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In1936152785 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite21_Out1936152785| |P2Thread1of1ForFork0_#t~ite20_Out1936152785|)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out1936152785| ~z$w_buff0~0_In1936152785) (= |P2Thread1of1ForFork0_#t~ite20_In1936152785| |P2Thread1of1ForFork0_#t~ite20_Out1936152785|) (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1936152785, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1936152785, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1936152785, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1936152785, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1936152785, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1936152785|, ~weak$$choice2~0=~weak$$choice2~0_In1936152785} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1936152785|, ~z$w_buff0~0=~z$w_buff0~0_In1936152785, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1936152785, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1936152785, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1936152785, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1936152785, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1936152785|, ~weak$$choice2~0=~weak$$choice2~0_In1936152785} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 15:43:25,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1701400437 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1701400437 256)))) (or (and (= ~z$r_buff0_thd2~0_In-1701400437 |P1Thread1of1ForFork2_#t~ite13_Out-1701400437|) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1701400437| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701400437, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1701400437} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701400437, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1701400437|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1701400437} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 15:43:25,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1591357792 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1591357792 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1591357792 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1591357792 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1591357792|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd2~0_In-1591357792 |P1Thread1of1ForFork2_#t~ite14_Out-1591357792|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1591357792, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1591357792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1591357792, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1591357792} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1591357792, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1591357792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1591357792, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1591357792|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1591357792} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 15:43:25,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L775-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P1Thread1of1ForFork2_#t~ite14_32| 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_44, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} 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_43, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, 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 15:43:25,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1126669346 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_Out-1126669346| ~z$w_buff1~0_In-1126669346) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1126669346 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1126669346 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1126669346 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1126669346 256))))) (= |P2Thread1of1ForFork0_#t~ite23_Out-1126669346| |P2Thread1of1ForFork0_#t~ite24_Out-1126669346|)) (and (= |P2Thread1of1ForFork0_#t~ite23_In-1126669346| |P2Thread1of1ForFork0_#t~ite23_Out-1126669346|) (= ~z$w_buff1~0_In-1126669346 |P2Thread1of1ForFork0_#t~ite24_Out-1126669346|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1126669346, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1126669346, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1126669346|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1126669346, ~z$w_buff1~0=~z$w_buff1~0_In-1126669346, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1126669346, ~weak$$choice2~0=~weak$$choice2~0_In-1126669346} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1126669346, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1126669346|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1126669346, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1126669346|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1126669346, ~z$w_buff1~0=~z$w_buff1~0_In-1126669346, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1126669346, ~weak$$choice2~0=~weak$$choice2~0_In-1126669346} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 15:43:25,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L798-->L798-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In115156500 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In115156500 256)))) (or (= (mod ~z$w_buff0_used~0_In115156500 256) 0) (and (= (mod ~z$w_buff1_used~0_In115156500 256) 0) .cse0) (and (= (mod ~z$r_buff1_thd3~0_In115156500 256) 0) .cse0))) (= |P2Thread1of1ForFork0_#t~ite27_Out115156500| |P2Thread1of1ForFork0_#t~ite26_Out115156500|) .cse1 (= ~z$w_buff0_used~0_In115156500 |P2Thread1of1ForFork0_#t~ite26_Out115156500|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In115156500| |P2Thread1of1ForFork0_#t~ite26_Out115156500|) (= ~z$w_buff0_used~0_In115156500 |P2Thread1of1ForFork0_#t~ite27_Out115156500|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In115156500|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In115156500, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In115156500, ~z$w_buff1_used~0=~z$w_buff1_used~0_In115156500, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In115156500, ~weak$$choice2~0=~weak$$choice2~0_In115156500} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out115156500|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out115156500|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In115156500, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In115156500, ~z$w_buff1_used~0=~z$w_buff1_used~0_In115156500, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In115156500, ~weak$$choice2~0=~weak$$choice2~0_In115156500} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 15:43:25,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff0_thd3~0_66)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} 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 15:43:25,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= v_~z~0_50 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 15:43:25,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-487317593 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-487317593 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-487317593 |P0Thread1of1ForFork1_#t~ite5_Out-487317593|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-487317593|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-487317593, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-487317593} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-487317593|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-487317593, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-487317593} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 15:43:25,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-681838669 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-681838669 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-681838669| ~z~0_In-681838669)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-681838669| ~z$w_buff1~0_In-681838669) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-681838669, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-681838669, ~z$w_buff1~0=~z$w_buff1~0_In-681838669, ~z~0=~z~0_In-681838669} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-681838669|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-681838669, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-681838669, ~z$w_buff1~0=~z$w_buff1~0_In-681838669, ~z~0=~z~0_In-681838669} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 15:43:25,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-898522060 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-898522060 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-898522060 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-898522060 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-898522060| ~z$w_buff1_used~0_In-898522060) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-898522060| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-898522060, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-898522060, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-898522060, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-898522060} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-898522060, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-898522060|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-898522060, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-898522060, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-898522060} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 15:43:25,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2049133426 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In2049133426 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out2049133426 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_Out2049133426 ~z$r_buff0_thd1~0_In2049133426)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2049133426, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2049133426} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2049133426, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2049133426|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2049133426} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:43:25,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1413387751 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1413387751 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1413387751 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1413387751 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1413387751| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1413387751| ~z$r_buff1_thd1~0_In-1413387751) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1413387751, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1413387751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1413387751, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1413387751} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1413387751|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1413387751, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1413387751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1413387751, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1413387751} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 15:43:25,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_31|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} 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 15:43:25,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 15:43:25,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1458707467 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1458707467 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1458707467| ~z$w_buff0_used~0_In-1458707467) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1458707467| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458707467, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1458707467} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458707467, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1458707467|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1458707467} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 15:43:25,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In929093135 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In929093135 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In929093135 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In929093135 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out929093135|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out929093135| ~z$w_buff1_used~0_In929093135)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In929093135, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In929093135, ~z$w_buff1_used~0=~z$w_buff1_used~0_In929093135, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In929093135} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In929093135, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In929093135, ~z$w_buff1_used~0=~z$w_buff1_used~0_In929093135, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In929093135, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out929093135|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 15:43:25,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-211845818 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-211845818 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-211845818|) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-211845818| ~z$r_buff0_thd3~0_In-211845818) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-211845818, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-211845818} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-211845818, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-211845818, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-211845818|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 15:43:25,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-453296220 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-453296220 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-453296220 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-453296220 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-453296220| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-453296220 |P2Thread1of1ForFork0_#t~ite43_Out-453296220|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-453296220, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-453296220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-453296220, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-453296220} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-453296220|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-453296220, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-453296220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-453296220, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-453296220} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 15:43:25,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_121 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_121, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, 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 15:43:25,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 15:43:25,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-970890987 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-970890987| |ULTIMATE.start_main_#t~ite47_Out-970890987|)) (.cse0 (= (mod ~z$w_buff1_used~0_In-970890987 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-970890987 |ULTIMATE.start_main_#t~ite47_Out-970890987|)) (and (not .cse1) .cse2 (= ~z$w_buff1~0_In-970890987 |ULTIMATE.start_main_#t~ite47_Out-970890987|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-970890987, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-970890987, ~z$w_buff1~0=~z$w_buff1~0_In-970890987, ~z~0=~z~0_In-970890987} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-970890987, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-970890987|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-970890987, ~z$w_buff1~0=~z$w_buff1~0_In-970890987, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-970890987|, ~z~0=~z~0_In-970890987} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 15:43:25,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1128918884 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1128918884 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out1128918884| ~z$w_buff0_used~0_In1128918884) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1128918884| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1128918884, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1128918884} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1128918884, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1128918884, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1128918884|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 15:43:25,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In485011376 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In485011376 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In485011376 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In485011376 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out485011376| ~z$w_buff1_used~0_In485011376) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out485011376|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In485011376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In485011376, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In485011376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In485011376} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out485011376|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In485011376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In485011376, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In485011376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In485011376} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 15:43:25,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-997197677 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-997197677 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-997197677 |ULTIMATE.start_main_#t~ite51_Out-997197677|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-997197677|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-997197677, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-997197677} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-997197677, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-997197677|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-997197677} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 15:43:25,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1651424587 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1651424587 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1651424587 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1651424587 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1651424587| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-1651424587| ~z$r_buff1_thd0~0_In-1651424587) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1651424587, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1651424587, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1651424587, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1651424587} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1651424587|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1651424587, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1651424587, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1651424587, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1651424587} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 15:43:25,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 2 v_~__unbuffered_p1_EAX~0_22) (= v_~x~0_65 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= v_~z$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~__unbuffered_p1_EBX~0_23 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65, 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 15:43:26,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:43:26 BasicIcfg [2019-12-27 15:43:26,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:43:26,022 INFO L168 Benchmark]: Toolchain (without parser) took 162081.72 ms. Allocated memory was 144.2 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 99.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 15:43:26,022 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 15:43:26,023 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.08 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.6 MB in the beginning and 154.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 15:43:26,023 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.23 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.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 15:43:26,024 INFO L168 Benchmark]: Boogie Preprocessor took 59.26 ms. Allocated memory is still 201.3 MB. Free memory was 151.7 MB in the beginning and 149.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:43:26,024 INFO L168 Benchmark]: RCFGBuilder took 863.09 ms. Allocated memory is still 201.3 MB. Free memory was 149.7 MB in the beginning and 99.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:43:26,025 INFO L168 Benchmark]: TraceAbstraction took 160262.89 ms. Allocated memory was 201.3 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 15:43:26,028 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 816.08 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.6 MB in the beginning and 154.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.23 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.26 ms. Allocated memory is still 201.3 MB. Free memory was 151.7 MB in the beginning and 149.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 863.09 ms. Allocated memory is still 201.3 MB. Free memory was 149.7 MB in the beginning and 99.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 160262.89 ms. Allocated memory was 201.3 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7398 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 270 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 78628 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L832] FCALL, FORK 0 pthread_create(&t166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=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 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, 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] [L771] 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_p1_EAX=2, __unbuffered_p1_EBX=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=2, 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] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, 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] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, 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] 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_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, 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 = !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) [L796] 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)) [L773] 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 [L774] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, 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_buff1=0, z$w_buff1_used=0] [L797] 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)) [L798] 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)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=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_buff1=0, z$w_buff1_used=0] [L799] 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)) [L801] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, 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=2, 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_buff1=0, z$w_buff1_used=0] [L801] 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)) [L802] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, 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_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) [L807] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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 [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 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 [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 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 [L843] 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: 159.9s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 80.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8008 SDtfs, 15026 SDslu, 32812 SDs, 0 SdLazy, 27575 SolverSat, 1294 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 952 GetRequests, 210 SyntacticMatches, 68 SemanticMatches, 674 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21912 ImplicationChecksByTransitivity, 30.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146095occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 884253 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1281 NumberOfCodeBlocks, 1281 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1186 ConstructedInterpolants, 0 QuantifiedInterpolants, 226569 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...