/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/safe004_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:04:34,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:04:34,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:04:34,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:04:34,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:04:34,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:04:34,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:04:34,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:04:34,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:04:34,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:04:34,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:04:34,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:04:34,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:04:34,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:04:34,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:04:34,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:04:34,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:04:34,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:04:34,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:04:34,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:04:34,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:04:34,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:04:34,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:04:34,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:04:34,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:04:34,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:04:34,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:04:34,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:04:34,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:04:34,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:04:34,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:04:34,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:04:34,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:04:34,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:04:34,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:04:34,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:04:34,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:04:34,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:04:34,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:04:34,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:04:34,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:04:34,709 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:04:34,743 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:04:34,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:04:34,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:04:34,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:04:34,745 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:04:34,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:04:34,746 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:04:34,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:04:34,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:04:34,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:04:34,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:04:34,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:04:34,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:04:34,748 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:04:34,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:04:34,749 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:04:34,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:04:34,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:04:34,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:04:34,749 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:04:34,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:04:34,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:04:34,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:04:34,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:04:34,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:04:34,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:04:34,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:04:34,753 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:04:34,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:04:34,756 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:04:34,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:04:35,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:04:35,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:04:35,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:04:35,070 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:04:35,070 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:04:35,072 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i [2019-12-27 18:04:35,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5acf38d5f/f3022cbd787b4cc38fe51cba742dce2e/FLAGd3111deeb [2019-12-27 18:04:35,641 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:04:35,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i [2019-12-27 18:04:35,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5acf38d5f/f3022cbd787b4cc38fe51cba742dce2e/FLAGd3111deeb [2019-12-27 18:04:35,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5acf38d5f/f3022cbd787b4cc38fe51cba742dce2e [2019-12-27 18:04:35,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:04:35,989 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:04:35,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:04:35,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:04:35,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:04:36,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:04:35" (1/1) ... [2019-12-27 18:04:36,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16e70531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:36, skipping insertion in model container [2019-12-27 18:04:36,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:04:35" (1/1) ... [2019-12-27 18:04:36,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:04:36,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:04:36,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:04:36,536 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:04:36,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:04:36,681 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:04:36,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:36 WrapperNode [2019-12-27 18:04:36,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:04:36,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:04:36,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:04:36,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:04:36,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:36" (1/1) ... [2019-12-27 18:04:36,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:36" (1/1) ... [2019-12-27 18:04:36,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:04:36,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:04:36,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:04:36,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:04:36,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:36" (1/1) ... [2019-12-27 18:04:36,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:36" (1/1) ... [2019-12-27 18:04:36,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:36" (1/1) ... [2019-12-27 18:04:36,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:36" (1/1) ... [2019-12-27 18:04:36,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:36" (1/1) ... [2019-12-27 18:04:36,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:36" (1/1) ... [2019-12-27 18:04:36,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:36" (1/1) ... [2019-12-27 18:04:36,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:04:36,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:04:36,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:04:36,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:04:36,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:36" (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 18:04:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:04:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:04:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:04:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:04:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:04:36,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:04:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:04:36,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:04:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:04:36,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:04:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:04:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:04:36,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:04:36,871 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 18:04:37,723 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:04:37,723 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:04:37,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:04:37 BoogieIcfgContainer [2019-12-27 18:04:37,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:04:37,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:04:37,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:04:37,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:04:37,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:04:35" (1/3) ... [2019-12-27 18:04:37,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c54c8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:04:37, skipping insertion in model container [2019-12-27 18:04:37,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:36" (2/3) ... [2019-12-27 18:04:37,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c54c8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:04:37, skipping insertion in model container [2019-12-27 18:04:37,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:04:37" (3/3) ... [2019-12-27 18:04:37,734 INFO L109 eAbstractionObserver]: Analyzing ICFG safe004_pso.opt.i [2019-12-27 18:04:37,745 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:04:37,746 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:04:37,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:04:37,755 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:04:37,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,796 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,796 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,806 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,806 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,807 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,809 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,809 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,834 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,835 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,846 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,846 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,849 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,849 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,850 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,854 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,855 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:04:37,871 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:04:37,892 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:04:37,893 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:04:37,893 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:04:37,893 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:04:37,893 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:04:37,893 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:04:37,893 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:04:37,894 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:04:37,911 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 18:04:37,913 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 18:04:38,021 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 18:04:38,022 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:04:38,042 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:04:38,068 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 18:04:38,124 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 18:04:38,124 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:04:38,131 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:04:38,152 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 18:04:38,153 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:04:43,500 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 18:04:43,623 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 18:04:43,654 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78277 [2019-12-27 18:04:43,654 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 18:04:43,658 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-27 18:04:59,998 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-27 18:05:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-27 18:05:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:05:00,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:05:00,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:05:00,008 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:05:00,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:05:00,017 INFO L82 PathProgramCache]: Analyzing trace with hash 809703812, now seen corresponding path program 1 times [2019-12-27 18:05:00,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:05:00,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991625943] [2019-12-27 18:05:00,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:05:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:05:00,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 18:05:00,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991625943] [2019-12-27 18:05:00,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:05:00,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:05:00,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2122165440] [2019-12-27 18:05:00,281 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:05:00,287 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:05:00,302 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:05:00,302 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:05:00,306 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:05:00,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:05:00,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:05:00,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:05:00,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:05:00,325 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-27 18:05:01,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:05:01,781 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-27 18:05:01,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:05:01,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:05:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:05:02,525 INFO L225 Difference]: With dead ends: 107108 [2019-12-27 18:05:02,525 INFO L226 Difference]: Without dead ends: 104924 [2019-12-27 18:05:02,526 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 18:05:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-27 18:05:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-27 18:05:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-27 18:05:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-27 18:05:14,571 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-27 18:05:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:05:14,571 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-27 18:05:14,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:05:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-27 18:05:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:05:14,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:05:14,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:05:14,578 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:05:14,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:05:14,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2105056515, now seen corresponding path program 1 times [2019-12-27 18:05:14,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:05:14,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295622563] [2019-12-27 18:05:14,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:05:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:05:14,712 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 18:05:14,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295622563] [2019-12-27 18:05:14,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:05:14,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:05:14,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1839154468] [2019-12-27 18:05:14,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:05:14,714 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:05:14,720 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 18:05:14,720 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:05:14,722 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:05:14,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:05:14,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:05:14,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:05:14,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:05:14,724 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-27 18:05:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:05:20,289 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-27 18:05:20,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:05:20,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:05:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:05:20,991 INFO L225 Difference]: With dead ends: 168606 [2019-12-27 18:05:20,991 INFO L226 Difference]: Without dead ends: 168557 [2019-12-27 18:05:20,992 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 18:05:25,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-27 18:05:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-27 18:05:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-27 18:05:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-27 18:05:34,917 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-27 18:05:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:05:34,918 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-27 18:05:34,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:05:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-27 18:05:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:05:34,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:05:34,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:05:34,926 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:05:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:05:34,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2027270657, now seen corresponding path program 1 times [2019-12-27 18:05:34,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:05:34,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597315046] [2019-12-27 18:05:34,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:05:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:05:35,032 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 18:05:35,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597315046] [2019-12-27 18:05:35,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:05:35,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:05:35,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248550410] [2019-12-27 18:05:35,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:05:35,035 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:05:35,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:05:35,037 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:05:35,037 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:05:35,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:05:35,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:05:35,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:05:35,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:05:35,038 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-27 18:05:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:05:42,428 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-27 18:05:42,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:05:42,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:05:42,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:05:43,294 INFO L225 Difference]: With dead ends: 217678 [2019-12-27 18:05:43,294 INFO L226 Difference]: Without dead ends: 217615 [2019-12-27 18:05:43,295 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 18:05:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-27 18:05:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-27 18:05:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-27 18:05:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-27 18:05:53,125 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-27 18:05:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:05:53,127 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-27 18:05:53,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:05:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-27 18:05:53,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:05:53,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:05:53,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:05:53,131 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:05:53,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:05:53,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1789207667, now seen corresponding path program 1 times [2019-12-27 18:05:53,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:05:53,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131452703] [2019-12-27 18:05:53,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:05:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:05:53,224 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 18:05:53,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131452703] [2019-12-27 18:05:53,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:05:53,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:05:53,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [114924921] [2019-12-27 18:05:53,225 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:05:53,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:05:53,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:05:53,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:05:53,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:05:53,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:05:53,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:05:53,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:05:53,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:05:53,230 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-27 18:05:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:05:53,400 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-27 18:05:53,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:05:53,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:05:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:05:53,469 INFO L225 Difference]: With dead ends: 36985 [2019-12-27 18:05:53,469 INFO L226 Difference]: Without dead ends: 36985 [2019-12-27 18:05:53,470 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 18:05:53,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-27 18:05:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-27 18:05:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-27 18:05:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-27 18:05:55,588 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-27 18:05:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:05:55,589 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-27 18:05:55,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:05:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-27 18:05:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:05:55,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:05:55,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:05:55,593 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:05:55,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:05:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1405830784, now seen corresponding path program 1 times [2019-12-27 18:05:55,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:05:55,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599473859] [2019-12-27 18:05:55,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:05:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:05:55,718 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 18:05:55,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599473859] [2019-12-27 18:05:55,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:05:55,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:05:55,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1578350490] [2019-12-27 18:05:55,720 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:05:55,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:05:55,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 77 transitions. [2019-12-27 18:05:55,728 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:05:55,729 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:05:55,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:05:55,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:05:55,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:05:55,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:05:55,730 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 5 states. [2019-12-27 18:05:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:05:56,600 INFO L93 Difference]: Finished difference Result 50257 states and 160609 transitions. [2019-12-27 18:05:56,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:05:56,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:05:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:05:56,680 INFO L225 Difference]: With dead ends: 50257 [2019-12-27 18:05:56,680 INFO L226 Difference]: Without dead ends: 50244 [2019-12-27 18:05:56,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:05:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50244 states. [2019-12-27 18:05:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50244 to 37328. [2019-12-27 18:05:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-27 18:05:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-27 18:05:57,378 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-27 18:05:57,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:05:57,378 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-27 18:05:57,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:05:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-27 18:05:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:05:57,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:05:57,390 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 18:05:57,390 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:05:57,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:05:57,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1721998258, now seen corresponding path program 1 times [2019-12-27 18:05:57,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:05:57,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224476798] [2019-12-27 18:05:57,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:05:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:05:57,477 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 18:05:57,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224476798] [2019-12-27 18:05:57,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:05:57,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:05:57,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1513899902] [2019-12-27 18:05:57,478 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:05:57,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:05:57,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 121 transitions. [2019-12-27 18:05:57,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:05:57,574 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:05:57,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:05:57,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:05:57,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:05:57,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:05:57,575 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 6 states. [2019-12-27 18:05:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:05:57,636 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-27 18:05:57,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:05:57,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 18:05:57,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:05:57,649 INFO L225 Difference]: With dead ends: 7104 [2019-12-27 18:05:57,649 INFO L226 Difference]: Without dead ends: 7104 [2019-12-27 18:05:57,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:05:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-27 18:05:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-27 18:05:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-27 18:05:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-27 18:05:57,790 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-27 18:05:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:05:57,790 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-27 18:05:57,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:05:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-27 18:05:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:05:57,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:05:57,802 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] [2019-12-27 18:05:57,803 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:05:57,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:05:57,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2138974623, now seen corresponding path program 1 times [2019-12-27 18:05:57,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:05:57,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431939746] [2019-12-27 18:05:57,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:05:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:05:57,929 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 18:05:57,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431939746] [2019-12-27 18:05:57,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:05:57,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:05:57,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1980596237] [2019-12-27 18:05:57,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:05:57,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:05:57,972 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 125 transitions. [2019-12-27 18:05:57,972 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:05:57,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:05:57,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:05:57,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:05:57,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:05:57,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:05:57,976 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-27 18:05:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:05:58,016 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-27 18:05:58,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:05:58,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 18:05:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:05:58,025 INFO L225 Difference]: With dead ends: 5024 [2019-12-27 18:05:58,025 INFO L226 Difference]: Without dead ends: 5024 [2019-12-27 18:05:58,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 18:05:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-27 18:05:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-27 18:05:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-27 18:05:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-27 18:05:58,126 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-27 18:05:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:05:58,126 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-27 18:05:58,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:05:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-27 18:05:58,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:05:58,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:05:58,139 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 18:05:58,139 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:05:58,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:05:58,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1030638940, now seen corresponding path program 1 times [2019-12-27 18:05:58,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:05:58,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371440154] [2019-12-27 18:05:58,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:05:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:05:59,229 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 18:05:59,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371440154] [2019-12-27 18:05:59,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:05:59,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:05:59,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1764718431] [2019-12-27 18:05:59,230 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:05:59,255 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:05:59,375 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 285 transitions. [2019-12-27 18:05:59,375 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:05:59,376 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:05:59,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:05:59,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:05:59,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:05:59,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:05:59,377 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-27 18:05:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:05:59,438 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-27 18:05:59,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:05:59,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:05:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:05:59,446 INFO L225 Difference]: With dead ends: 4669 [2019-12-27 18:05:59,446 INFO L226 Difference]: Without dead ends: 4669 [2019-12-27 18:05:59,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:05:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-27 18:05:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-27 18:05:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-27 18:05:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-27 18:05:59,514 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-27 18:05:59,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:05:59,515 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-27 18:05:59,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:05:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-27 18:05:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:05:59,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:05:59,524 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 18:05:59,524 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:05:59,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:05:59,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1902070617, now seen corresponding path program 1 times [2019-12-27 18:05:59,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:05:59,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001899396] [2019-12-27 18:05:59,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:05:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:05:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:05:59,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001899396] [2019-12-27 18:05:59,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:05:59,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:05:59,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2005675953] [2019-12-27 18:05:59,613 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:05:59,638 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:05:59,737 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 285 transitions. [2019-12-27 18:05:59,738 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:05:59,739 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:05:59,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:05:59,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:05:59,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:05:59,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:05:59,740 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-27 18:05:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:05:59,796 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-27 18:05:59,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:05:59,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:05:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:05:59,803 INFO L225 Difference]: With dead ends: 4669 [2019-12-27 18:05:59,803 INFO L226 Difference]: Without dead ends: 4669 [2019-12-27 18:05:59,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:05:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-27 18:05:59,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-27 18:05:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-27 18:05:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-27 18:05:59,863 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-27 18:05:59,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:05:59,863 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-27 18:05:59,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:05:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-27 18:05:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:05:59,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:05:59,870 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 18:05:59,870 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:05:59,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:05:59,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358751, now seen corresponding path program 1 times [2019-12-27 18:05:59,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:05:59,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672524768] [2019-12-27 18:05:59,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:05:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:00,014 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 18:06:00,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672524768] [2019-12-27 18:06:00,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:00,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:06:00,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1720955967] [2019-12-27 18:06:00,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:00,053 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:00,210 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 285 transitions. [2019-12-27 18:06:00,210 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:00,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:06:00,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:06:00,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:00,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:06:00,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:06:00,257 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 5 states. [2019-12-27 18:06:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:00,521 INFO L93 Difference]: Finished difference Result 5701 states and 16213 transitions. [2019-12-27 18:06:00,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:06:00,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 18:06:00,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:00,531 INFO L225 Difference]: With dead ends: 5701 [2019-12-27 18:06:00,531 INFO L226 Difference]: Without dead ends: 5701 [2019-12-27 18:06:00,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:06:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2019-12-27 18:06:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 4665. [2019-12-27 18:06:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-27 18:06:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13233 transitions. [2019-12-27 18:06:00,633 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13233 transitions. Word has length 65 [2019-12-27 18:06:00,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:00,633 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13233 transitions. [2019-12-27 18:06:00,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:06:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13233 transitions. [2019-12-27 18:06:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:06:00,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:00,642 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 18:06:00,642 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:06:00,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:00,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1887448171, now seen corresponding path program 1 times [2019-12-27 18:06:00,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:00,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315915532] [2019-12-27 18:06:00,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:00,766 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 18:06:00,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315915532] [2019-12-27 18:06:00,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:00,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:06:00,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [137666668] [2019-12-27 18:06:00,768 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:00,805 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:00,983 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 323 transitions. [2019-12-27 18:06:00,983 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:00,992 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:06:00,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:06:00,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:00,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:06:00,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:06:00,993 INFO L87 Difference]: Start difference. First operand 4665 states and 13233 transitions. Second operand 5 states. [2019-12-27 18:06:01,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:01,312 INFO L93 Difference]: Finished difference Result 6995 states and 19609 transitions. [2019-12-27 18:06:01,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:06:01,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 18:06:01,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:01,321 INFO L225 Difference]: With dead ends: 6995 [2019-12-27 18:06:01,321 INFO L226 Difference]: Without dead ends: 6995 [2019-12-27 18:06:01,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:06:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6995 states. [2019-12-27 18:06:01,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6995 to 4949. [2019-12-27 18:06:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2019-12-27 18:06:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 14078 transitions. [2019-12-27 18:06:01,399 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 14078 transitions. Word has length 66 [2019-12-27 18:06:01,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:01,399 INFO L462 AbstractCegarLoop]: Abstraction has 4949 states and 14078 transitions. [2019-12-27 18:06:01,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:06:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 14078 transitions. [2019-12-27 18:06:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:06:01,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:01,406 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 18:06:01,406 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:06:01,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:01,406 INFO L82 PathProgramCache]: Analyzing trace with hash 284491425, now seen corresponding path program 2 times [2019-12-27 18:06:01,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:01,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270220177] [2019-12-27 18:06:01,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:01,547 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 18:06:01,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270220177] [2019-12-27 18:06:01,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:01,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:06:01,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [149700319] [2019-12-27 18:06:01,548 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:01,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:01,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 351 transitions. [2019-12-27 18:06:01,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:01,719 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:06:01,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:06:01,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:01,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:06:01,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:06:01,721 INFO L87 Difference]: Start difference. First operand 4949 states and 14078 transitions. Second operand 8 states. [2019-12-27 18:06:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:02,179 INFO L93 Difference]: Finished difference Result 17008 states and 48675 transitions. [2019-12-27 18:06:02,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 18:06:02,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 18:06:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:02,196 INFO L225 Difference]: With dead ends: 17008 [2019-12-27 18:06:02,197 INFO L226 Difference]: Without dead ends: 10213 [2019-12-27 18:06:02,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:06:02,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10213 states. [2019-12-27 18:06:02,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10213 to 4949. [2019-12-27 18:06:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2019-12-27 18:06:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 14013 transitions. [2019-12-27 18:06:02,350 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 14013 transitions. Word has length 66 [2019-12-27 18:06:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:02,350 INFO L462 AbstractCegarLoop]: Abstraction has 4949 states and 14013 transitions. [2019-12-27 18:06:02,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:06:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 14013 transitions. [2019-12-27 18:06:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:06:02,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:02,362 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 18:06:02,362 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:06:02,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:02,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1438113561, now seen corresponding path program 3 times [2019-12-27 18:06:02,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:02,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207499505] [2019-12-27 18:06:02,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:02,499 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 18:06:02,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207499505] [2019-12-27 18:06:02,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:02,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:06:02,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1920210395] [2019-12-27 18:06:02,500 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:02,518 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:02,696 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 351 transitions. [2019-12-27 18:06:02,696 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:02,720 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:06:02,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:06:02,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:02,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:06:02,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:06:02,721 INFO L87 Difference]: Start difference. First operand 4949 states and 14013 transitions. Second operand 6 states. [2019-12-27 18:06:02,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:02,854 INFO L93 Difference]: Finished difference Result 7888 states and 22327 transitions. [2019-12-27 18:06:02,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:06:02,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 18:06:02,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:02,860 INFO L225 Difference]: With dead ends: 7888 [2019-12-27 18:06:02,860 INFO L226 Difference]: Without dead ends: 3291 [2019-12-27 18:06:02,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:06:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3291 states. [2019-12-27 18:06:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3291 to 3291. [2019-12-27 18:06:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3291 states. [2019-12-27 18:06:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 9256 transitions. [2019-12-27 18:06:02,925 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 9256 transitions. Word has length 66 [2019-12-27 18:06:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:02,926 INFO L462 AbstractCegarLoop]: Abstraction has 3291 states and 9256 transitions. [2019-12-27 18:06:02,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:06:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 9256 transitions. [2019-12-27 18:06:02,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:06:02,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:02,932 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 18:06:02,933 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:06:02,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:02,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1143981577, now seen corresponding path program 4 times [2019-12-27 18:06:02,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:02,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867895010] [2019-12-27 18:06:02,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:06:03,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867895010] [2019-12-27 18:06:03,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:03,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:06:03,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305221594] [2019-12-27 18:06:03,013 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:03,032 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:03,150 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 245 transitions. [2019-12-27 18:06:03,150 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:03,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 18:06:03,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:06:03,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:03,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:06:03,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:06:03,206 INFO L87 Difference]: Start difference. First operand 3291 states and 9256 transitions. Second operand 5 states. [2019-12-27 18:06:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:03,484 INFO L93 Difference]: Finished difference Result 5304 states and 14818 transitions. [2019-12-27 18:06:03,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:06:03,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 18:06:03,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:03,493 INFO L225 Difference]: With dead ends: 5304 [2019-12-27 18:06:03,493 INFO L226 Difference]: Without dead ends: 5304 [2019-12-27 18:06:03,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 10 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:06:03,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5304 states. [2019-12-27 18:06:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5304 to 4059. [2019-12-27 18:06:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4059 states. [2019-12-27 18:06:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 11457 transitions. [2019-12-27 18:06:03,554 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 11457 transitions. Word has length 66 [2019-12-27 18:06:03,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:03,555 INFO L462 AbstractCegarLoop]: Abstraction has 4059 states and 11457 transitions. [2019-12-27 18:06:03,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:06:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 11457 transitions. [2019-12-27 18:06:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:06:03,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:03,560 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 18:06:03,560 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:06:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:03,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1403493355, now seen corresponding path program 5 times [2019-12-27 18:06:03,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:03,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557494850] [2019-12-27 18:06:03,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:03,622 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 18:06:03,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557494850] [2019-12-27 18:06:03,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:03,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:06:03,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1571809392] [2019-12-27 18:06:03,623 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:03,641 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:03,761 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 244 transitions. [2019-12-27 18:06:03,761 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:03,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:06:03,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:06:03,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:03,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:06:03,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:06:03,763 INFO L87 Difference]: Start difference. First operand 4059 states and 11457 transitions. Second operand 3 states. [2019-12-27 18:06:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:03,783 INFO L93 Difference]: Finished difference Result 3446 states and 9499 transitions. [2019-12-27 18:06:03,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:06:03,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 18:06:03,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:03,788 INFO L225 Difference]: With dead ends: 3446 [2019-12-27 18:06:03,788 INFO L226 Difference]: Without dead ends: 3446 [2019-12-27 18:06:03,788 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 18:06:03,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2019-12-27 18:06:03,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3350. [2019-12-27 18:06:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3350 states. [2019-12-27 18:06:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 9251 transitions. [2019-12-27 18:06:03,849 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 9251 transitions. Word has length 66 [2019-12-27 18:06:03,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:03,849 INFO L462 AbstractCegarLoop]: Abstraction has 3350 states and 9251 transitions. [2019-12-27 18:06:03,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:06:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 9251 transitions. [2019-12-27 18:06:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:06:03,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:03,856 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 18:06:03,856 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:06:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:03,856 INFO L82 PathProgramCache]: Analyzing trace with hash -378425991, now seen corresponding path program 1 times [2019-12-27 18:06:03,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:03,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316186812] [2019-12-27 18:06:03,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:04,079 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 18:06:04,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316186812] [2019-12-27 18:06:04,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:04,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:06:04,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1815423745] [2019-12-27 18:06:04,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:04,102 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:04,222 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 250 transitions. [2019-12-27 18:06:04,223 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:04,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:06:04,472 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 18:06:04,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:06:04,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:04,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:06:04,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:06:04,473 INFO L87 Difference]: Start difference. First operand 3350 states and 9251 transitions. Second operand 12 states. [2019-12-27 18:06:05,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:05,683 INFO L93 Difference]: Finished difference Result 6326 states and 17015 transitions. [2019-12-27 18:06:05,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 18:06:05,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 18:06:05,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:05,691 INFO L225 Difference]: With dead ends: 6326 [2019-12-27 18:06:05,692 INFO L226 Difference]: Without dead ends: 6326 [2019-12-27 18:06:05,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:06:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2019-12-27 18:06:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 3285. [2019-12-27 18:06:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3285 states. [2019-12-27 18:06:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 8960 transitions. [2019-12-27 18:06:05,786 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 8960 transitions. Word has length 67 [2019-12-27 18:06:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:05,786 INFO L462 AbstractCegarLoop]: Abstraction has 3285 states and 8960 transitions. [2019-12-27 18:06:05,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:06:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 8960 transitions. [2019-12-27 18:06:05,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:06:05,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:05,792 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 18:06:05,793 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:06:05,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:05,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2109267181, now seen corresponding path program 2 times [2019-12-27 18:06:05,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:05,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751479201] [2019-12-27 18:06:05,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:05,952 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 18:06:05,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751479201] [2019-12-27 18:06:05,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:05,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:06:05,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1993955649] [2019-12-27 18:06:05,953 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:05,972 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:06,092 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 239 transitions. [2019-12-27 18:06:06,093 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:06,093 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:06:06,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:06:06,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:06,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:06:06,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:06:06,094 INFO L87 Difference]: Start difference. First operand 3285 states and 8960 transitions. Second operand 7 states. [2019-12-27 18:06:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:06,193 INFO L93 Difference]: Finished difference Result 6138 states and 16824 transitions. [2019-12-27 18:06:06,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:06:06,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 18:06:06,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:06,198 INFO L225 Difference]: With dead ends: 6138 [2019-12-27 18:06:06,198 INFO L226 Difference]: Without dead ends: 2894 [2019-12-27 18:06:06,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:06:06,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2019-12-27 18:06:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2444. [2019-12-27 18:06:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2444 states. [2019-12-27 18:06:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 6646 transitions. [2019-12-27 18:06:06,252 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 6646 transitions. Word has length 67 [2019-12-27 18:06:06,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:06,253 INFO L462 AbstractCegarLoop]: Abstraction has 2444 states and 6646 transitions. [2019-12-27 18:06:06,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:06:06,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 6646 transitions. [2019-12-27 18:06:06,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:06:06,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:06,258 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 18:06:06,258 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:06:06,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:06,258 INFO L82 PathProgramCache]: Analyzing trace with hash 905212147, now seen corresponding path program 3 times [2019-12-27 18:06:06,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:06,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754847305] [2019-12-27 18:06:06,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:06,429 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 18:06:06,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754847305] [2019-12-27 18:06:06,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:06,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:06:06,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1389408055] [2019-12-27 18:06:06,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:06,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:06,614 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 343 transitions. [2019-12-27 18:06:06,614 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:06,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:06:06,847 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 18:06:06,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:06:06,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:06,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:06:06,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:06:06,848 INFO L87 Difference]: Start difference. First operand 2444 states and 6646 transitions. Second operand 13 states. [2019-12-27 18:06:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:08,550 INFO L93 Difference]: Finished difference Result 6132 states and 16481 transitions. [2019-12-27 18:06:08,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 18:06:08,550 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 18:06:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:08,559 INFO L225 Difference]: With dead ends: 6132 [2019-12-27 18:06:08,559 INFO L226 Difference]: Without dead ends: 6132 [2019-12-27 18:06:08,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 18:06:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states. [2019-12-27 18:06:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 2367. [2019-12-27 18:06:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2019-12-27 18:06:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 6419 transitions. [2019-12-27 18:06:08,617 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 6419 transitions. Word has length 67 [2019-12-27 18:06:08,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:08,618 INFO L462 AbstractCegarLoop]: Abstraction has 2367 states and 6419 transitions. [2019-12-27 18:06:08,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:06:08,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 6419 transitions. [2019-12-27 18:06:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:06:08,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:08,621 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 18:06:08,621 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:06:08,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:08,621 INFO L82 PathProgramCache]: Analyzing trace with hash -902061977, now seen corresponding path program 4 times [2019-12-27 18:06:08,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:08,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945854115] [2019-12-27 18:06:08,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:06:08,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945854115] [2019-12-27 18:06:08,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:08,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:06:08,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1274362533] [2019-12-27 18:06:08,690 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:08,732 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:08,902 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 357 transitions. [2019-12-27 18:06:08,902 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:08,903 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:06:08,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:06:08,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:08,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:06:08,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:06:08,904 INFO L87 Difference]: Start difference. First operand 2367 states and 6419 transitions. Second operand 3 states. [2019-12-27 18:06:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:08,949 INFO L93 Difference]: Finished difference Result 2367 states and 6418 transitions. [2019-12-27 18:06:08,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:06:08,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 18:06:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:08,952 INFO L225 Difference]: With dead ends: 2367 [2019-12-27 18:06:08,953 INFO L226 Difference]: Without dead ends: 2367 [2019-12-27 18:06:08,953 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 18:06:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-12-27 18:06:08,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1750. [2019-12-27 18:06:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-12-27 18:06:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 4733 transitions. [2019-12-27 18:06:08,985 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 4733 transitions. Word has length 67 [2019-12-27 18:06:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:08,985 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 4733 transitions. [2019-12-27 18:06:08,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:06:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 4733 transitions. [2019-12-27 18:06:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:06:08,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:08,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:08,989 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:06:08,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:08,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1259160564, now seen corresponding path program 1 times [2019-12-27 18:06:08,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:08,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091181564] [2019-12-27 18:06:08,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:06:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:06:09,120 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:06:09,120 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:06:09,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1882~0.base_20| 4) |v_#length_25|) (= 0 v_~x~0_194) (= 0 v_~x$r_buff0_thd2~0_213) (= 0 v_~weak$$choice0~0_14) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$w_buff0~0_268) (= (store .cse0 |v_ULTIMATE.start_main_~#t1882~0.base_20| 1) |v_#valid_53|) (= |v_ULTIMATE.start_main_~#t1882~0.offset_17| 0) (= 0 v_~x$r_buff1_thd2~0_212) (= v_~x$r_buff1_thd0~0_297 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1882~0.base_20|) 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_187 0) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~x$r_buff0_thd0~0_372 0) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_155 0) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_4|) (= 0 v_~x$r_buff1_thd3~0_195) (= 0 v_~x$r_buff0_thd3~0_123) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1882~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1882~0.base_20|) |v_ULTIMATE.start_main_~#t1882~0.offset_17| 0)) |v_#memory_int_21|) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff1_used~0_504) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~__unbuffered_p2_EAX~0_22) (= v_~x$flush_delayed~0_34 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_110 0) (= v_~y~0_136 0) (= 0 v_~x$w_buff0_used~0_807) (= v_~main$tmp_guard1~0_22 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1882~0.base_20|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_268, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_34, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_45|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_123, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_50|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ULTIMATE.start_main_~#t1883~0.offset=|v_ULTIMATE.start_main_~#t1883~0.offset_17|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_37|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~x~0=v_~x~0_194, ULTIMATE.start_main_~#t1882~0.base=|v_ULTIMATE.start_main_~#t1882~0.base_20|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_195, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_125|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_~#t1884~0.offset=|v_ULTIMATE.start_main_~#t1884~0.offset_16|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y~0=v_~y~0_136, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_48|, ULTIMATE.start_main_~#t1883~0.base=|v_ULTIMATE.start_main_~#t1883~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t1882~0.offset=|v_ULTIMATE.start_main_~#t1882~0.offset_17|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1884~0.base=|v_ULTIMATE.start_main_~#t1884~0.base_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t1883~0.offset, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1882~0.base, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1884~0.offset, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1883~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1882~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1884~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:06:09,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L805-1-->L807: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1883~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1883~0.base_11|) (= |v_ULTIMATE.start_main_~#t1883~0.offset_10| 0) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1883~0.base_11|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1883~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1883~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1883~0.base_11|) |v_ULTIMATE.start_main_~#t1883~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1883~0.base_11| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1883~0.offset=|v_ULTIMATE.start_main_~#t1883~0.offset_10|, ULTIMATE.start_main_~#t1883~0.base=|v_ULTIMATE.start_main_~#t1883~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t1883~0.offset, ULTIMATE.start_main_~#t1883~0.base, #length] because there is no mapped edge [2019-12-27 18:06:09,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1884~0.base_9|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1884~0.base_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1884~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1884~0.base_9|) |v_ULTIMATE.start_main_~#t1884~0.offset_8| 2))) (= 0 |v_ULTIMATE.start_main_~#t1884~0.offset_8|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1884~0.base_9| 1) |v_#valid_27|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1884~0.base_9|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1884~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|, ULTIMATE.start_main_~#t1884~0.base=|v_ULTIMATE.start_main_~#t1884~0.base_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1884~0.offset=|v_ULTIMATE.start_main_~#t1884~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1884~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1884~0.offset] because there is no mapped edge [2019-12-27 18:06:09,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= 2 v_~x$w_buff0~0_31) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256)) (= v_~x$w_buff0~0_32 v_~x$w_buff1~0_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 18:06:09,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-843365686 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-843365686 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-843365686| ~x$w_buff1~0_In-843365686) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-843365686| ~x~0_In-843365686)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-843365686, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-843365686, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-843365686, ~x~0=~x~0_In-843365686} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-843365686|, ~x$w_buff1~0=~x$w_buff1~0_In-843365686, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-843365686, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-843365686, ~x~0=~x~0_In-843365686} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 18:06:09,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= v_~x~0_20 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 18:06:09,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In75250086 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In75250086 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out75250086| ~x$w_buff0_used~0_In75250086)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out75250086| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In75250086, ~x$w_buff0_used~0=~x$w_buff0_used~0_In75250086} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In75250086, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out75250086|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In75250086} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:06:09,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd3~0_In-1129979211 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1129979211 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1129979211 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1129979211 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1129979211|)) (and (= ~x$w_buff1_used~0_In-1129979211 |P2Thread1of1ForFork2_#t~ite18_Out-1129979211|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1129979211, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1129979211, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1129979211, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1129979211} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1129979211, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1129979211, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1129979211, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1129979211|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1129979211} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 18:06:09,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In1245758950 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1245758950 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out1245758950| |P0Thread1of1ForFork0_#t~ite4_Out1245758950|))) (or (and (= ~x$w_buff1~0_In1245758950 |P0Thread1of1ForFork0_#t~ite3_Out1245758950|) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) .cse2 (= ~x~0_In1245758950 |P0Thread1of1ForFork0_#t~ite3_Out1245758950|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1245758950, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1245758950, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1245758950, ~x~0=~x~0_In1245758950} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1245758950|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1245758950|, ~x$w_buff1~0=~x$w_buff1~0_In1245758950, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1245758950, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1245758950, ~x~0=~x~0_In1245758950} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 18:06:09,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-347779660 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-347779660 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-347779660 |P0Thread1of1ForFork0_#t~ite5_Out-347779660|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-347779660|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-347779660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-347779660} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-347779660|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-347779660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-347779660} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:06:09,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In214865555 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In214865555 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In214865555 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In214865555 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out214865555| ~x$w_buff1_used~0_In214865555)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out214865555| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In214865555, ~x$w_buff1_used~0=~x$w_buff1_used~0_In214865555, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In214865555, ~x$w_buff0_used~0=~x$w_buff0_used~0_In214865555} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out214865555|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In214865555, ~x$w_buff1_used~0=~x$w_buff1_used~0_In214865555, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In214865555, ~x$w_buff0_used~0=~x$w_buff0_used~0_In214865555} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:06:09,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In2068083041 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2068083041 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out2068083041| ~x$r_buff0_thd3~0_In2068083041) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out2068083041| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2068083041, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2068083041} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2068083041, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out2068083041|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2068083041} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 18:06:09,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1616234943 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1616234943 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1616234943 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-1616234943 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-1616234943|)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1616234943| ~x$r_buff1_thd3~0_In-1616234943) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1616234943, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1616234943, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1616234943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1616234943} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1616234943|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1616234943, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1616234943, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1616234943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1616234943} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 18:06:09,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P2Thread1of1ForFork2_#t~ite20_54| v_~x$r_buff1_thd3~0_147)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_53|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 18:06:09,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-946781317 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-946781317 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out-946781317| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_In-946781317 |P0Thread1of1ForFork0_#t~ite7_Out-946781317|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-946781317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-946781317} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-946781317, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-946781317|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-946781317} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 18:06:09,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1053828755 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In1053828755 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1053828755 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1053828755 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1053828755| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out1053828755| ~x$r_buff1_thd1~0_In1053828755) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1053828755, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1053828755, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1053828755, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1053828755} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1053828755, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1053828755|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1053828755, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1053828755, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1053828755} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:06:09,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_61 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_61} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 18:06:09,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1986650139 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1986650139 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1986650139| ~x$w_buff0_used~0_In-1986650139) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1986650139|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1986650139, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1986650139} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1986650139|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1986650139, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1986650139} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:06:09,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In356452102 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In356452102 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In356452102 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In356452102 256) 0))) (or (and (= ~x$w_buff1_used~0_In356452102 |P1Thread1of1ForFork1_#t~ite12_Out356452102|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out356452102|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In356452102, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In356452102, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In356452102, ~x$w_buff0_used~0=~x$w_buff0_used~0_In356452102} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In356452102, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In356452102, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out356452102|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In356452102, ~x$w_buff0_used~0=~x$w_buff0_used~0_In356452102} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:06:09,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-766224024 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-766224024 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-766224024) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In-766224024 ~x$r_buff0_thd2~0_Out-766224024)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-766224024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-766224024} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-766224024|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-766224024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-766224024} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:06:09,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-673235583 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-673235583 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-673235583 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-673235583 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-673235583| ~x$r_buff1_thd2~0_In-673235583) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-673235583|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-673235583, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-673235583, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-673235583, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-673235583} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-673235583, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-673235583, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-673235583, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-673235583|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-673235583} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:06:09,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_162 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_162, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:06:09,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:06:09,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In469449206 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite24_Out469449206| |ULTIMATE.start_main_#t~ite25_Out469449206|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In469449206 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out469449206| ~x~0_In469449206) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite24_Out469449206| ~x$w_buff1~0_In469449206)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In469449206, ~x$w_buff1_used~0=~x$w_buff1_used~0_In469449206, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In469449206, ~x~0=~x~0_In469449206} OutVars{~x$w_buff1~0=~x$w_buff1~0_In469449206, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out469449206|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out469449206|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In469449206, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In469449206, ~x~0=~x~0_In469449206} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 18:06:09,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1150271715 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1150271715 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out1150271715| 0)) (and (= ~x$w_buff0_used~0_In1150271715 |ULTIMATE.start_main_#t~ite26_Out1150271715|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1150271715, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1150271715} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1150271715, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1150271715|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1150271715} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 18:06:09,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1535325244 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1535325244 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1535325244 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1535325244 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1535325244 |ULTIMATE.start_main_#t~ite27_Out1535325244|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out1535325244|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1535325244, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1535325244, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1535325244, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1535325244} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1535325244, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1535325244, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1535325244|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1535325244, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1535325244} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 18:06:09,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In433061631 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In433061631 256)))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out433061631| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In433061631 |ULTIMATE.start_main_#t~ite28_Out433061631|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In433061631, ~x$w_buff0_used~0=~x$w_buff0_used~0_In433061631} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In433061631, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out433061631|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In433061631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 18:06:09,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In334485694 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In334485694 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In334485694 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In334485694 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite29_Out334485694|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In334485694 |ULTIMATE.start_main_#t~ite29_Out334485694|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In334485694, ~x$w_buff1_used~0=~x$w_buff1_used~0_In334485694, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In334485694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In334485694} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In334485694, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out334485694|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In334485694, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In334485694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In334485694} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 18:06:09,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_112 v_~x$r_buff0_thd0~0_111) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 18:06:09,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$mem_tmp~0_13 v_~x~0_153) (= v_~x$flush_delayed~0_22 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~x~0=v_~x~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:06:09,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:06:09,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:06:09 BasicIcfg [2019-12-27 18:06:09,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:06:09,272 INFO L168 Benchmark]: Toolchain (without parser) took 93283.65 ms. Allocated memory was 138.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 100.0 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 556.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:06:09,272 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 18:06:09,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.04 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 155.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:06:09,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.62 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 152.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:06:09,275 INFO L168 Benchmark]: Boogie Preprocessor took 44.54 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:06:09,276 INFO L168 Benchmark]: RCFGBuilder took 926.00 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 100.4 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:06:09,278 INFO L168 Benchmark]: TraceAbstraction took 91543.24 ms. Allocated memory was 202.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 100.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 492.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:06:09,284 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 692.04 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 155.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.62 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 152.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.54 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 926.00 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 100.4 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 91543.24 ms. Allocated memory was 202.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 100.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 492.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 6159 VarBasedMoverChecksPositive, 253 VarBasedMoverChecksNegative, 78 SemBasedMoverChecksPositive, 250 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 78277 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1882, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] FCALL, FORK 0 pthread_create(&t1883, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] FCALL, FORK 0 pthread_create(&t1884, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 91.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2819 SDtfs, 2592 SDslu, 5743 SDs, 0 SdLazy, 3537 SolverSat, 181 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 92 SyntacticMatches, 39 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 81224 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 897 ConstructedInterpolants, 0 QuantifiedInterpolants, 163657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...