/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:44:38,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:44:38,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:44:38,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:44:38,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:44:38,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:44:38,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:44:38,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:44:38,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:44:38,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:44:38,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:44:38,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:44:38,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:44:38,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:44:38,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:44:38,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:44:38,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:44:38,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:44:38,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:44:38,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:44:38,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:44:38,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:44:38,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:44:38,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:44:38,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:44:38,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:44:38,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:44:38,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:44:38,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:44:38,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:44:38,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:44:38,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:44:38,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:44:38,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:44:38,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:44:38,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:44:38,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:44:38,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:44:38,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:44:38,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:44:38,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:44:38,714 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-VariableLbe-MCR.epf [2019-12-27 22:44:38,747 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:44:38,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:44:38,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:44:38,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:44:38,752 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:44:38,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:44:38,753 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:44:38,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:44:38,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:44:38,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:44:38,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:44:38,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:44:38,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:44:38,755 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:44:38,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:44:38,755 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:44:38,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:44:38,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:44:38,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:44:38,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:44:38,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:44:38,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:44:38,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:44:38,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:44:38,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:44:38,758 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:44:38,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:44:38,758 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:44:38,758 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:44:38,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:44:38,758 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:44:38,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:44:39,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:44:39,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:44:39,088 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:44:39,090 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:44:39,092 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:44:39,092 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i [2019-12-27 22:44:39,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d26c1065/fd20fa358a974e508510508b0a7d7e2b/FLAG803004eee [2019-12-27 22:44:39,704 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:44:39,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i [2019-12-27 22:44:39,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d26c1065/fd20fa358a974e508510508b0a7d7e2b/FLAG803004eee [2019-12-27 22:44:39,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d26c1065/fd20fa358a974e508510508b0a7d7e2b [2019-12-27 22:44:39,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:44:39,986 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:44:39,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:44:39,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:44:39,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:44:39,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:44:39" (1/1) ... [2019-12-27 22:44:39,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:44:39, skipping insertion in model container [2019-12-27 22:44:39,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:44:39" (1/1) ... [2019-12-27 22:44:40,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:44:40,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:44:40,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:44:40,656 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:44:40,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:44:40,819 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:44:40,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:44:40 WrapperNode [2019-12-27 22:44:40,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:44:40,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:44:40,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:44:40,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:44:40,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:44:40" (1/1) ... [2019-12-27 22:44:40,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:44:40" (1/1) ... [2019-12-27 22:44:40,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:44:40,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:44:40,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:44:40,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:44:40,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:44:40" (1/1) ... [2019-12-27 22:44:40,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:44:40" (1/1) ... [2019-12-27 22:44:40,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:44:40" (1/1) ... [2019-12-27 22:44:40,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:44:40" (1/1) ... [2019-12-27 22:44:40,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:44:40" (1/1) ... [2019-12-27 22:44:40,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:44:40" (1/1) ... [2019-12-27 22:44:40,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:44:40" (1/1) ... [2019-12-27 22:44:40,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:44:40,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:44:40,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:44:40,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:44:40,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:44:40" (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 22:44:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:44:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:44:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:44:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:44:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:44:40,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:44:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:44:40,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:44:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:44:41,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:44:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:44:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:44:41,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:44:41,002 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 22:44:41,801 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:44:41,801 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:44:41,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:44:41 BoogieIcfgContainer [2019-12-27 22:44:41,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:44:41,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:44:41,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:44:41,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:44:41,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:44:39" (1/3) ... [2019-12-27 22:44:41,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7b2aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:44:41, skipping insertion in model container [2019-12-27 22:44:41,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:44:40" (2/3) ... [2019-12-27 22:44:41,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7b2aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:44:41, skipping insertion in model container [2019-12-27 22:44:41,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:44:41" (3/3) ... [2019-12-27 22:44:41,816 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_power.opt.i [2019-12-27 22:44:41,826 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:44:41,826 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:44:41,836 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:44:41,837 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:44:41,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,877 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,878 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,902 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,902 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,902 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,903 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,903 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,910 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,911 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,941 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,948 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,948 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,957 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:44:41,981 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:44:42,001 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:44:42,002 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:44:42,002 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:44:42,002 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:44:42,002 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:44:42,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:44:42,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:44:42,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:44:42,019 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 22:44:42,021 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 22:44:42,118 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 22:44:42,119 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:44:42,134 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:44:42,157 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 22:44:42,207 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 22:44:42,208 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:44:42,215 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:44:42,234 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:44:42,235 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:44:45,930 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 22:44:46,082 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 22:44:46,112 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75034 [2019-12-27 22:44:46,113 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 22:44:46,116 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 87 transitions [2019-12-27 22:44:57,789 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85916 states. [2019-12-27 22:44:57,791 INFO L276 IsEmpty]: Start isEmpty. Operand 85916 states. [2019-12-27 22:44:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:44:57,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:57,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:44:57,798 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:44:57,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:57,804 INFO L82 PathProgramCache]: Analyzing trace with hash 797474655, now seen corresponding path program 1 times [2019-12-27 22:44:57,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:57,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303093189] [2019-12-27 22:44:57,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:58,122 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 22:44:58,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303093189] [2019-12-27 22:44:58,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:58,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:44:58,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [57961153] [2019-12-27 22:44:58,128 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:58,133 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:58,148 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:44:58,149 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:58,153 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:44:58,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:44:58,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:58,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:44:58,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:44:58,172 INFO L87 Difference]: Start difference. First operand 85916 states. Second operand 3 states. [2019-12-27 22:45:01,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:01,041 INFO L93 Difference]: Finished difference Result 84652 states and 359098 transitions. [2019-12-27 22:45:01,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:45:01,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:45:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:01,799 INFO L225 Difference]: With dead ends: 84652 [2019-12-27 22:45:01,799 INFO L226 Difference]: Without dead ends: 79738 [2019-12-27 22:45:01,801 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 22:45:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79738 states. [2019-12-27 22:45:08,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79738 to 79738. [2019-12-27 22:45:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79738 states. [2019-12-27 22:45:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79738 states to 79738 states and 337790 transitions. [2019-12-27 22:45:12,005 INFO L78 Accepts]: Start accepts. Automaton has 79738 states and 337790 transitions. Word has length 5 [2019-12-27 22:45:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:12,005 INFO L462 AbstractCegarLoop]: Abstraction has 79738 states and 337790 transitions. [2019-12-27 22:45:12,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:45:12,005 INFO L276 IsEmpty]: Start isEmpty. Operand 79738 states and 337790 transitions. [2019-12-27 22:45:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:45:12,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:12,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:45:12,020 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash 334215787, now seen corresponding path program 1 times [2019-12-27 22:45:12,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:12,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649506596] [2019-12-27 22:45:12,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:12,152 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 22:45:12,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649506596] [2019-12-27 22:45:12,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:12,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:45:12,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1692169192] [2019-12-27 22:45:12,155 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:12,156 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:12,161 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:45:12,161 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:12,161 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:45:12,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:45:12,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:12,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:45:12,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:45:12,164 INFO L87 Difference]: Start difference. First operand 79738 states and 337790 transitions. Second operand 4 states. [2019-12-27 22:45:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:13,808 INFO L93 Difference]: Finished difference Result 122590 states and 499694 transitions. [2019-12-27 22:45:13,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:45:13,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:45:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:14,224 INFO L225 Difference]: With dead ends: 122590 [2019-12-27 22:45:14,224 INFO L226 Difference]: Without dead ends: 122513 [2019-12-27 22:45:14,225 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 22:45:20,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122513 states. [2019-12-27 22:45:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122513 to 111273. [2019-12-27 22:45:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111273 states. [2019-12-27 22:45:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111273 states to 111273 states and 458752 transitions. [2019-12-27 22:45:23,868 INFO L78 Accepts]: Start accepts. Automaton has 111273 states and 458752 transitions. Word has length 13 [2019-12-27 22:45:23,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:23,869 INFO L462 AbstractCegarLoop]: Abstraction has 111273 states and 458752 transitions. [2019-12-27 22:45:23,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:45:23,870 INFO L276 IsEmpty]: Start isEmpty. Operand 111273 states and 458752 transitions. [2019-12-27 22:45:23,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:45:23,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:23,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:45:23,873 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:23,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:23,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985611, now seen corresponding path program 1 times [2019-12-27 22:45:23,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:23,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467018835] [2019-12-27 22:45:23,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:23,917 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 22:45:23,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467018835] [2019-12-27 22:45:23,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:23,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:45:23,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [744831066] [2019-12-27 22:45:23,920 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:23,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:23,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:45:23,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:23,923 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:45:23,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:45:23,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:23,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:45:23,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:45:23,924 INFO L87 Difference]: Start difference. First operand 111273 states and 458752 transitions. Second operand 3 states. [2019-12-27 22:45:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:24,048 INFO L93 Difference]: Finished difference Result 27590 states and 92015 transitions. [2019-12-27 22:45:24,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:45:24,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:45:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:24,107 INFO L225 Difference]: With dead ends: 27590 [2019-12-27 22:45:24,107 INFO L226 Difference]: Without dead ends: 27590 [2019-12-27 22:45:24,107 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 22:45:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27590 states. [2019-12-27 22:45:28,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27590 to 27590. [2019-12-27 22:45:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 22:45:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 92015 transitions. [2019-12-27 22:45:28,291 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 92015 transitions. Word has length 13 [2019-12-27 22:45:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:28,291 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 92015 transitions. [2019-12-27 22:45:28,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:45:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 92015 transitions. [2019-12-27 22:45:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:45:28,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:28,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:45:28,294 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:28,295 INFO L82 PathProgramCache]: Analyzing trace with hash -569288949, now seen corresponding path program 1 times [2019-12-27 22:45:28,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:28,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193362809] [2019-12-27 22:45:28,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:28,381 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 22:45:28,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193362809] [2019-12-27 22:45:28,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:28,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:45:28,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1099826309] [2019-12-27 22:45:28,382 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:28,387 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:28,393 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:45:28,393 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:28,394 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:45:28,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:45:28,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:28,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:45:28,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:45:28,395 INFO L87 Difference]: Start difference. First operand 27590 states and 92015 transitions. Second operand 5 states. [2019-12-27 22:45:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:28,883 INFO L93 Difference]: Finished difference Result 40899 states and 133989 transitions. [2019-12-27 22:45:28,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:45:28,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:45:28,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:28,954 INFO L225 Difference]: With dead ends: 40899 [2019-12-27 22:45:28,955 INFO L226 Difference]: Without dead ends: 40883 [2019-12-27 22:45:28,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:45:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40883 states. [2019-12-27 22:45:29,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40883 to 30763. [2019-12-27 22:45:29,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30763 states. [2019-12-27 22:45:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30763 states to 30763 states and 102099 transitions. [2019-12-27 22:45:29,969 INFO L78 Accepts]: Start accepts. Automaton has 30763 states and 102099 transitions. Word has length 14 [2019-12-27 22:45:29,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:29,970 INFO L462 AbstractCegarLoop]: Abstraction has 30763 states and 102099 transitions. [2019-12-27 22:45:29,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:45:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 30763 states and 102099 transitions. [2019-12-27 22:45:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:45:29,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:29,981 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:45:29,981 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:29,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:29,982 INFO L82 PathProgramCache]: Analyzing trace with hash -777509353, now seen corresponding path program 1 times [2019-12-27 22:45:29,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:29,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696222971] [2019-12-27 22:45:29,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:30,085 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 22:45:30,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696222971] [2019-12-27 22:45:30,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:30,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:45:30,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1606404914] [2019-12-27 22:45:30,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:30,090 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:30,104 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 110 transitions. [2019-12-27 22:45:30,104 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:30,105 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:45:30,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:45:30,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:30,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:45:30,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:45:30,106 INFO L87 Difference]: Start difference. First operand 30763 states and 102099 transitions. Second operand 6 states. [2019-12-27 22:45:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:31,079 INFO L93 Difference]: Finished difference Result 48043 states and 156144 transitions. [2019-12-27 22:45:31,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:45:31,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:45:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:31,167 INFO L225 Difference]: With dead ends: 48043 [2019-12-27 22:45:31,167 INFO L226 Difference]: Without dead ends: 48015 [2019-12-27 22:45:31,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:45:31,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48015 states. [2019-12-27 22:45:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48015 to 32442. [2019-12-27 22:45:31,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32442 states. [2019-12-27 22:45:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32442 states to 32442 states and 106747 transitions. [2019-12-27 22:45:32,030 INFO L78 Accepts]: Start accepts. Automaton has 32442 states and 106747 transitions. Word has length 22 [2019-12-27 22:45:32,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:32,030 INFO L462 AbstractCegarLoop]: Abstraction has 32442 states and 106747 transitions. [2019-12-27 22:45:32,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:45:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 32442 states and 106747 transitions. [2019-12-27 22:45:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:45:32,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:32,047 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 22:45:32,047 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:32,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:32,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050688, now seen corresponding path program 1 times [2019-12-27 22:45:32,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:32,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318994571] [2019-12-27 22:45:32,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:32,110 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 22:45:32,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318994571] [2019-12-27 22:45:32,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:32,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:45:32,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1495070426] [2019-12-27 22:45:32,112 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:32,117 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:32,123 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:45:32,123 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:32,124 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:45:32,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:45:32,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:32,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:45:32,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:45:32,125 INFO L87 Difference]: Start difference. First operand 32442 states and 106747 transitions. Second operand 4 states. [2019-12-27 22:45:32,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:32,214 INFO L93 Difference]: Finished difference Result 12531 states and 37988 transitions. [2019-12-27 22:45:32,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:45:32,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:45:32,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:32,241 INFO L225 Difference]: With dead ends: 12531 [2019-12-27 22:45:32,241 INFO L226 Difference]: Without dead ends: 12531 [2019-12-27 22:45:32,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:45:32,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12531 states. [2019-12-27 22:45:32,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12531 to 12391. [2019-12-27 22:45:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12391 states. [2019-12-27 22:45:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12391 states to 12391 states and 37578 transitions. [2019-12-27 22:45:32,758 INFO L78 Accepts]: Start accepts. Automaton has 12391 states and 37578 transitions. Word has length 25 [2019-12-27 22:45:32,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:32,758 INFO L462 AbstractCegarLoop]: Abstraction has 12391 states and 37578 transitions. [2019-12-27 22:45:32,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:45:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 12391 states and 37578 transitions. [2019-12-27 22:45:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:45:32,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:32,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:45:32,778 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:32,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:32,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1562204347, now seen corresponding path program 1 times [2019-12-27 22:45:32,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:32,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674524697] [2019-12-27 22:45:32,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:32,905 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 22:45:32,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674524697] [2019-12-27 22:45:32,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:32,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:45:32,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901321039] [2019-12-27 22:45:32,906 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:32,913 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:32,944 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 143 transitions. [2019-12-27 22:45:32,944 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:33,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:45:33,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:45:33,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:33,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:45:33,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:45:33,075 INFO L87 Difference]: Start difference. First operand 12391 states and 37578 transitions. Second operand 8 states. [2019-12-27 22:45:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:33,986 INFO L93 Difference]: Finished difference Result 17659 states and 53000 transitions. [2019-12-27 22:45:33,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:45:33,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-27 22:45:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:34,020 INFO L225 Difference]: With dead ends: 17659 [2019-12-27 22:45:34,020 INFO L226 Difference]: Without dead ends: 17659 [2019-12-27 22:45:34,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:45:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17659 states. [2019-12-27 22:45:34,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17659 to 16146. [2019-12-27 22:45:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16146 states. [2019-12-27 22:45:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16146 states to 16146 states and 48801 transitions. [2019-12-27 22:45:34,361 INFO L78 Accepts]: Start accepts. Automaton has 16146 states and 48801 transitions. Word has length 39 [2019-12-27 22:45:34,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:34,361 INFO L462 AbstractCegarLoop]: Abstraction has 16146 states and 48801 transitions. [2019-12-27 22:45:34,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:45:34,361 INFO L276 IsEmpty]: Start isEmpty. Operand 16146 states and 48801 transitions. [2019-12-27 22:45:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:45:34,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:34,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:45:34,385 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:34,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1354690859, now seen corresponding path program 2 times [2019-12-27 22:45:34,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:34,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641135047] [2019-12-27 22:45:34,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:34,492 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 22:45:34,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641135047] [2019-12-27 22:45:34,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:34,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:45:34,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [439920571] [2019-12-27 22:45:34,493 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:34,501 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:34,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 96 transitions. [2019-12-27 22:45:34,523 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:34,600 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:45:34,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:45:34,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:34,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:45:34,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:45:34,602 INFO L87 Difference]: Start difference. First operand 16146 states and 48801 transitions. Second operand 9 states. [2019-12-27 22:45:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:36,590 INFO L93 Difference]: Finished difference Result 43656 states and 129377 transitions. [2019-12-27 22:45:36,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:45:36,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-12-27 22:45:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:36,655 INFO L225 Difference]: With dead ends: 43656 [2019-12-27 22:45:36,655 INFO L226 Difference]: Without dead ends: 43656 [2019-12-27 22:45:36,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:45:36,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43656 states. [2019-12-27 22:45:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43656 to 17915. [2019-12-27 22:45:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17915 states. [2019-12-27 22:45:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17915 states to 17915 states and 54314 transitions. [2019-12-27 22:45:37,351 INFO L78 Accepts]: Start accepts. Automaton has 17915 states and 54314 transitions. Word has length 39 [2019-12-27 22:45:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:37,352 INFO L462 AbstractCegarLoop]: Abstraction has 17915 states and 54314 transitions. [2019-12-27 22:45:37,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:45:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 17915 states and 54314 transitions. [2019-12-27 22:45:37,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:45:37,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:37,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:45:37,378 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:37,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:37,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1850486613, now seen corresponding path program 3 times [2019-12-27 22:45:37,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:37,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851502376] [2019-12-27 22:45:37,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:45:37,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851502376] [2019-12-27 22:45:37,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:37,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:45:37,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1359553983] [2019-12-27 22:45:37,473 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:37,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:37,505 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 111 transitions. [2019-12-27 22:45:37,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:37,511 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:45:37,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:45:37,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:37,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:45:37,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:45:37,512 INFO L87 Difference]: Start difference. First operand 17915 states and 54314 transitions. Second operand 5 states. [2019-12-27 22:45:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:37,602 INFO L93 Difference]: Finished difference Result 16542 states and 50779 transitions. [2019-12-27 22:45:37,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:45:37,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 22:45:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:37,626 INFO L225 Difference]: With dead ends: 16542 [2019-12-27 22:45:37,627 INFO L226 Difference]: Without dead ends: 16542 [2019-12-27 22:45:37,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:45:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16542 states. [2019-12-27 22:45:37,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16542 to 15708. [2019-12-27 22:45:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15708 states. [2019-12-27 22:45:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15708 states to 15708 states and 48426 transitions. [2019-12-27 22:45:37,867 INFO L78 Accepts]: Start accepts. Automaton has 15708 states and 48426 transitions. Word has length 39 [2019-12-27 22:45:37,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:37,867 INFO L462 AbstractCegarLoop]: Abstraction has 15708 states and 48426 transitions. [2019-12-27 22:45:37,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:45:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 15708 states and 48426 transitions. [2019-12-27 22:45:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:45:37,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:37,889 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] [2019-12-27 22:45:37,889 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:37,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1166865475, now seen corresponding path program 1 times [2019-12-27 22:45:37,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:37,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87847005] [2019-12-27 22:45:37,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:37,972 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 22:45:37,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87847005] [2019-12-27 22:45:37,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:37,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:45:37,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1151728788] [2019-12-27 22:45:37,973 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:37,990 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:38,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 404 transitions. [2019-12-27 22:45:38,162 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:38,214 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:45:38,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:45:38,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:38,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:45:38,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:45:38,216 INFO L87 Difference]: Start difference. First operand 15708 states and 48426 transitions. Second operand 7 states. [2019-12-27 22:45:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:38,722 INFO L93 Difference]: Finished difference Result 34527 states and 105791 transitions. [2019-12-27 22:45:38,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:45:38,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 22:45:38,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:38,750 INFO L225 Difference]: With dead ends: 34527 [2019-12-27 22:45:38,750 INFO L226 Difference]: Without dead ends: 18959 [2019-12-27 22:45:38,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:45:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18959 states. [2019-12-27 22:45:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18959 to 13424. [2019-12-27 22:45:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13424 states. [2019-12-27 22:45:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13424 states to 13424 states and 41260 transitions. [2019-12-27 22:45:39,327 INFO L78 Accepts]: Start accepts. Automaton has 13424 states and 41260 transitions. Word has length 54 [2019-12-27 22:45:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:39,327 INFO L462 AbstractCegarLoop]: Abstraction has 13424 states and 41260 transitions. [2019-12-27 22:45:39,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:45:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 13424 states and 41260 transitions. [2019-12-27 22:45:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:45:39,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:39,344 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] [2019-12-27 22:45:39,345 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:39,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:39,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2026182027, now seen corresponding path program 2 times [2019-12-27 22:45:39,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:39,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498038066] [2019-12-27 22:45:39,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:39,445 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 22:45:39,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498038066] [2019-12-27 22:45:39,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:39,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:45:39,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [536958981] [2019-12-27 22:45:39,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:39,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:39,636 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 313 transitions. [2019-12-27 22:45:39,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:39,755 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 22:45:39,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:45:39,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:39,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:45:39,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:45:39,756 INFO L87 Difference]: Start difference. First operand 13424 states and 41260 transitions. Second operand 9 states. [2019-12-27 22:45:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:41,115 INFO L93 Difference]: Finished difference Result 45287 states and 136014 transitions. [2019-12-27 22:45:41,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 22:45:41,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 22:45:41,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:41,169 INFO L225 Difference]: With dead ends: 45287 [2019-12-27 22:45:41,169 INFO L226 Difference]: Without dead ends: 34494 [2019-12-27 22:45:41,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:45:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34494 states. [2019-12-27 22:45:41,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34494 to 15478. [2019-12-27 22:45:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15478 states. [2019-12-27 22:45:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15478 states to 15478 states and 47480 transitions. [2019-12-27 22:45:41,565 INFO L78 Accepts]: Start accepts. Automaton has 15478 states and 47480 transitions. Word has length 54 [2019-12-27 22:45:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:41,565 INFO L462 AbstractCegarLoop]: Abstraction has 15478 states and 47480 transitions. [2019-12-27 22:45:41,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:45:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 15478 states and 47480 transitions. [2019-12-27 22:45:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:45:41,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:41,583 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] [2019-12-27 22:45:41,584 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:41,584 INFO L82 PathProgramCache]: Analyzing trace with hash -345709295, now seen corresponding path program 3 times [2019-12-27 22:45:41,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:41,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277370640] [2019-12-27 22:45:41,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:41,676 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 22:45:41,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277370640] [2019-12-27 22:45:41,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:41,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:45:41,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [505640046] [2019-12-27 22:45:41,677 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:41,693 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:42,065 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 400 transitions. [2019-12-27 22:45:42,065 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:42,148 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:45:42,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:45:42,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:42,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:45:42,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:45:42,150 INFO L87 Difference]: Start difference. First operand 15478 states and 47480 transitions. Second operand 10 states. [2019-12-27 22:45:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:42,643 INFO L93 Difference]: Finished difference Result 36198 states and 108797 transitions. [2019-12-27 22:45:42,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:45:42,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:45:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:42,681 INFO L225 Difference]: With dead ends: 36198 [2019-12-27 22:45:42,681 INFO L226 Difference]: Without dead ends: 25734 [2019-12-27 22:45:42,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:45:42,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25734 states. [2019-12-27 22:45:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25734 to 17318. [2019-12-27 22:45:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17318 states. [2019-12-27 22:45:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17318 states to 17318 states and 52753 transitions. [2019-12-27 22:45:43,023 INFO L78 Accepts]: Start accepts. Automaton has 17318 states and 52753 transitions. Word has length 54 [2019-12-27 22:45:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:43,023 INFO L462 AbstractCegarLoop]: Abstraction has 17318 states and 52753 transitions. [2019-12-27 22:45:43,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:45:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 17318 states and 52753 transitions. [2019-12-27 22:45:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:45:43,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:43,051 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] [2019-12-27 22:45:43,051 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:43,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:43,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1893996223, now seen corresponding path program 4 times [2019-12-27 22:45:43,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:43,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994978886] [2019-12-27 22:45:43,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:43,140 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 22:45:43,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994978886] [2019-12-27 22:45:43,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:43,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:45:43,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [786130285] [2019-12-27 22:45:43,141 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:43,157 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:43,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 230 transitions. [2019-12-27 22:45:43,252 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:43,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 22:45:43,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:45:43,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:43,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:45:43,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:45:43,468 INFO L87 Difference]: Start difference. First operand 17318 states and 52753 transitions. Second operand 10 states. [2019-12-27 22:45:45,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:45,424 INFO L93 Difference]: Finished difference Result 70254 states and 213798 transitions. [2019-12-27 22:45:45,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 22:45:45,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:45:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:45,865 INFO L225 Difference]: With dead ends: 70254 [2019-12-27 22:45:45,865 INFO L226 Difference]: Without dead ends: 54335 [2019-12-27 22:45:45,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2019-12-27 22:45:45,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54335 states. [2019-12-27 22:45:46,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54335 to 20280. [2019-12-27 22:45:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20280 states. [2019-12-27 22:45:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20280 states to 20280 states and 62496 transitions. [2019-12-27 22:45:46,422 INFO L78 Accepts]: Start accepts. Automaton has 20280 states and 62496 transitions. Word has length 54 [2019-12-27 22:45:46,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:46,422 INFO L462 AbstractCegarLoop]: Abstraction has 20280 states and 62496 transitions. [2019-12-27 22:45:46,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:45:46,422 INFO L276 IsEmpty]: Start isEmpty. Operand 20280 states and 62496 transitions. [2019-12-27 22:45:46,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:45:46,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:46,448 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] [2019-12-27 22:45:46,449 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:46,449 INFO L82 PathProgramCache]: Analyzing trace with hash -763040279, now seen corresponding path program 1 times [2019-12-27 22:45:46,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:46,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765188038] [2019-12-27 22:45:46,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:46,509 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 22:45:46,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765188038] [2019-12-27 22:45:46,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:46,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:45:46,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1754487996] [2019-12-27 22:45:46,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:46,549 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:46,689 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 230 transitions. [2019-12-27 22:45:46,689 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:46,696 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:45:46,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:45:46,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:46,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:45:46,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:45:46,697 INFO L87 Difference]: Start difference. First operand 20280 states and 62496 transitions. Second operand 3 states. [2019-12-27 22:45:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:46,870 INFO L93 Difference]: Finished difference Result 28526 states and 87523 transitions. [2019-12-27 22:45:46,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:45:46,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 22:45:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:46,927 INFO L225 Difference]: With dead ends: 28526 [2019-12-27 22:45:46,928 INFO L226 Difference]: Without dead ends: 28526 [2019-12-27 22:45:46,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:45:47,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28526 states. [2019-12-27 22:45:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28526 to 25642. [2019-12-27 22:45:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25642 states. [2019-12-27 22:45:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25642 states to 25642 states and 79205 transitions. [2019-12-27 22:45:47,349 INFO L78 Accepts]: Start accepts. Automaton has 25642 states and 79205 transitions. Word has length 54 [2019-12-27 22:45:47,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:47,350 INFO L462 AbstractCegarLoop]: Abstraction has 25642 states and 79205 transitions. [2019-12-27 22:45:47,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:45:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 25642 states and 79205 transitions. [2019-12-27 22:45:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:45:47,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:47,377 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] [2019-12-27 22:45:47,377 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:47,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:47,377 INFO L82 PathProgramCache]: Analyzing trace with hash 709346415, now seen corresponding path program 5 times [2019-12-27 22:45:47,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:47,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395609638] [2019-12-27 22:45:47,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:47,494 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 22:45:47,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395609638] [2019-12-27 22:45:47,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:47,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:45:47,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1341126721] [2019-12-27 22:45:47,496 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:47,512 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:47,968 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 378 transitions. [2019-12-27 22:45:47,969 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:48,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:45:48,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:45:48,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:45:48,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:48,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:45:48,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:45:48,174 INFO L87 Difference]: Start difference. First operand 25642 states and 79205 transitions. Second operand 11 states. [2019-12-27 22:45:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:50,263 INFO L93 Difference]: Finished difference Result 39927 states and 120648 transitions. [2019-12-27 22:45:50,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 22:45:50,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 22:45:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:50,328 INFO L225 Difference]: With dead ends: 39927 [2019-12-27 22:45:50,328 INFO L226 Difference]: Without dead ends: 39927 [2019-12-27 22:45:50,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:45:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39927 states. [2019-12-27 22:45:50,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39927 to 27381. [2019-12-27 22:45:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27381 states. [2019-12-27 22:45:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27381 states to 27381 states and 84108 transitions. [2019-12-27 22:45:50,869 INFO L78 Accepts]: Start accepts. Automaton has 27381 states and 84108 transitions. Word has length 54 [2019-12-27 22:45:50,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:50,869 INFO L462 AbstractCegarLoop]: Abstraction has 27381 states and 84108 transitions. [2019-12-27 22:45:50,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:45:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 27381 states and 84108 transitions. [2019-12-27 22:45:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:45:50,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:50,905 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] [2019-12-27 22:45:50,905 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:50,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:50,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1752990847, now seen corresponding path program 6 times [2019-12-27 22:45:50,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:50,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223454230] [2019-12-27 22:45:50,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:51,056 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 22:45:51,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223454230] [2019-12-27 22:45:51,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:51,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:45:51,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1713710856] [2019-12-27 22:45:51,057 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:51,078 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:51,261 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 173 states and 299 transitions. [2019-12-27 22:45:51,261 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:51,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:45:51,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:45:51,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:45:51,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:45:51,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:51,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:45:51,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:45:51,452 INFO L87 Difference]: Start difference. First operand 27381 states and 84108 transitions. Second operand 13 states. [2019-12-27 22:45:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:55,784 INFO L93 Difference]: Finished difference Result 59090 states and 177179 transitions. [2019-12-27 22:45:55,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 22:45:55,784 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 22:45:55,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:55,877 INFO L225 Difference]: With dead ends: 59090 [2019-12-27 22:45:55,877 INFO L226 Difference]: Without dead ends: 59090 [2019-12-27 22:45:55,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=471, Invalid=1785, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 22:45:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59090 states. [2019-12-27 22:45:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59090 to 25899. [2019-12-27 22:45:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25899 states. [2019-12-27 22:45:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25899 states to 25899 states and 79793 transitions. [2019-12-27 22:45:56,537 INFO L78 Accepts]: Start accepts. Automaton has 25899 states and 79793 transitions. Word has length 54 [2019-12-27 22:45:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:56,538 INFO L462 AbstractCegarLoop]: Abstraction has 25899 states and 79793 transitions. [2019-12-27 22:45:56,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:45:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 25899 states and 79793 transitions. [2019-12-27 22:45:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:45:56,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:56,569 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] [2019-12-27 22:45:56,569 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:56,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:56,570 INFO L82 PathProgramCache]: Analyzing trace with hash -931727569, now seen corresponding path program 7 times [2019-12-27 22:45:56,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:56,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622680201] [2019-12-27 22:45:56,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:56,629 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 22:45:56,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622680201] [2019-12-27 22:45:56,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:56,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:45:56,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1643860256] [2019-12-27 22:45:56,631 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:56,649 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:57,139 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 305 transitions. [2019-12-27 22:45:57,139 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:57,148 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:45:57,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:45:57,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:57,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:45:57,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:45:57,149 INFO L87 Difference]: Start difference. First operand 25899 states and 79793 transitions. Second operand 4 states. [2019-12-27 22:45:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:57,409 INFO L93 Difference]: Finished difference Result 26122 states and 78344 transitions. [2019-12-27 22:45:57,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:45:57,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:45:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:57,449 INFO L225 Difference]: With dead ends: 26122 [2019-12-27 22:45:57,449 INFO L226 Difference]: Without dead ends: 26122 [2019-12-27 22:45:57,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:45:57,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26122 states. [2019-12-27 22:45:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26122 to 19381. [2019-12-27 22:45:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19381 states. [2019-12-27 22:45:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19381 states to 19381 states and 58610 transitions. [2019-12-27 22:45:57,783 INFO L78 Accepts]: Start accepts. Automaton has 19381 states and 58610 transitions. Word has length 54 [2019-12-27 22:45:57,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:57,783 INFO L462 AbstractCegarLoop]: Abstraction has 19381 states and 58610 transitions. [2019-12-27 22:45:57,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:45:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 19381 states and 58610 transitions. [2019-12-27 22:45:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:45:57,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:57,814 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] [2019-12-27 22:45:57,814 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:57,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:57,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2068351876, now seen corresponding path program 1 times [2019-12-27 22:45:57,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:57,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336967567] [2019-12-27 22:45:57,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:57,943 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 22:45:57,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336967567] [2019-12-27 22:45:57,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:57,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:45:57,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [17782019] [2019-12-27 22:45:57,944 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:57,963 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:58,132 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 350 transitions. [2019-12-27 22:45:58,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:58,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:45:58,320 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:45:58,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:45:58,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:58,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:45:58,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:45:58,321 INFO L87 Difference]: Start difference. First operand 19381 states and 58610 transitions. Second operand 12 states. [2019-12-27 22:46:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:00,129 INFO L93 Difference]: Finished difference Result 27180 states and 80237 transitions. [2019-12-27 22:46:00,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:46:00,130 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 22:46:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:00,176 INFO L225 Difference]: With dead ends: 27180 [2019-12-27 22:46:00,176 INFO L226 Difference]: Without dead ends: 27044 [2019-12-27 22:46:00,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:46:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27044 states. [2019-12-27 22:46:00,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27044 to 21170. [2019-12-27 22:46:00,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21170 states. [2019-12-27 22:46:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21170 states to 21170 states and 63657 transitions. [2019-12-27 22:46:00,525 INFO L78 Accepts]: Start accepts. Automaton has 21170 states and 63657 transitions. Word has length 55 [2019-12-27 22:46:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:00,526 INFO L462 AbstractCegarLoop]: Abstraction has 21170 states and 63657 transitions. [2019-12-27 22:46:00,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:46:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 21170 states and 63657 transitions. [2019-12-27 22:46:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:46:00,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:00,550 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] [2019-12-27 22:46:00,550 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:00,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:00,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1084774030, now seen corresponding path program 2 times [2019-12-27 22:46:00,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:00,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730051549] [2019-12-27 22:46:00,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:00,683 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 22:46:00,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730051549] [2019-12-27 22:46:00,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:00,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:46:00,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [737014924] [2019-12-27 22:46:00,684 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:00,699 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:01,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 332 transitions. [2019-12-27 22:46:01,136 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:01,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:46:01,424 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:46:01,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:46:01,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:01,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:46:01,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:46:01,425 INFO L87 Difference]: Start difference. First operand 21170 states and 63657 transitions. Second operand 13 states. [2019-12-27 22:46:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:04,250 INFO L93 Difference]: Finished difference Result 27747 states and 81861 transitions. [2019-12-27 22:46:04,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 22:46:04,251 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-27 22:46:04,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:04,290 INFO L225 Difference]: With dead ends: 27747 [2019-12-27 22:46:04,290 INFO L226 Difference]: Without dead ends: 27747 [2019-12-27 22:46:04,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 22:46:04,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27747 states. [2019-12-27 22:46:04,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27747 to 19122. [2019-12-27 22:46:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 22:46:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 57824 transitions. [2019-12-27 22:46:04,642 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 57824 transitions. Word has length 55 [2019-12-27 22:46:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:04,642 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 57824 transitions. [2019-12-27 22:46:04,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:46:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 57824 transitions. [2019-12-27 22:46:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:46:04,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:04,664 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] [2019-12-27 22:46:04,665 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:04,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:04,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1247506214, now seen corresponding path program 3 times [2019-12-27 22:46:04,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:04,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718300698] [2019-12-27 22:46:04,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:04,782 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 22:46:04,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718300698] [2019-12-27 22:46:04,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:04,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:46:04,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1722870673] [2019-12-27 22:46:04,783 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:04,798 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:04,931 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 226 transitions. [2019-12-27 22:46:04,931 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:05,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 22:46:05,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:46:05,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:05,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:46:05,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:46:05,087 INFO L87 Difference]: Start difference. First operand 19122 states and 57824 transitions. Second operand 12 states. [2019-12-27 22:46:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:06,517 INFO L93 Difference]: Finished difference Result 34481 states and 103535 transitions. [2019-12-27 22:46:06,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 22:46:06,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 22:46:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:06,558 INFO L225 Difference]: With dead ends: 34481 [2019-12-27 22:46:06,558 INFO L226 Difference]: Without dead ends: 27074 [2019-12-27 22:46:06,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:46:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27074 states. [2019-12-27 22:46:07,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27074 to 19586. [2019-12-27 22:46:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19586 states. [2019-12-27 22:46:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19586 states to 19586 states and 58787 transitions. [2019-12-27 22:46:07,150 INFO L78 Accepts]: Start accepts. Automaton has 19586 states and 58787 transitions. Word has length 55 [2019-12-27 22:46:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:07,150 INFO L462 AbstractCegarLoop]: Abstraction has 19586 states and 58787 transitions. [2019-12-27 22:46:07,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:46:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 19586 states and 58787 transitions. [2019-12-27 22:46:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:46:07,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:07,173 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] [2019-12-27 22:46:07,173 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:07,173 INFO L82 PathProgramCache]: Analyzing trace with hash -653717204, now seen corresponding path program 4 times [2019-12-27 22:46:07,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:07,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603113699] [2019-12-27 22:46:07,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:07,365 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 22:46:07,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603113699] [2019-12-27 22:46:07,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:07,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:46:07,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16809200] [2019-12-27 22:46:07,366 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:07,381 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:07,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 227 transitions. [2019-12-27 22:46:07,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:07,861 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:46:07,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 22:46:07,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:07,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 22:46:07,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:46:07,862 INFO L87 Difference]: Start difference. First operand 19586 states and 58787 transitions. Second operand 18 states. [2019-12-27 22:46:12,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:12,489 INFO L93 Difference]: Finished difference Result 45777 states and 134919 transitions. [2019-12-27 22:46:12,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 22:46:12,490 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-12-27 22:46:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:12,543 INFO L225 Difference]: With dead ends: 45777 [2019-12-27 22:46:12,543 INFO L226 Difference]: Without dead ends: 37306 [2019-12-27 22:46:12,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 10 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=267, Invalid=1539, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 22:46:12,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37306 states. [2019-12-27 22:46:13,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37306 to 21947. [2019-12-27 22:46:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21947 states. [2019-12-27 22:46:13,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21947 states to 21947 states and 65259 transitions. [2019-12-27 22:46:13,311 INFO L78 Accepts]: Start accepts. Automaton has 21947 states and 65259 transitions. Word has length 55 [2019-12-27 22:46:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:13,311 INFO L462 AbstractCegarLoop]: Abstraction has 21947 states and 65259 transitions. [2019-12-27 22:46:13,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 22:46:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 21947 states and 65259 transitions. [2019-12-27 22:46:13,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:46:13,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:13,334 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] [2019-12-27 22:46:13,334 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:13,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:13,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1491379880, now seen corresponding path program 5 times [2019-12-27 22:46:13,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:13,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823802785] [2019-12-27 22:46:13,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:13,509 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 22:46:13,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823802785] [2019-12-27 22:46:13,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:13,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:46:13,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [490993968] [2019-12-27 22:46:13,510 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:13,522 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:13,624 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 267 transitions. [2019-12-27 22:46:13,624 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:13,851 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:46:13,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 22:46:13,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:13,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 22:46:13,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:46:13,852 INFO L87 Difference]: Start difference. First operand 21947 states and 65259 transitions. Second operand 18 states. [2019-12-27 22:46:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:16,966 INFO L93 Difference]: Finished difference Result 41388 states and 121299 transitions. [2019-12-27 22:46:16,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 22:46:16,966 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-12-27 22:46:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:17,023 INFO L225 Difference]: With dead ends: 41388 [2019-12-27 22:46:17,023 INFO L226 Difference]: Without dead ends: 40290 [2019-12-27 22:46:17,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=677, Invalid=3613, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 22:46:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40290 states. [2019-12-27 22:46:17,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40290 to 24894. [2019-12-27 22:46:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24894 states. [2019-12-27 22:46:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24894 states to 24894 states and 73416 transitions. [2019-12-27 22:46:17,497 INFO L78 Accepts]: Start accepts. Automaton has 24894 states and 73416 transitions. Word has length 55 [2019-12-27 22:46:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:17,498 INFO L462 AbstractCegarLoop]: Abstraction has 24894 states and 73416 transitions. [2019-12-27 22:46:17,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 22:46:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 24894 states and 73416 transitions. [2019-12-27 22:46:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:46:17,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:17,525 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] [2019-12-27 22:46:17,525 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:17,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:17,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1458558076, now seen corresponding path program 6 times [2019-12-27 22:46:17,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:17,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130004914] [2019-12-27 22:46:17,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:17,577 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 22:46:17,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130004914] [2019-12-27 22:46:17,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:17,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:46:17,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1310636666] [2019-12-27 22:46:17,579 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:17,593 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:18,070 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 285 transitions. [2019-12-27 22:46:18,070 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:18,071 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:46:18,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:46:18,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:18,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:46:18,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:46:18,073 INFO L87 Difference]: Start difference. First operand 24894 states and 73416 transitions. Second operand 3 states. [2019-12-27 22:46:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:18,234 INFO L93 Difference]: Finished difference Result 24892 states and 73411 transitions. [2019-12-27 22:46:18,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:46:18,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 22:46:18,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:18,285 INFO L225 Difference]: With dead ends: 24892 [2019-12-27 22:46:18,286 INFO L226 Difference]: Without dead ends: 24892 [2019-12-27 22:46:18,286 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 22:46:18,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24892 states. [2019-12-27 22:46:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24892 to 22667. [2019-12-27 22:46:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22667 states. [2019-12-27 22:46:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22667 states to 22667 states and 67427 transitions. [2019-12-27 22:46:18,707 INFO L78 Accepts]: Start accepts. Automaton has 22667 states and 67427 transitions. Word has length 55 [2019-12-27 22:46:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:18,707 INFO L462 AbstractCegarLoop]: Abstraction has 22667 states and 67427 transitions. [2019-12-27 22:46:18,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:46:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 22667 states and 67427 transitions. [2019-12-27 22:46:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:46:18,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:18,734 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] [2019-12-27 22:46:18,734 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:18,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:18,734 INFO L82 PathProgramCache]: Analyzing trace with hash 794171059, now seen corresponding path program 1 times [2019-12-27 22:46:18,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:18,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907406172] [2019-12-27 22:46:18,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:19,195 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 22:46:19,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907406172] [2019-12-27 22:46:19,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:19,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:46:19,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [227356876] [2019-12-27 22:46:19,196 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:19,209 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:19,447 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 420 transitions. [2019-12-27 22:46:19,447 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:20,217 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 22:46:20,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 22:46:20,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:20,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 22:46:20,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:46:20,220 INFO L87 Difference]: Start difference. First operand 22667 states and 67427 transitions. Second operand 24 states. [2019-12-27 22:46:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:26,763 INFO L93 Difference]: Finished difference Result 34613 states and 100650 transitions. [2019-12-27 22:46:26,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 22:46:26,764 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2019-12-27 22:46:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:26,808 INFO L225 Difference]: With dead ends: 34613 [2019-12-27 22:46:26,808 INFO L226 Difference]: Without dead ends: 31897 [2019-12-27 22:46:26,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=460, Invalid=2192, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 22:46:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31897 states. [2019-12-27 22:46:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31897 to 23065. [2019-12-27 22:46:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23065 states. [2019-12-27 22:46:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23065 states to 23065 states and 68325 transitions. [2019-12-27 22:46:27,193 INFO L78 Accepts]: Start accepts. Automaton has 23065 states and 68325 transitions. Word has length 56 [2019-12-27 22:46:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:27,194 INFO L462 AbstractCegarLoop]: Abstraction has 23065 states and 68325 transitions. [2019-12-27 22:46:27,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 22:46:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 23065 states and 68325 transitions. [2019-12-27 22:46:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:46:27,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:27,221 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] [2019-12-27 22:46:27,221 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:27,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:27,221 INFO L82 PathProgramCache]: Analyzing trace with hash 379887659, now seen corresponding path program 2 times [2019-12-27 22:46:27,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:27,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658259682] [2019-12-27 22:46:27,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:46:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:46:27,317 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:46:27,318 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:46:27,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_53| 0 0))) (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2348~0.base_19|) (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_24) (= 0 v_~x$r_buff0_thd0~0_20) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~weak$$choice0~0_5) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2348~0.base_19| 4)) (= v_~z~0_10 0) (= |v_#valid_51| (store .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_19| 1)) (= 0 v_~__unbuffered_p0_EAX~0_14) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~x$w_buff1_used~0_67 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~x$flush_delayed~0_14 0) (= 0 v_~x$r_buff0_thd1~0_71) (= v_~x$r_buff1_thd2~0_16 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2348~0.base_19| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2348~0.base_19|) |v_ULTIMATE.start_main_~#t2348~0.offset_15| 0)) |v_#memory_int_21|) (= 0 v_~x$w_buff0_used~0_110) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x$mem_tmp~0_11 0) (= v_~x~0_25 0) (= 0 v_~x$r_buff0_thd3~0_19) (= v_~y~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_19|)) (= v_~x$r_buff1_thd0~0_19 0) (= 0 v_~x$w_buff0~0_29) (= 0 |v_ULTIMATE.start_main_~#t2348~0.offset_15|) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_29, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ULTIMATE.start_main_~#t2348~0.base=|v_ULTIMATE.start_main_~#t2348~0.base_19|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_25, ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_21|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_16|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_21|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ULTIMATE.start_main_~#t2348~0.offset=|v_ULTIMATE.start_main_~#t2348~0.offset_15|, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~z~0=v_~z~0_10, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2348~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2350~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2350~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2348~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:46:27,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2349~0.offset_11| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2349~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2349~0.base_13| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13|) |v_ULTIMATE.start_main_~#t2349~0.offset_11| 1)) |v_#memory_int_15|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_13|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 22:46:27,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13|) |v_ULTIMATE.start_main_~#t2350~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2350~0.base_13|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2350~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| 4)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2350~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_11|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t2350~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2350~0.base] because there is no mapped edge [2019-12-27 22:46:27,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] P1ENTRY-->L5-3: Formula: (and (= (mod ~x$w_buff1_used~0_Out-1784525651 256) 0) (= ~x$w_buff0~0_Out-1784525651 1) (= 1 ~x$w_buff0_used~0_Out-1784525651) (= ~x$w_buff1~0_Out-1784525651 ~x$w_buff0~0_In-1784525651) (= ~x$w_buff0_used~0_In-1784525651 ~x$w_buff1_used~0_Out-1784525651) (= |P1Thread1of1ForFork0_#in~arg.base_In-1784525651| P1Thread1of1ForFork0_~arg.base_Out-1784525651) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1784525651| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1784525651) (= P1Thread1of1ForFork0_~arg.offset_Out-1784525651 |P1Thread1of1ForFork0_#in~arg.offset_In-1784525651|) (= 1 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1784525651|)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1784525651, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1784525651|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1784525651|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1784525651} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-1784525651, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1784525651, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-1784525651, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-1784525651, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1784525651|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1784525651|, ~x$w_buff1~0=~x$w_buff1~0_Out-1784525651, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1784525651|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1784525651, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1784525651} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 22:46:27,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1115745995 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In1115745995 256) 0))) (or (and (= ~x$w_buff1~0_In1115745995 |P2Thread1of1ForFork1_#t~ite32_Out1115745995|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In1115745995 |P2Thread1of1ForFork1_#t~ite32_Out1115745995|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1115745995, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115745995, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1115745995, ~x~0=~x~0_In1115745995} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1115745995|, ~x$w_buff1~0=~x$w_buff1~0_In1115745995, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115745995, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1115745995, ~x~0=~x~0_In1115745995} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:46:27,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 22:46:27,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-517751118 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-517751118 256)))) (or (and (= ~x$w_buff0_used~0_In-517751118 |P2Thread1of1ForFork1_#t~ite34_Out-517751118|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out-517751118| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-517751118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-517751118} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-517751118|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-517751118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-517751118} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:46:27,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1997284569 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1997284569 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out1997284569| ~x$w_buff0_used~0_In1997284569) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1997284569| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1997284569, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1997284569} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1997284569, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1997284569|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1997284569} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 22:46:27,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-297776403 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-297776403 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-297776403 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-297776403 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-297776403| ~x$w_buff1_used~0_In-297776403) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-297776403|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-297776403, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-297776403, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-297776403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-297776403} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-297776403, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-297776403, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-297776403, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-297776403|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-297776403} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 22:46:27,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In481806040 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In481806040 256)))) (or (and (= ~x$r_buff0_thd2~0_In481806040 ~x$r_buff0_thd2~0_Out481806040) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out481806040) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In481806040, ~x$w_buff0_used~0=~x$w_buff0_used~0_In481806040} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out481806040|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out481806040, ~x$w_buff0_used~0=~x$w_buff0_used~0_In481806040} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:46:27,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In230775093 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In230775093 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In230775093 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In230775093 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out230775093| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out230775093| ~x$r_buff1_thd2~0_In230775093)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In230775093, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In230775093, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In230775093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In230775093} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out230775093|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In230775093, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In230775093, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In230775093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In230775093} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 22:46:27,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L781-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_11 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 22:46:27,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In937724730 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_In937724730| |P0Thread1of1ForFork2_#t~ite11_Out937724730|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite12_Out937724730| ~x$w_buff1~0_In937724730)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In937724730 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In937724730 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In937724730 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In937724730 256)))) (= |P0Thread1of1ForFork2_#t~ite11_Out937724730| ~x$w_buff1~0_In937724730) (= |P0Thread1of1ForFork2_#t~ite12_Out937724730| |P0Thread1of1ForFork2_#t~ite11_Out937724730|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In937724730, ~x$w_buff1~0=~x$w_buff1~0_In937724730, ~x$w_buff1_used~0=~x$w_buff1_used~0_In937724730, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In937724730, ~weak$$choice2~0=~weak$$choice2~0_In937724730, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In937724730|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In937724730} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In937724730, ~x$w_buff1~0=~x$w_buff1~0_In937724730, ~x$w_buff1_used~0=~x$w_buff1_used~0_In937724730, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In937724730, ~weak$$choice2~0=~weak$$choice2~0_In937724730, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out937724730|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out937724730|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In937724730} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 22:46:27,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-229395722 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite15_Out-229395722| ~x$w_buff0_used~0_In-229395722) (= |P0Thread1of1ForFork2_#t~ite14_In-229395722| |P0Thread1of1ForFork2_#t~ite14_Out-229395722|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out-229395722| |P0Thread1of1ForFork2_#t~ite14_Out-229395722|) (= ~x$w_buff0_used~0_In-229395722 |P0Thread1of1ForFork2_#t~ite14_Out-229395722|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-229395722 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-229395722 256)) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In-229395722 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-229395722 256))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-229395722, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-229395722, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-229395722, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-229395722|, ~weak$$choice2~0=~weak$$choice2~0_In-229395722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229395722} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-229395722, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-229395722, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-229395722|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-229395722, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-229395722|, ~weak$$choice2~0=~weak$$choice2~0_In-229395722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229395722} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 22:46:27,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L745-->L745-8: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1832296787 256))) (.cse5 (= |P0Thread1of1ForFork2_#t~ite18_Out1832296787| |P0Thread1of1ForFork2_#t~ite17_Out1832296787|)) (.cse0 (= (mod ~weak$$choice2~0_In1832296787 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1832296787 256) 0)) (.cse4 (= (mod ~x$r_buff1_thd1~0_In1832296787 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1832296787 256) 0))) (or (and (or (and (= |P0Thread1of1ForFork2_#t~ite18_Out1832296787| ~x$w_buff1_used~0_In1832296787) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In1832296787| |P0Thread1of1ForFork2_#t~ite17_Out1832296787|)) (and (= ~x$w_buff1_used~0_In1832296787 |P0Thread1of1ForFork2_#t~ite17_Out1832296787|) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4)) .cse5 .cse0)) (= |P0Thread1of1ForFork2_#t~ite16_In1832296787| |P0Thread1of1ForFork2_#t~ite16_Out1832296787|)) (let ((.cse6 (not .cse1))) (and (not .cse3) .cse5 .cse0 (or .cse6 (not .cse2)) (= 0 |P0Thread1of1ForFork2_#t~ite16_Out1832296787|) (or .cse6 (not .cse4)) (= |P0Thread1of1ForFork2_#t~ite16_Out1832296787| |P0Thread1of1ForFork2_#t~ite17_Out1832296787|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1832296787, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1832296787|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1832296787, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In1832296787|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1832296787, ~weak$$choice2~0=~weak$$choice2~0_In1832296787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832296787} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1832296787, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1832296787|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1832296787|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1832296787, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out1832296787|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1832296787, ~weak$$choice2~0=~weak$$choice2~0_In1832296787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832296787} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 22:46:27,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L746-->L747: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_44 v_~x$r_buff0_thd1~0_43)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 22:46:27,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L747-->L747-8: Formula: (let ((.cse4 (= 0 (mod ~x$w_buff0_used~0_In402649809 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In402649809 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In402649809 256))) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In402649809 256))) (.cse2 (= (mod ~weak$$choice2~0_In402649809 256) 0)) (.cse5 (= |P0Thread1of1ForFork2_#t~ite24_Out402649809| |P0Thread1of1ForFork2_#t~ite23_Out402649809|))) (or (let ((.cse0 (not .cse6))) (and (or .cse0 (not .cse1)) .cse2 (= |P0Thread1of1ForFork2_#t~ite23_Out402649809| |P0Thread1of1ForFork2_#t~ite22_Out402649809|) (= |P0Thread1of1ForFork2_#t~ite22_Out402649809| 0) (or .cse0 (not .cse3)) (not .cse4) .cse5)) (and (= |P0Thread1of1ForFork2_#t~ite22_In402649809| |P0Thread1of1ForFork2_#t~ite22_Out402649809|) (or (and (= |P0Thread1of1ForFork2_#t~ite23_In402649809| |P0Thread1of1ForFork2_#t~ite23_Out402649809|) (not .cse2) (= |P0Thread1of1ForFork2_#t~ite24_Out402649809| ~x$r_buff1_thd1~0_In402649809)) (and (= |P0Thread1of1ForFork2_#t~ite23_Out402649809| ~x$r_buff1_thd1~0_In402649809) (or .cse4 (and .cse6 .cse1) (and .cse3 .cse6)) .cse2 .cse5))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In402649809, ~x$w_buff1_used~0=~x$w_buff1_used~0_In402649809, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In402649809, ~weak$$choice2~0=~weak$$choice2~0_In402649809, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In402649809|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In402649809|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402649809} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In402649809, ~x$w_buff1_used~0=~x$w_buff1_used~0_In402649809, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In402649809, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out402649809|, ~weak$$choice2~0=~weak$$choice2~0_In402649809, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out402649809|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out402649809|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402649809} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 22:46:27,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_18) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 22:46:27,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In1437456277 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1437456277 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1437456277 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1437456277 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1437456277|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1437456277 |P2Thread1of1ForFork1_#t~ite35_Out1437456277|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1437456277, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1437456277, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1437456277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1437456277} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1437456277|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1437456277, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1437456277, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1437456277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1437456277} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:46:27,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-464332497 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-464332497 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-464332497|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In-464332497 |P2Thread1of1ForFork1_#t~ite36_Out-464332497|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-464332497, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-464332497} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-464332497|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-464332497, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-464332497} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:46:27,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1151098661 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1151098661 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In1151098661 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1151098661 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1151098661| ~x$r_buff1_thd3~0_In1151098661) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1151098661| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1151098661, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1151098661, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1151098661, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1151098661} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1151098661|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1151098661, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1151098661, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1151098661, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1151098661} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:46:27,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 22:46:27,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:46:27,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In466014473 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In466014473 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out466014473| ~x$w_buff1~0_In466014473) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In466014473 |ULTIMATE.start_main_#t~ite41_Out466014473|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In466014473, ~x$w_buff1_used~0=~x$w_buff1_used~0_In466014473, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In466014473, ~x~0=~x~0_In466014473} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out466014473|, ~x$w_buff1~0=~x$w_buff1~0_In466014473, ~x$w_buff1_used~0=~x$w_buff1_used~0_In466014473, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In466014473, ~x~0=~x~0_In466014473} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 22:46:27,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_8|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 22:46:27,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-394282251 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-394282251 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-394282251| ~x$w_buff0_used~0_In-394282251)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-394282251|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-394282251, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-394282251} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-394282251, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-394282251|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-394282251} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:46:27,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In371313697 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In371313697 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In371313697 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In371313697 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In371313697 |ULTIMATE.start_main_#t~ite44_Out371313697|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out371313697|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In371313697, ~x$w_buff1_used~0=~x$w_buff1_used~0_In371313697, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In371313697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In371313697} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In371313697, ~x$w_buff1_used~0=~x$w_buff1_used~0_In371313697, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In371313697, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out371313697|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In371313697} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:46:27,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2000263135 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2000263135 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out2000263135|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out2000263135| ~x$r_buff0_thd0~0_In2000263135) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2000263135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2000263135} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2000263135, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2000263135|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2000263135} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:46:27,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-2032191157 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2032191157 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-2032191157 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-2032191157 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out-2032191157| ~x$r_buff1_thd0~0_In-2032191157)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite46_Out-2032191157| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2032191157, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2032191157, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2032191157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2032191157} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2032191157, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-2032191157|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2032191157, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2032191157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2032191157} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 22:46:27,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~x$r_buff1_thd0~0_13 |v_ULTIMATE.start_main_#t~ite46_11|) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_9 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:46:27,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:46:27 BasicIcfg [2019-12-27 22:46:27,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:46:27,432 INFO L168 Benchmark]: Toolchain (without parser) took 107446.18 ms. Allocated memory was 140.5 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 22:46:27,432 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 140.5 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 22:46:27,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.26 ms. Allocated memory was 140.5 MB in the beginning and 201.9 MB in the end (delta: 61.3 MB). Free memory was 100.5 MB in the beginning and 155.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:46:27,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.70 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:46:27,434 INFO L168 Benchmark]: Boogie Preprocessor took 37.63 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:46:27,435 INFO L168 Benchmark]: RCFGBuilder took 878.99 ms. Allocated memory is still 201.9 MB. Free memory was 151.1 MB in the beginning and 104.2 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:46:27,435 INFO L168 Benchmark]: TraceAbstraction took 105626.17 ms. Allocated memory was 201.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 104.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 22:46:27,444 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.25 ms. Allocated memory is still 140.5 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 832.26 ms. Allocated memory was 140.5 MB in the beginning and 201.9 MB in the end (delta: 61.3 MB). Free memory was 100.5 MB in the beginning and 155.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.70 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.63 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 878.99 ms. Allocated memory is still 201.9 MB. Free memory was 151.1 MB in the beginning and 104.2 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105626.17 ms. Allocated memory was 201.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 104.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 87 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 30 ChoiceCompositions, 6629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75034 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2348, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L822] FCALL, FORK 0 pthread_create(&t2349, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2350, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 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_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 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) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 105.3s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 43.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5380 SDtfs, 9494 SDslu, 23490 SDs, 0 SdLazy, 24399 SolverSat, 584 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 706 GetRequests, 167 SyntacticMatches, 101 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4051 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111273occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 34.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 251344 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1083 NumberOfCodeBlocks, 1083 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1003 ConstructedInterpolants, 0 QuantifiedInterpolants, 185380 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...