/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/safe002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:08:56,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:08:56,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:08:56,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:08:56,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:08:56,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:08:56,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:08:56,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:08:56,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:08:56,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:08:56,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:08:56,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:08:56,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:08:56,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:08:56,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:08:56,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:08:56,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:08:56,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:08:56,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:08:56,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:08:56,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:08:56,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:08:56,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:08:56,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:08:56,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:08:56,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:08:56,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:08:56,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:08:56,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:08:56,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:08:56,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:08:56,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:08:56,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:08:56,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:08:56,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:08:56,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:08:56,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:08:56,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:08:56,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:08:56,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:08:56,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:08:56,887 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:08:56,902 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:08:56,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:08:56,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:08:56,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:08:56,904 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:08:56,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:08:56,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:08:56,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:08:56,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:08:56,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:08:56,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:08:56,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:08:56,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:08:56,906 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:08:56,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:08:56,906 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:08:56,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:08:56,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:08:56,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:08:56,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:08:56,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:08:56,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:08:56,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:08:56,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:08:56,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:08:56,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:08:56,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:08:56,908 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:08:56,909 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:08:56,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:08:56,909 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:08:56,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:08:57,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:08:57,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:08:57,206 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:08:57,207 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:08:57,208 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:08:57,209 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i [2019-12-27 22:08:57,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e723f461e/6234b59501864101b9c767ee3ec10cc7/FLAG45ae26a2e [2019-12-27 22:08:57,888 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:08:57,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i [2019-12-27 22:08:57,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e723f461e/6234b59501864101b9c767ee3ec10cc7/FLAG45ae26a2e [2019-12-27 22:08:58,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e723f461e/6234b59501864101b9c767ee3ec10cc7 [2019-12-27 22:08:58,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:08:58,173 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:08:58,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:08:58,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:08:58,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:08:58,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:08:58" (1/1) ... [2019-12-27 22:08:58,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5046e964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:08:58, skipping insertion in model container [2019-12-27 22:08:58,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:08:58" (1/1) ... [2019-12-27 22:08:58,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:08:58,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:08:58,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:08:58,777 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:08:58,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:08:58,922 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:08:58,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:08:58 WrapperNode [2019-12-27 22:08:58,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:08:58,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:08:58,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:08:58,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:08:58,933 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:08:58" (1/1) ... [2019-12-27 22:08:58,953 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:08:58" (1/1) ... [2019-12-27 22:08:58,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:08:58,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:08:58,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:08:58,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:08:58,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:08:58" (1/1) ... [2019-12-27 22:08:58,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:08:58" (1/1) ... [2019-12-27 22:08:58,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:08:58" (1/1) ... [2019-12-27 22:08:59,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:08:58" (1/1) ... [2019-12-27 22:08:59,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:08:58" (1/1) ... [2019-12-27 22:08:59,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:08:58" (1/1) ... [2019-12-27 22:08:59,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:08:58" (1/1) ... [2019-12-27 22:08:59,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:08:59,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:08:59,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:08:59,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:08:59,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:08:58" (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:08:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:08:59,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:08:59,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:08:59,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:08:59,110 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:08:59,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:08:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:08:59,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:08:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:08:59,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:08:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:08:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:08:59,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:08:59,114 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:08:59,831 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:08:59,832 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:08:59,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:08:59 BoogieIcfgContainer [2019-12-27 22:08:59,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:08:59,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:08:59,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:08:59,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:08:59,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:08:58" (1/3) ... [2019-12-27 22:08:59,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28141513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:08:59, skipping insertion in model container [2019-12-27 22:08:59,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:08:58" (2/3) ... [2019-12-27 22:08:59,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28141513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:08:59, skipping insertion in model container [2019-12-27 22:08:59,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:08:59" (3/3) ... [2019-12-27 22:08:59,843 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_power.opt.i [2019-12-27 22:08:59,854 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:08:59,855 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:08:59,866 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:08:59,867 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:08:59,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,931 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,932 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,966 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,966 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,971 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,972 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,989 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,989 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:08:59,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,000 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,001 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,001 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,011 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:00,052 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:09:00,072 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:09:00,073 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:09:00,073 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:09:00,073 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:09:00,073 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:09:00,073 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:09:00,073 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:09:00,073 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:09:00,088 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 22:09:00,090 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:09:00,187 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:09:00,187 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:09:00,202 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:09:00,227 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:09:00,325 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:09:00,325 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:09:00,335 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:09:00,361 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:09:00,363 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:09:04,186 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:09:04,314 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:09:04,338 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75395 [2019-12-27 22:09:04,338 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 22:09:04,342 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-27 22:09:17,292 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89162 states. [2019-12-27 22:09:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 89162 states. [2019-12-27 22:09:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:09:17,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:17,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:09:17,300 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:09:17,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:17,305 INFO L82 PathProgramCache]: Analyzing trace with hash 795562218, now seen corresponding path program 1 times [2019-12-27 22:09:17,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:17,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590356814] [2019-12-27 22:09:17,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:09:17,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590356814] [2019-12-27 22:09:17,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:17,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:09:17,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1833905423] [2019-12-27 22:09:17,522 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:17,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:17,540 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:09:17,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:17,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:09:17,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:09:17,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:17,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:09:17,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:09:17,563 INFO L87 Difference]: Start difference. First operand 89162 states. Second operand 3 states. [2019-12-27 22:09:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:19,531 INFO L93 Difference]: Finished difference Result 87552 states and 377777 transitions. [2019-12-27 22:09:19,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:09:19,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:09:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:20,132 INFO L225 Difference]: With dead ends: 87552 [2019-12-27 22:09:20,132 INFO L226 Difference]: Without dead ends: 82092 [2019-12-27 22:09:20,140 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:09:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82092 states. [2019-12-27 22:09:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82092 to 82092. [2019-12-27 22:09:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82092 states. [2019-12-27 22:09:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82092 states to 82092 states and 353697 transitions. [2019-12-27 22:09:27,813 INFO L78 Accepts]: Start accepts. Automaton has 82092 states and 353697 transitions. Word has length 5 [2019-12-27 22:09:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:27,814 INFO L462 AbstractCegarLoop]: Abstraction has 82092 states and 353697 transitions. [2019-12-27 22:09:27,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:09:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 82092 states and 353697 transitions. [2019-12-27 22:09:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:09:27,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:27,823 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:09:27,823 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:09:27,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:27,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1486977711, now seen corresponding path program 1 times [2019-12-27 22:09:27,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:27,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037735863] [2019-12-27 22:09:27,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:27,930 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:09:27,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037735863] [2019-12-27 22:09:27,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:27,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:09:27,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1064877973] [2019-12-27 22:09:27,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:27,932 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:27,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:09:27,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:27,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:09:27,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:09:27,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:27,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:09:27,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:09:27,940 INFO L87 Difference]: Start difference. First operand 82092 states and 353697 transitions. Second operand 3 states. [2019-12-27 22:09:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:28,237 INFO L93 Difference]: Finished difference Result 21487 states and 74397 transitions. [2019-12-27 22:09:28,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:09:28,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:09:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:28,362 INFO L225 Difference]: With dead ends: 21487 [2019-12-27 22:09:28,362 INFO L226 Difference]: Without dead ends: 21487 [2019-12-27 22:09:28,363 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:09:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21487 states. [2019-12-27 22:09:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21487 to 21487. [2019-12-27 22:09:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21487 states. [2019-12-27 22:09:31,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21487 states to 21487 states and 74397 transitions. [2019-12-27 22:09:31,895 INFO L78 Accepts]: Start accepts. Automaton has 21487 states and 74397 transitions. Word has length 13 [2019-12-27 22:09:31,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:31,896 INFO L462 AbstractCegarLoop]: Abstraction has 21487 states and 74397 transitions. [2019-12-27 22:09:31,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:09:31,896 INFO L276 IsEmpty]: Start isEmpty. Operand 21487 states and 74397 transitions. [2019-12-27 22:09:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:09:31,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:31,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:09:31,898 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:09:31,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:31,899 INFO L82 PathProgramCache]: Analyzing trace with hash -726251993, now seen corresponding path program 1 times [2019-12-27 22:09:31,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:31,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708535057] [2019-12-27 22:09:31,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:31,983 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:09:31,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708535057] [2019-12-27 22:09:31,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:31,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:09:31,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2005134686] [2019-12-27 22:09:31,985 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:31,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:31,989 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:09:31,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:31,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:09:31,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:09:31,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:31,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:09:31,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:09:31,990 INFO L87 Difference]: Start difference. First operand 21487 states and 74397 transitions. Second operand 4 states. [2019-12-27 22:09:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:32,434 INFO L93 Difference]: Finished difference Result 31642 states and 105483 transitions. [2019-12-27 22:09:32,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:09:32,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:09:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:32,530 INFO L225 Difference]: With dead ends: 31642 [2019-12-27 22:09:32,531 INFO L226 Difference]: Without dead ends: 31628 [2019-12-27 22:09:32,531 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:09:32,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31628 states. [2019-12-27 22:09:33,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31628 to 28614. [2019-12-27 22:09:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28614 states. [2019-12-27 22:09:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28614 states to 28614 states and 96383 transitions. [2019-12-27 22:09:33,475 INFO L78 Accepts]: Start accepts. Automaton has 28614 states and 96383 transitions. Word has length 13 [2019-12-27 22:09:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:33,475 INFO L462 AbstractCegarLoop]: Abstraction has 28614 states and 96383 transitions. [2019-12-27 22:09:33,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:09:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 28614 states and 96383 transitions. [2019-12-27 22:09:33,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:09:33,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:33,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:09:33,481 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:09:33,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:33,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1448024626, now seen corresponding path program 1 times [2019-12-27 22:09:33,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:33,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859794724] [2019-12-27 22:09:33,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:33,914 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:09:33,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859794724] [2019-12-27 22:09:33,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:33,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:09:33,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2038639068] [2019-12-27 22:09:33,915 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:33,919 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:33,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:09:33,926 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:33,998 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:09:33,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:09:33,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:33,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:09:33,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:09:33,999 INFO L87 Difference]: Start difference. First operand 28614 states and 96383 transitions. Second operand 7 states. [2019-12-27 22:09:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:34,707 INFO L93 Difference]: Finished difference Result 41448 states and 137006 transitions. [2019-12-27 22:09:34,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:09:34,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 22:09:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:34,812 INFO L225 Difference]: With dead ends: 41448 [2019-12-27 22:09:34,813 INFO L226 Difference]: Without dead ends: 41430 [2019-12-27 22:09:34,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:09:35,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41430 states. [2019-12-27 22:09:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41430 to 32619. [2019-12-27 22:09:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32619 states. [2019-12-27 22:09:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32619 states to 32619 states and 109205 transitions. [2019-12-27 22:09:35,650 INFO L78 Accepts]: Start accepts. Automaton has 32619 states and 109205 transitions. Word has length 14 [2019-12-27 22:09:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:35,651 INFO L462 AbstractCegarLoop]: Abstraction has 32619 states and 109205 transitions. [2019-12-27 22:09:35,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:09:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 32619 states and 109205 transitions. [2019-12-27 22:09:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:09:35,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:35,662 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:09:35,662 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:09:35,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:35,662 INFO L82 PathProgramCache]: Analyzing trace with hash -84735485, now seen corresponding path program 1 times [2019-12-27 22:09:35,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:35,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629617658] [2019-12-27 22:09:35,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:35,756 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:09:35,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629617658] [2019-12-27 22:09:35,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:35,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:09:35,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [904654347] [2019-12-27 22:09:35,758 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:35,762 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:35,775 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 92 transitions. [2019-12-27 22:09:35,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:35,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:09:35,931 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:09:35,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:09:35,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:35,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:09:35,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:09:35,933 INFO L87 Difference]: Start difference. First operand 32619 states and 109205 transitions. Second operand 9 states. [2019-12-27 22:09:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:38,468 INFO L93 Difference]: Finished difference Result 95957 states and 313890 transitions. [2019-12-27 22:09:38,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 22:09:38,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 22:09:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:38,659 INFO L225 Difference]: With dead ends: 95957 [2019-12-27 22:09:38,659 INFO L226 Difference]: Without dead ends: 95920 [2019-12-27 22:09:38,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:09:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95920 states. [2019-12-27 22:09:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95920 to 45667. [2019-12-27 22:09:40,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45667 states. [2019-12-27 22:09:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45667 states to 45667 states and 152523 transitions. [2019-12-27 22:09:40,378 INFO L78 Accepts]: Start accepts. Automaton has 45667 states and 152523 transitions. Word has length 22 [2019-12-27 22:09:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:40,379 INFO L462 AbstractCegarLoop]: Abstraction has 45667 states and 152523 transitions. [2019-12-27 22:09:40,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:09:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 45667 states and 152523 transitions. [2019-12-27 22:09:40,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:09:40,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:40,394 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:09:40,394 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:09:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:40,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1284284063, now seen corresponding path program 2 times [2019-12-27 22:09:40,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:40,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986019966] [2019-12-27 22:09:40,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:40,480 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:09:40,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986019966] [2019-12-27 22:09:40,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:40,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:09:40,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [873220224] [2019-12-27 22:09:40,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:40,485 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:40,494 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 54 transitions. [2019-12-27 22:09:40,494 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:40,494 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:09:40,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:09:40,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:40,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:09:40,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:09:40,495 INFO L87 Difference]: Start difference. First operand 45667 states and 152523 transitions. Second operand 6 states. [2019-12-27 22:09:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:41,406 INFO L93 Difference]: Finished difference Result 70268 states and 228147 transitions. [2019-12-27 22:09:41,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:09:41,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:09:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:41,537 INFO L225 Difference]: With dead ends: 70268 [2019-12-27 22:09:41,537 INFO L226 Difference]: Without dead ends: 70238 [2019-12-27 22:09:41,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:09:41,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70238 states. [2019-12-27 22:09:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70238 to 43394. [2019-12-27 22:09:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43394 states. [2019-12-27 22:09:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43394 states to 43394 states and 144865 transitions. [2019-12-27 22:09:43,014 INFO L78 Accepts]: Start accepts. Automaton has 43394 states and 144865 transitions. Word has length 22 [2019-12-27 22:09:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:43,015 INFO L462 AbstractCegarLoop]: Abstraction has 43394 states and 144865 transitions. [2019-12-27 22:09:43,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:09:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 43394 states and 144865 transitions. [2019-12-27 22:09:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:09:43,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:43,031 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:09:43,031 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:09:43,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:43,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1211743988, now seen corresponding path program 1 times [2019-12-27 22:09:43,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:43,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945415418] [2019-12-27 22:09:43,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:09:43,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945415418] [2019-12-27 22:09:43,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:43,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:09:43,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2075631133] [2019-12-27 22:09:43,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:43,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:43,088 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:09:43,089 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:43,089 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:09:43,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:09:43,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:43,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:09:43,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:09:43,090 INFO L87 Difference]: Start difference. First operand 43394 states and 144865 transitions. Second operand 4 states. [2019-12-27 22:09:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:43,188 INFO L93 Difference]: Finished difference Result 17171 states and 53607 transitions. [2019-12-27 22:09:43,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:09:43,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:09:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:43,222 INFO L225 Difference]: With dead ends: 17171 [2019-12-27 22:09:43,222 INFO L226 Difference]: Without dead ends: 17171 [2019-12-27 22:09:43,223 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:09:43,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17171 states. [2019-12-27 22:09:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17171 to 17057. [2019-12-27 22:09:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17057 states. [2019-12-27 22:09:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17057 states to 17057 states and 53270 transitions. [2019-12-27 22:09:43,507 INFO L78 Accepts]: Start accepts. Automaton has 17057 states and 53270 transitions. Word has length 25 [2019-12-27 22:09:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:43,507 INFO L462 AbstractCegarLoop]: Abstraction has 17057 states and 53270 transitions. [2019-12-27 22:09:43,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:09:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 17057 states and 53270 transitions. [2019-12-27 22:09:43,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:09:43,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:43,533 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:09:43,534 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:09:43,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:43,534 INFO L82 PathProgramCache]: Analyzing trace with hash 261453908, now seen corresponding path program 1 times [2019-12-27 22:09:43,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:43,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308948537] [2019-12-27 22:09:43,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:43,594 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:09:43,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308948537] [2019-12-27 22:09:43,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:43,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:09:43,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [968789189] [2019-12-27 22:09:43,595 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:43,603 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:43,635 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 143 transitions. [2019-12-27 22:09:43,635 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:43,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:09:43,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:09:43,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:43,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:09:43,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:09:43,637 INFO L87 Difference]: Start difference. First operand 17057 states and 53270 transitions. Second operand 3 states. [2019-12-27 22:09:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:43,705 INFO L93 Difference]: Finished difference Result 17056 states and 53268 transitions. [2019-12-27 22:09:43,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:09:43,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 22:09:43,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:43,731 INFO L225 Difference]: With dead ends: 17056 [2019-12-27 22:09:43,732 INFO L226 Difference]: Without dead ends: 17056 [2019-12-27 22:09:43,732 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:09:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17056 states. [2019-12-27 22:09:43,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17056 to 17056. [2019-12-27 22:09:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17056 states. [2019-12-27 22:09:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17056 states to 17056 states and 53268 transitions. [2019-12-27 22:09:43,986 INFO L78 Accepts]: Start accepts. Automaton has 17056 states and 53268 transitions. Word has length 39 [2019-12-27 22:09:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:43,987 INFO L462 AbstractCegarLoop]: Abstraction has 17056 states and 53268 transitions. [2019-12-27 22:09:43,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:09:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 17056 states and 53268 transitions. [2019-12-27 22:09:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:09:44,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:44,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:09:44,021 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:09:44,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:44,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1879938010, now seen corresponding path program 1 times [2019-12-27 22:09:44,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:44,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249629232] [2019-12-27 22:09:44,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:09:44,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249629232] [2019-12-27 22:09:44,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:44,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:09:44,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [985094636] [2019-12-27 22:09:44,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:44,092 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:44,145 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 162 transitions. [2019-12-27 22:09:44,145 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:44,147 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:09:44,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:09:44,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:44,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:09:44,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:09:44,148 INFO L87 Difference]: Start difference. First operand 17056 states and 53268 transitions. Second operand 5 states. [2019-12-27 22:09:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:44,221 INFO L93 Difference]: Finished difference Result 15547 states and 49413 transitions. [2019-12-27 22:09:44,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:09:44,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 22:09:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:44,246 INFO L225 Difference]: With dead ends: 15547 [2019-12-27 22:09:44,246 INFO L226 Difference]: Without dead ends: 15547 [2019-12-27 22:09:44,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:09:44,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15547 states. [2019-12-27 22:09:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15547 to 14745. [2019-12-27 22:09:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14745 states. [2019-12-27 22:09:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14745 states to 14745 states and 47130 transitions. [2019-12-27 22:09:44,595 INFO L78 Accepts]: Start accepts. Automaton has 14745 states and 47130 transitions. Word has length 40 [2019-12-27 22:09:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:44,596 INFO L462 AbstractCegarLoop]: Abstraction has 14745 states and 47130 transitions. [2019-12-27 22:09:44,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:09:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 14745 states and 47130 transitions. [2019-12-27 22:09:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:09:44,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:44,620 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:09:44,621 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:09:44,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:44,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1466334831, now seen corresponding path program 1 times [2019-12-27 22:09:44,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:44,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582248628] [2019-12-27 22:09:44,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:44,684 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:09:44,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582248628] [2019-12-27 22:09:44,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:44,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:09:44,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1410129331] [2019-12-27 22:09:44,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:44,703 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:44,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 464 transitions. [2019-12-27 22:09:44,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:44,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:09:44,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:09:44,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:44,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:09:44,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:09:44,894 INFO L87 Difference]: Start difference. First operand 14745 states and 47130 transitions. Second operand 4 states. [2019-12-27 22:09:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:45,013 INFO L93 Difference]: Finished difference Result 19067 states and 60812 transitions. [2019-12-27 22:09:45,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:09:45,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:09:45,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:45,041 INFO L225 Difference]: With dead ends: 19067 [2019-12-27 22:09:45,041 INFO L226 Difference]: Without dead ends: 19067 [2019-12-27 22:09:45,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:09:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19067 states. [2019-12-27 22:09:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19067 to 12453. [2019-12-27 22:09:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12453 states. [2019-12-27 22:09:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12453 states to 12453 states and 39920 transitions. [2019-12-27 22:09:45,289 INFO L78 Accepts]: Start accepts. Automaton has 12453 states and 39920 transitions. Word has length 54 [2019-12-27 22:09:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:45,289 INFO L462 AbstractCegarLoop]: Abstraction has 12453 states and 39920 transitions. [2019-12-27 22:09:45,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:09:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 12453 states and 39920 transitions. [2019-12-27 22:09:45,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:09:45,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:45,306 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:09:45,306 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:09:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:45,306 INFO L82 PathProgramCache]: Analyzing trace with hash 81383116, now seen corresponding path program 1 times [2019-12-27 22:09:45,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:45,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766852877] [2019-12-27 22:09:45,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:45,385 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:09:45,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766852877] [2019-12-27 22:09:45,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:45,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:09:45,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [725374286] [2019-12-27 22:09:45,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:45,404 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:45,727 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 328 states and 708 transitions. [2019-12-27 22:09:45,727 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:45,729 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:09:45,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:09:45,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:45,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:09:45,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:09:45,730 INFO L87 Difference]: Start difference. First operand 12453 states and 39920 transitions. Second operand 4 states. [2019-12-27 22:09:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:45,858 INFO L93 Difference]: Finished difference Result 23822 states and 76579 transitions. [2019-12-27 22:09:45,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:09:45,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:09:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:45,883 INFO L225 Difference]: With dead ends: 23822 [2019-12-27 22:09:45,883 INFO L226 Difference]: Without dead ends: 11678 [2019-12-27 22:09:45,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:09:46,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11678 states. [2019-12-27 22:09:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11678 to 11678. [2019-12-27 22:09:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11678 states. [2019-12-27 22:09:46,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11678 states to 11678 states and 37549 transitions. [2019-12-27 22:09:46,182 INFO L78 Accepts]: Start accepts. Automaton has 11678 states and 37549 transitions. Word has length 54 [2019-12-27 22:09:46,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:46,182 INFO L462 AbstractCegarLoop]: Abstraction has 11678 states and 37549 transitions. [2019-12-27 22:09:46,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:09:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 11678 states and 37549 transitions. [2019-12-27 22:09:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:09:46,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:46,197 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:09:46,197 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:09:46,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:46,197 INFO L82 PathProgramCache]: Analyzing trace with hash -886395566, now seen corresponding path program 2 times [2019-12-27 22:09:46,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:46,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141844151] [2019-12-27 22:09:46,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:46,270 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:09:46,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141844151] [2019-12-27 22:09:46,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:46,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:09:46,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1111482692] [2019-12-27 22:09:46,271 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:46,289 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:46,490 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 295 states and 622 transitions. [2019-12-27 22:09:46,490 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:46,545 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:09:46,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:09:46,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:46,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:09:46,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:09:46,546 INFO L87 Difference]: Start difference. First operand 11678 states and 37549 transitions. Second operand 6 states. [2019-12-27 22:09:46,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:46,706 INFO L93 Difference]: Finished difference Result 33223 states and 107349 transitions. [2019-12-27 22:09:46,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:09:46,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 22:09:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:46,721 INFO L225 Difference]: With dead ends: 33223 [2019-12-27 22:09:46,721 INFO L226 Difference]: Without dead ends: 6909 [2019-12-27 22:09:46,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:09:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6909 states. [2019-12-27 22:09:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6909 to 6909. [2019-12-27 22:09:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6909 states. [2019-12-27 22:09:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6909 states to 6909 states and 22371 transitions. [2019-12-27 22:09:46,862 INFO L78 Accepts]: Start accepts. Automaton has 6909 states and 22371 transitions. Word has length 54 [2019-12-27 22:09:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:46,862 INFO L462 AbstractCegarLoop]: Abstraction has 6909 states and 22371 transitions. [2019-12-27 22:09:46,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:09:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 6909 states and 22371 transitions. [2019-12-27 22:09:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:09:46,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:46,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:09:46,871 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:09:46,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:46,871 INFO L82 PathProgramCache]: Analyzing trace with hash 139987658, now seen corresponding path program 3 times [2019-12-27 22:09:46,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:46,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901826566] [2019-12-27 22:09:46,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:46,954 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:09:46,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901826566] [2019-12-27 22:09:46,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:46,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:09:46,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2061030273] [2019-12-27 22:09:46,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:46,973 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:47,207 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 425 transitions. [2019-12-27 22:09:47,207 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:47,309 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 22:09:47,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:09:47,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:47,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:09:47,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:09:47,311 INFO L87 Difference]: Start difference. First operand 6909 states and 22371 transitions. Second operand 8 states. [2019-12-27 22:09:47,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:47,610 INFO L93 Difference]: Finished difference Result 11531 states and 37278 transitions. [2019-12-27 22:09:47,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:09:47,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 22:09:47,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:47,628 INFO L225 Difference]: With dead ends: 11531 [2019-12-27 22:09:47,629 INFO L226 Difference]: Without dead ends: 8881 [2019-12-27 22:09:47,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:09:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8881 states. [2019-12-27 22:09:47,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8881 to 8116. [2019-12-27 22:09:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8116 states. [2019-12-27 22:09:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8116 states to 8116 states and 26358 transitions. [2019-12-27 22:09:47,859 INFO L78 Accepts]: Start accepts. Automaton has 8116 states and 26358 transitions. Word has length 54 [2019-12-27 22:09:47,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:47,859 INFO L462 AbstractCegarLoop]: Abstraction has 8116 states and 26358 transitions. [2019-12-27 22:09:47,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:09:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 8116 states and 26358 transitions. [2019-12-27 22:09:47,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:09:47,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:47,873 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:09:47,873 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:09:47,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:47,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1645888394, now seen corresponding path program 4 times [2019-12-27 22:09:47,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:47,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028045271] [2019-12-27 22:09:47,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:09:48,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028045271] [2019-12-27 22:09:48,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:48,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:09:48,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [356975551] [2019-12-27 22:09:48,014 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:48,031 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:48,209 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 464 transitions. [2019-12-27 22:09:48,210 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:48,352 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:09:48,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:09:48,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:48,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:09:48,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:09:48,353 INFO L87 Difference]: Start difference. First operand 8116 states and 26358 transitions. Second operand 11 states. [2019-12-27 22:09:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:49,580 INFO L93 Difference]: Finished difference Result 17718 states and 56640 transitions. [2019-12-27 22:09:49,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:09:49,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 22:09:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:49,602 INFO L225 Difference]: With dead ends: 17718 [2019-12-27 22:09:49,602 INFO L226 Difference]: Without dead ends: 13078 [2019-12-27 22:09:49,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:09:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13078 states. [2019-12-27 22:09:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13078 to 9638. [2019-12-27 22:09:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9638 states. [2019-12-27 22:09:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 31057 transitions. [2019-12-27 22:09:49,784 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 31057 transitions. Word has length 54 [2019-12-27 22:09:49,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:49,784 INFO L462 AbstractCegarLoop]: Abstraction has 9638 states and 31057 transitions. [2019-12-27 22:09:49,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:09:49,784 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 31057 transitions. [2019-12-27 22:09:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:09:49,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:49,796 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:09:49,797 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:09:49,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:49,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1656812138, now seen corresponding path program 5 times [2019-12-27 22:09:49,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:49,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181304657] [2019-12-27 22:09:49,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:49,888 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:09:49,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181304657] [2019-12-27 22:09:49,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:49,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:09:49,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [563014347] [2019-12-27 22:09:49,890 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:49,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:50,064 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 358 transitions. [2019-12-27 22:09:50,064 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:50,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 22:09:50,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:09:50,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:50,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:09:50,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:09:50,368 INFO L87 Difference]: Start difference. First operand 9638 states and 31057 transitions. Second operand 10 states. [2019-12-27 22:09:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:52,674 INFO L93 Difference]: Finished difference Result 45814 states and 142264 transitions. [2019-12-27 22:09:52,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 22:09:52,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:09:52,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:52,724 INFO L225 Difference]: With dead ends: 45814 [2019-12-27 22:09:52,724 INFO L226 Difference]: Without dead ends: 34428 [2019-12-27 22:09:52,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2019-12-27 22:09:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34428 states. [2019-12-27 22:09:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34428 to 11386. [2019-12-27 22:09:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11386 states. [2019-12-27 22:09:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11386 states to 11386 states and 36608 transitions. [2019-12-27 22:09:53,064 INFO L78 Accepts]: Start accepts. Automaton has 11386 states and 36608 transitions. Word has length 54 [2019-12-27 22:09:53,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:53,064 INFO L462 AbstractCegarLoop]: Abstraction has 11386 states and 36608 transitions. [2019-12-27 22:09:53,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:09:53,064 INFO L276 IsEmpty]: Start isEmpty. Operand 11386 states and 36608 transitions. [2019-12-27 22:09:53,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:09:53,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:53,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:09:53,081 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:09:53,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:53,081 INFO L82 PathProgramCache]: Analyzing trace with hash -434377068, now seen corresponding path program 6 times [2019-12-27 22:09:53,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:53,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157716013] [2019-12-27 22:09:53,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:53,200 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:09:53,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157716013] [2019-12-27 22:09:53,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:53,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:09:53,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2128322077] [2019-12-27 22:09:53,202 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:53,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:53,357 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 403 transitions. [2019-12-27 22:09:53,357 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:53,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:09:53,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:09:53,574 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 22:09:53,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:09:53,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:53,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:09:53,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:09:53,575 INFO L87 Difference]: Start difference. First operand 11386 states and 36608 transitions. Second operand 13 states. [2019-12-27 22:09:56,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:56,478 INFO L93 Difference]: Finished difference Result 45595 states and 140484 transitions. [2019-12-27 22:09:56,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 22:09:56,478 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 22:09:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:56,551 INFO L225 Difference]: With dead ends: 45595 [2019-12-27 22:09:56,551 INFO L226 Difference]: Without dead ends: 45511 [2019-12-27 22:09:56,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2019-12-27 22:09:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45511 states. [2019-12-27 22:09:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45511 to 15102. [2019-12-27 22:09:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15102 states. [2019-12-27 22:09:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15102 states to 15102 states and 47525 transitions. [2019-12-27 22:09:57,217 INFO L78 Accepts]: Start accepts. Automaton has 15102 states and 47525 transitions. Word has length 54 [2019-12-27 22:09:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:09:57,217 INFO L462 AbstractCegarLoop]: Abstraction has 15102 states and 47525 transitions. [2019-12-27 22:09:57,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:09:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 15102 states and 47525 transitions. [2019-12-27 22:09:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:09:57,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:09:57,233 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:09:57,233 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:09:57,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:09:57,234 INFO L82 PathProgramCache]: Analyzing trace with hash -458785952, now seen corresponding path program 7 times [2019-12-27 22:09:57,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:09:57,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036171391] [2019-12-27 22:09:57,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:09:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:09:57,345 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:09:57,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036171391] [2019-12-27 22:09:57,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:09:57,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:09:57,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462651979] [2019-12-27 22:09:57,346 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:09:57,361 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:09:57,608 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 408 transitions. [2019-12-27 22:09:57,608 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:09:57,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:09:57,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:09:57,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:09:57,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:09:57,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:09:57,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:09:57,884 INFO L87 Difference]: Start difference. First operand 15102 states and 47525 transitions. Second operand 11 states. [2019-12-27 22:09:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:09:59,704 INFO L93 Difference]: Finished difference Result 27392 states and 84039 transitions. [2019-12-27 22:09:59,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 22:09:59,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 22:09:59,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:09:59,746 INFO L225 Difference]: With dead ends: 27392 [2019-12-27 22:09:59,746 INFO L226 Difference]: Without dead ends: 27282 [2019-12-27 22:09:59,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:09:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27282 states. [2019-12-27 22:10:00,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27282 to 20082. [2019-12-27 22:10:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20082 states. [2019-12-27 22:10:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20082 states to 20082 states and 62583 transitions. [2019-12-27 22:10:00,133 INFO L78 Accepts]: Start accepts. Automaton has 20082 states and 62583 transitions. Word has length 54 [2019-12-27 22:10:00,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:00,134 INFO L462 AbstractCegarLoop]: Abstraction has 20082 states and 62583 transitions. [2019-12-27 22:10:00,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:10:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 20082 states and 62583 transitions. [2019-12-27 22:10:00,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:10:00,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:00,163 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:10:00,164 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:10:00,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:00,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2051129792, now seen corresponding path program 8 times [2019-12-27 22:10:00,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:00,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464750459] [2019-12-27 22:10:00,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:00,218 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:10:00,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464750459] [2019-12-27 22:10:00,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:00,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:10:00,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1175398844] [2019-12-27 22:10:00,220 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:00,234 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:00,419 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 335 transitions. [2019-12-27 22:10:00,419 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:00,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:10:00,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:10:00,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:00,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:10:00,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:10:00,434 INFO L87 Difference]: Start difference. First operand 20082 states and 62583 transitions. Second operand 4 states. [2019-12-27 22:10:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:00,667 INFO L93 Difference]: Finished difference Result 19276 states and 58903 transitions. [2019-12-27 22:10:00,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:10:00,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:10:00,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:00,696 INFO L225 Difference]: With dead ends: 19276 [2019-12-27 22:10:00,696 INFO L226 Difference]: Without dead ends: 19276 [2019-12-27 22:10:00,696 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:10:00,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19276 states. [2019-12-27 22:10:01,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19276 to 14152. [2019-12-27 22:10:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14152 states. [2019-12-27 22:10:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14152 states to 14152 states and 43541 transitions. [2019-12-27 22:10:01,072 INFO L78 Accepts]: Start accepts. Automaton has 14152 states and 43541 transitions. Word has length 54 [2019-12-27 22:10:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:01,073 INFO L462 AbstractCegarLoop]: Abstraction has 14152 states and 43541 transitions. [2019-12-27 22:10:01,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:10:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 14152 states and 43541 transitions. [2019-12-27 22:10:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:10:01,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:01,088 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:10:01,088 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:10:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:01,088 INFO L82 PathProgramCache]: Analyzing trace with hash -318791943, now seen corresponding path program 1 times [2019-12-27 22:10:01,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:01,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149282903] [2019-12-27 22:10:01,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:01,191 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:10:01,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149282903] [2019-12-27 22:10:01,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:01,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:10:01,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1171497137] [2019-12-27 22:10:01,192 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:01,208 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:01,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 414 transitions. [2019-12-27 22:10:01,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:01,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:10:01,658 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 22:10:01,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:10:01,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:01,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:10:01,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:10:01,659 INFO L87 Difference]: Start difference. First operand 14152 states and 43541 transitions. Second operand 13 states. [2019-12-27 22:10:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:03,203 INFO L93 Difference]: Finished difference Result 20200 states and 60191 transitions. [2019-12-27 22:10:03,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 22:10:03,204 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-27 22:10:03,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:03,234 INFO L225 Difference]: With dead ends: 20200 [2019-12-27 22:10:03,235 INFO L226 Difference]: Without dead ends: 20092 [2019-12-27 22:10:03,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:10:03,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20092 states. [2019-12-27 22:10:03,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20092 to 14962. [2019-12-27 22:10:03,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14962 states. [2019-12-27 22:10:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14962 states to 14962 states and 45834 transitions. [2019-12-27 22:10:03,528 INFO L78 Accepts]: Start accepts. Automaton has 14962 states and 45834 transitions. Word has length 55 [2019-12-27 22:10:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:03,528 INFO L462 AbstractCegarLoop]: Abstraction has 14962 states and 45834 transitions. [2019-12-27 22:10:03,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:10:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 14962 states and 45834 transitions. [2019-12-27 22:10:03,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:10:03,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:03,545 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:10:03,545 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:10:03,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:03,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1048892077, now seen corresponding path program 2 times [2019-12-27 22:10:03,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:03,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883484052] [2019-12-27 22:10:03,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:03,711 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:10:03,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883484052] [2019-12-27 22:10:03,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:03,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:10:03,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1547200319] [2019-12-27 22:10:03,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:03,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:03,848 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 175 states and 323 transitions. [2019-12-27 22:10:03,848 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:04,012 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:10:04,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:10:04,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:04,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:10:04,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:10:04,013 INFO L87 Difference]: Start difference. First operand 14962 states and 45834 transitions. Second operand 13 states. [2019-12-27 22:10:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:05,468 INFO L93 Difference]: Finished difference Result 21999 states and 66644 transitions. [2019-12-27 22:10:05,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:10:05,468 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-27 22:10:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:05,493 INFO L225 Difference]: With dead ends: 21999 [2019-12-27 22:10:05,493 INFO L226 Difference]: Without dead ends: 16508 [2019-12-27 22:10:05,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-27 22:10:05,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16508 states. [2019-12-27 22:10:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16508 to 15313. [2019-12-27 22:10:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15313 states. [2019-12-27 22:10:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15313 states to 15313 states and 46704 transitions. [2019-12-27 22:10:05,847 INFO L78 Accepts]: Start accepts. Automaton has 15313 states and 46704 transitions. Word has length 55 [2019-12-27 22:10:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:05,848 INFO L462 AbstractCegarLoop]: Abstraction has 15313 states and 46704 transitions. [2019-12-27 22:10:05,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:10:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 15313 states and 46704 transitions. [2019-12-27 22:10:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:10:05,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:05,865 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:10:05,865 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:10:05,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:05,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1460850481, now seen corresponding path program 3 times [2019-12-27 22:10:05,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:05,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277357027] [2019-12-27 22:10:05,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:06,029 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:10:06,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277357027] [2019-12-27 22:10:06,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:06,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:10:06,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2015528869] [2019-12-27 22:10:06,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:06,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:06,184 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 247 transitions. [2019-12-27 22:10:06,184 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:06,555 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 22:10:06,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:10:06,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:06,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:10:06,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:10:06,556 INFO L87 Difference]: Start difference. First operand 15313 states and 46704 transitions. Second operand 15 states. [2019-12-27 22:10:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:09,277 INFO L93 Difference]: Finished difference Result 31353 states and 93632 transitions. [2019-12-27 22:10:09,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 22:10:09,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-27 22:10:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:09,316 INFO L225 Difference]: With dead ends: 31353 [2019-12-27 22:10:09,316 INFO L226 Difference]: Without dead ends: 25677 [2019-12-27 22:10:09,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=262, Invalid=1220, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 22:10:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25677 states. [2019-12-27 22:10:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25677 to 15762. [2019-12-27 22:10:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15762 states. [2019-12-27 22:10:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15762 states to 15762 states and 47731 transitions. [2019-12-27 22:10:09,637 INFO L78 Accepts]: Start accepts. Automaton has 15762 states and 47731 transitions. Word has length 55 [2019-12-27 22:10:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:09,637 INFO L462 AbstractCegarLoop]: Abstraction has 15762 states and 47731 transitions. [2019-12-27 22:10:09,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:10:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 15762 states and 47731 transitions. [2019-12-27 22:10:09,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:10:09,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:09,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:09,655 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:10:09,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:09,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1440625269, now seen corresponding path program 4 times [2019-12-27 22:10:09,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:09,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317296106] [2019-12-27 22:10:09,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:09,841 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:10:09,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317296106] [2019-12-27 22:10:09,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:09,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:10:09,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1711663583] [2019-12-27 22:10:09,842 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:09,858 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:10,010 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 269 transitions. [2019-12-27 22:10:10,011 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:10,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 22:10:10,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 22:10:10,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:10,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 22:10:10,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:10:10,599 INFO L87 Difference]: Start difference. First operand 15762 states and 47731 transitions. Second operand 17 states. [2019-12-27 22:10:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:13,076 INFO L93 Difference]: Finished difference Result 27423 states and 81835 transitions. [2019-12-27 22:10:13,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 22:10:13,077 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-27 22:10:13,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:13,111 INFO L225 Difference]: With dead ends: 27423 [2019-12-27 22:10:13,111 INFO L226 Difference]: Without dead ends: 24098 [2019-12-27 22:10:13,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 13 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=245, Invalid=1237, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 22:10:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24098 states. [2019-12-27 22:10:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24098 to 15435. [2019-12-27 22:10:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15435 states. [2019-12-27 22:10:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15435 states to 15435 states and 46790 transitions. [2019-12-27 22:10:13,426 INFO L78 Accepts]: Start accepts. Automaton has 15435 states and 46790 transitions. Word has length 55 [2019-12-27 22:10:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:13,426 INFO L462 AbstractCegarLoop]: Abstraction has 15435 states and 46790 transitions. [2019-12-27 22:10:13,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 22:10:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 15435 states and 46790 transitions. [2019-12-27 22:10:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:10:13,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:13,443 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:10:13,443 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:10:13,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:13,444 INFO L82 PathProgramCache]: Analyzing trace with hash 331505035, now seen corresponding path program 5 times [2019-12-27 22:10:13,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:13,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581959902] [2019-12-27 22:10:13,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:13,611 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:10:13,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581959902] [2019-12-27 22:10:13,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:13,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:10:13,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [771385120] [2019-12-27 22:10:13,612 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:13,621 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:13,705 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 227 transitions. [2019-12-27 22:10:13,705 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:14,187 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 22:10:14,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 22:10:14,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:14,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 22:10:14,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:10:14,188 INFO L87 Difference]: Start difference. First operand 15435 states and 46790 transitions. Second operand 20 states. [2019-12-27 22:10:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:22,816 INFO L93 Difference]: Finished difference Result 44185 states and 130160 transitions. [2019-12-27 22:10:22,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-12-27 22:10:22,817 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2019-12-27 22:10:22,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:22,877 INFO L225 Difference]: With dead ends: 44185 [2019-12-27 22:10:22,877 INFO L226 Difference]: Without dead ends: 41050 [2019-12-27 22:10:22,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 15 SyntacticMatches, 9 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5981 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1815, Invalid=14441, Unknown=0, NotChecked=0, Total=16256 [2019-12-27 22:10:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41050 states. [2019-12-27 22:10:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41050 to 21509. [2019-12-27 22:10:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21509 states. [2019-12-27 22:10:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21509 states to 21509 states and 64600 transitions. [2019-12-27 22:10:23,373 INFO L78 Accepts]: Start accepts. Automaton has 21509 states and 64600 transitions. Word has length 55 [2019-12-27 22:10:23,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:23,373 INFO L462 AbstractCegarLoop]: Abstraction has 21509 states and 64600 transitions. [2019-12-27 22:10:23,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 22:10:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 21509 states and 64600 transitions. [2019-12-27 22:10:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:10:23,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:23,399 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:10:23,399 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:10:23,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:23,399 INFO L82 PathProgramCache]: Analyzing trace with hash 975434899, now seen corresponding path program 6 times [2019-12-27 22:10:23,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:23,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273336073] [2019-12-27 22:10:23,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:23,457 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:10:23,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273336073] [2019-12-27 22:10:23,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:23,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:10:23,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2055327726] [2019-12-27 22:10:23,459 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:23,469 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:23,633 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 175 states and 321 transitions. [2019-12-27 22:10:23,634 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:23,634 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:23,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:10:23,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:23,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:10:23,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:10:23,637 INFO L87 Difference]: Start difference. First operand 21509 states and 64600 transitions. Second operand 3 states. [2019-12-27 22:10:23,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:23,737 INFO L93 Difference]: Finished difference Result 21509 states and 64598 transitions. [2019-12-27 22:10:23,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:10:23,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 22:10:23,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:23,774 INFO L225 Difference]: With dead ends: 21509 [2019-12-27 22:10:23,774 INFO L226 Difference]: Without dead ends: 21509 [2019-12-27 22:10:23,775 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:10:23,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21509 states. [2019-12-27 22:10:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21509 to 20246. [2019-12-27 22:10:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20246 states. [2019-12-27 22:10:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20246 states to 20246 states and 61317 transitions. [2019-12-27 22:10:24,093 INFO L78 Accepts]: Start accepts. Automaton has 20246 states and 61317 transitions. Word has length 55 [2019-12-27 22:10:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:24,094 INFO L462 AbstractCegarLoop]: Abstraction has 20246 states and 61317 transitions. [2019-12-27 22:10:24,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:10:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 20246 states and 61317 transitions. [2019-12-27 22:10:24,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:10:24,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:24,116 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:10:24,116 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:10:24,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:24,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1725340389, now seen corresponding path program 1 times [2019-12-27 22:10:24,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:24,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206482439] [2019-12-27 22:10:24,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:24,559 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:10:24,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206482439] [2019-12-27 22:10:24,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:24,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:10:24,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1141898752] [2019-12-27 22:10:24,560 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:24,568 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:24,814 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 420 transitions. [2019-12-27 22:10:24,814 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:25,380 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 22:10:25,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 22:10:25,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:25,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 22:10:25,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:10:25,381 INFO L87 Difference]: Start difference. First operand 20246 states and 61317 transitions. Second operand 24 states. [2019-12-27 22:10:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:29,371 INFO L93 Difference]: Finished difference Result 27565 states and 81717 transitions. [2019-12-27 22:10:29,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 22:10:29,371 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2019-12-27 22:10:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:29,411 INFO L225 Difference]: With dead ends: 27565 [2019-12-27 22:10:29,411 INFO L226 Difference]: Without dead ends: 25223 [2019-12-27 22:10:29,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=460, Invalid=2192, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 22:10:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25223 states. [2019-12-27 22:10:29,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25223 to 20752. [2019-12-27 22:10:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20752 states. [2019-12-27 22:10:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20752 states to 20752 states and 62515 transitions. [2019-12-27 22:10:29,752 INFO L78 Accepts]: Start accepts. Automaton has 20752 states and 62515 transitions. Word has length 56 [2019-12-27 22:10:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:29,752 INFO L462 AbstractCegarLoop]: Abstraction has 20752 states and 62515 transitions. [2019-12-27 22:10:29,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 22:10:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 20752 states and 62515 transitions. [2019-12-27 22:10:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:10:29,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:29,777 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:10:29,778 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:10:29,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:29,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1755725825, now seen corresponding path program 2 times [2019-12-27 22:10:29,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:29,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185404188] [2019-12-27 22:10:29,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:29,967 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:10:29,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185404188] [2019-12-27 22:10:29,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:29,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:10:29,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557674709] [2019-12-27 22:10:29,968 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:29,978 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:30,129 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 405 transitions. [2019-12-27 22:10:30,129 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:30,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:10:30,371 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 22:10:30,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:10:30,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:30,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:10:30,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:10:30,372 INFO L87 Difference]: Start difference. First operand 20752 states and 62515 transitions. Second operand 15 states. [2019-12-27 22:10:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:31,725 INFO L93 Difference]: Finished difference Result 22842 states and 68185 transitions. [2019-12-27 22:10:31,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:10:31,726 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 22:10:31,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:31,758 INFO L225 Difference]: With dead ends: 22842 [2019-12-27 22:10:31,758 INFO L226 Difference]: Without dead ends: 21880 [2019-12-27 22:10:31,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:10:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21880 states. [2019-12-27 22:10:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21880 to 20644. [2019-12-27 22:10:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20644 states. [2019-12-27 22:10:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20644 states to 20644 states and 62225 transitions. [2019-12-27 22:10:32,091 INFO L78 Accepts]: Start accepts. Automaton has 20644 states and 62225 transitions. Word has length 56 [2019-12-27 22:10:32,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:32,091 INFO L462 AbstractCegarLoop]: Abstraction has 20644 states and 62225 transitions. [2019-12-27 22:10:32,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:10:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 20644 states and 62225 transitions. [2019-12-27 22:10:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:10:32,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:32,114 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:10:32,115 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:10:32,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:32,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1747486899, now seen corresponding path program 3 times [2019-12-27 22:10:32,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:32,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408365465] [2019-12-27 22:10:32,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:10:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:10:32,220 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:10:32,221 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:10:32,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_43 0) (= 0 v_~x$w_buff0_used~0_108) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1828~0.base_27| 4)) (= v_~main$tmp_guard1~0_18 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1828~0.base_27|)) (= 0 v_~x$r_buff0_thd3~0_21) (= 0 v_~x$w_buff1~0_25) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t1828~0.base_27| 1)) (= 0 |v_ULTIMATE.start_main_~#t1828~0.offset_19|) (= 0 v_~x$r_buff0_thd0~0_22) (= |v_#NULL.offset_3| 0) (= v_~x~0_26 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~y~0_19 0) (= v_~x$r_buff1_thd0~0_26 0) (= 0 v_~weak$$choice2~0_32) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$w_buff0~0_25) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice0~0_7) (= v_~x$flush_delayed~0_14 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1828~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1828~0.base_27|) |v_ULTIMATE.start_main_~#t1828~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~x$r_buff0_thd1~0_74) (= v_~x$r_buff1_thd3~0_18 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= 0 v_~x$r_buff0_thd2~0_28) (= v_~x$mem_tmp~0_11 0) (= 0 v_~__unbuffered_cnt~0_22) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1828~0.base_27|) (= v_~x$r_buff1_thd2~0_20 0) (= v_~__unbuffered_p0_EBX~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_25, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start_main_~#t1830~0.offset=|v_ULTIMATE.start_main_~#t1830~0.offset_14|, ULTIMATE.start_main_~#t1828~0.offset=|v_ULTIMATE.start_main_~#t1828~0.offset_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ULTIMATE.start_main_~#t1829~0.base=|v_ULTIMATE.start_main_~#t1829~0.base_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_~#t1828~0.base=|v_ULTIMATE.start_main_~#t1828~0.base_27|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_26, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_74, ULTIMATE.start_main_~#t1830~0.base=|v_ULTIMATE.start_main_~#t1830~0.base_21|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_23|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y~0=v_~y~0_19, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t1829~0.offset=|v_ULTIMATE.start_main_~#t1829~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_26, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1830~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1830~0.offset, ULTIMATE.start_main_~#t1828~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t1829~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1829~0.offset, ~x$w_buff1~0, ULTIMATE.start_main_~#t1828~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:10:32,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L816-1-->L818: Formula: (and (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1829~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1829~0.base_10|) |v_ULTIMATE.start_main_~#t1829~0.offset_10| 1))) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1829~0.base_10| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1829~0.base_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1829~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1829~0.offset_10|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1829~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1829~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1829~0.offset=|v_ULTIMATE.start_main_~#t1829~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1829~0.base=|v_ULTIMATE.start_main_~#t1829~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1829~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1829~0.base] because there is no mapped edge [2019-12-27 22:10:32,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L818-1-->L820: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1830~0.base_10| 4) |v_#length_13|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1830~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1830~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1830~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1830~0.base_10|) |v_ULTIMATE.start_main_~#t1830~0.offset_9| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1830~0.base_10|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1830~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t1830~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1830~0.offset=|v_ULTIMATE.start_main_~#t1830~0.offset_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1830~0.base=|v_ULTIMATE.start_main_~#t1830~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1830~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1830~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 22:10:32,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15) (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_35)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 22:10:32,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In400790939 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In400790939 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out400790939| ~x~0_In400790939) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out400790939| ~x$w_buff1~0_In400790939)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In400790939, ~x$w_buff1_used~0=~x$w_buff1_used~0_In400790939, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In400790939, ~x~0=~x~0_In400790939} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out400790939|, ~x$w_buff1~0=~x$w_buff1~0_In400790939, ~x$w_buff1_used~0=~x$w_buff1_used~0_In400790939, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In400790939, ~x~0=~x~0_In400790939} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:10:32,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1440104307 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1440104307 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1440104307| ~x$w_buff0_used~0_In-1440104307) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1440104307|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1440104307, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1440104307} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1440104307, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1440104307|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1440104307} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 22:10:32,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: 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:10:32,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1453961595 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1453961595 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out1453961595| 0)) (and (= ~x$w_buff0_used~0_In1453961595 |P2Thread1of1ForFork1_#t~ite34_Out1453961595|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1453961595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1453961595} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1453961595|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1453961595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1453961595} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:10:32,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1200254744 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1200254744 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1200254744 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1200254744 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1200254744|)) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1200254744 |P1Thread1of1ForFork0_#t~ite29_Out-1200254744|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1200254744, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1200254744, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1200254744, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1200254744} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1200254744, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1200254744, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1200254744, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1200254744|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1200254744} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 22:10:32,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1933451112 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1933451112 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out1933451112 ~x$r_buff0_thd2~0_In1933451112)) (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out1933451112 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1933451112, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1933451112} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1933451112|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1933451112, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1933451112} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:10:32,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1458867951 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1458867951 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1458867951 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1458867951 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out1458867951| ~x$r_buff1_thd2~0_In1458867951) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out1458867951| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1458867951, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1458867951, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1458867951, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1458867951} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1458867951|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1458867951, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1458867951, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1458867951, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1458867951} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 22:10:32,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_16 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, 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:10:32,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1851101796 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1851101796 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1851101796 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1851101796 256)))) (or (and (= ~x$w_buff1_used~0_In-1851101796 |P2Thread1of1ForFork1_#t~ite35_Out-1851101796|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1851101796|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1851101796, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1851101796, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1851101796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1851101796} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1851101796|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1851101796, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1851101796, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1851101796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1851101796} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:10:32,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-187016769 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-187016769 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-187016769|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In-187016769 |P2Thread1of1ForFork1_#t~ite36_Out-187016769|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-187016769, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-187016769} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-187016769|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-187016769, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-187016769} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:10:32,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1673203643 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1673203643 |P0Thread1of1ForFork2_#t~ite12_Out-1673203643|) (= |P0Thread1of1ForFork2_#t~ite11_In-1673203643| |P0Thread1of1ForFork2_#t~ite11_Out-1673203643|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1673203643 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1673203643 256)) (and (= (mod ~x$w_buff1_used~0_In-1673203643 256) 0) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In-1673203643 256) 0) .cse1))) (= ~x$w_buff1~0_In-1673203643 |P0Thread1of1ForFork2_#t~ite11_Out-1673203643|) (= |P0Thread1of1ForFork2_#t~ite12_Out-1673203643| |P0Thread1of1ForFork2_#t~ite11_Out-1673203643|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1673203643, ~x$w_buff1~0=~x$w_buff1~0_In-1673203643, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1673203643, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1673203643, ~weak$$choice2~0=~weak$$choice2~0_In-1673203643, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1673203643|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1673203643} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1673203643, ~x$w_buff1~0=~x$w_buff1~0_In-1673203643, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1673203643, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1673203643, ~weak$$choice2~0=~weak$$choice2~0_In-1673203643, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1673203643|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1673203643|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1673203643} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 22:10:32,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1234554161 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_In1234554161| |P0Thread1of1ForFork2_#t~ite14_Out1234554161|) (= |P0Thread1of1ForFork2_#t~ite15_Out1234554161| ~x$w_buff0_used~0_In1234554161) (not .cse0)) (and .cse0 (= ~x$w_buff0_used~0_In1234554161 |P0Thread1of1ForFork2_#t~ite14_Out1234554161|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1234554161 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In1234554161 256)) .cse1) (= (mod ~x$w_buff0_used~0_In1234554161 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1234554161 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite15_Out1234554161| |P0Thread1of1ForFork2_#t~ite14_Out1234554161|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1234554161, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1234554161, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1234554161, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1234554161|, ~weak$$choice2~0=~weak$$choice2~0_In1234554161, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1234554161} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1234554161, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1234554161, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1234554161|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1234554161, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1234554161|, ~weak$$choice2~0=~weak$$choice2~0_In1234554161, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1234554161} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 22:10:32,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_54 v_~x$r_buff0_thd1~0_53) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} 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:10:32,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1383595819 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_In1383595819| |P0Thread1of1ForFork2_#t~ite23_Out1383595819|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite24_Out1383595819| ~x$r_buff1_thd1~0_In1383595819)) (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1383595819 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In1383595819 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1383595819 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1383595819 256) 0)))) (= ~x$r_buff1_thd1~0_In1383595819 |P0Thread1of1ForFork2_#t~ite23_Out1383595819|) (= |P0Thread1of1ForFork2_#t~ite24_Out1383595819| |P0Thread1of1ForFork2_#t~ite23_Out1383595819|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1383595819, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1383595819, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1383595819, ~weak$$choice2~0=~weak$$choice2~0_In1383595819, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1383595819|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1383595819} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1383595819, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1383595819, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1383595819, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1383595819|, ~weak$$choice2~0=~weak$$choice2~0_In1383595819, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1383595819|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1383595819} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 22:10:32,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_4 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 22:10:32,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In788690208 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In788690208 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In788690208 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In788690208 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out788690208| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite37_Out788690208| ~x$r_buff1_thd3~0_In788690208) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In788690208, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In788690208, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In788690208, ~x$w_buff0_used~0=~x$w_buff0_used~0_In788690208} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out788690208|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In788690208, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In788690208, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In788690208, ~x$w_buff0_used~0=~x$w_buff0_used~0_In788690208} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:10:32,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} 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_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, 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:10:32,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= 3 v_~__unbuffered_cnt~0_11)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~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:10:32,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite42_Out343535227| |ULTIMATE.start_main_#t~ite41_Out343535227|)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In343535227 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In343535227 256) 0))) (or (and (= ~x~0_In343535227 |ULTIMATE.start_main_#t~ite41_Out343535227|) .cse0 (or .cse1 .cse2)) (and (= |ULTIMATE.start_main_#t~ite41_Out343535227| ~x$w_buff1~0_In343535227) .cse0 (not .cse1) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In343535227, ~x$w_buff1_used~0=~x$w_buff1_used~0_In343535227, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In343535227, ~x~0=~x~0_In343535227} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out343535227|, ~x$w_buff1~0=~x$w_buff1~0_In343535227, ~x$w_buff1_used~0=~x$w_buff1_used~0_In343535227, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In343535227, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out343535227|, ~x~0=~x~0_In343535227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 22:10:32,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1754538659 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1754538659 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1754538659| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out1754538659| ~x$w_buff0_used~0_In1754538659) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1754538659, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1754538659} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1754538659, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1754538659|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1754538659} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:10:32,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-482163569 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-482163569 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-482163569 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-482163569 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-482163569|)) (and (= ~x$w_buff1_used~0_In-482163569 |ULTIMATE.start_main_#t~ite44_Out-482163569|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-482163569, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-482163569, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-482163569, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-482163569} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-482163569, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-482163569, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-482163569, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-482163569|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-482163569} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:10:32,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2136874859 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In2136874859 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out2136874859| ~x$r_buff0_thd0~0_In2136874859)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out2136874859|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2136874859, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2136874859} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2136874859, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2136874859|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2136874859} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:10:32,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In-994951800 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-994951800 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-994951800 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-994951800 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-994951800| 0)) (and (= |ULTIMATE.start_main_#t~ite46_Out-994951800| ~x$r_buff1_thd0~0_In-994951800) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-994951800, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-994951800, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-994951800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-994951800} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-994951800, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-994951800|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-994951800, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-994951800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-994951800} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 22:10:32,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_9 0) (= v_~__unbuffered_p0_EAX~0_9 2) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_13 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_13} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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:10:32,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:10:32 BasicIcfg [2019-12-27 22:10:32,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:10:32,347 INFO L168 Benchmark]: Toolchain (without parser) took 94173.79 ms. Allocated memory was 134.7 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 97.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 22:10:32,348 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 134.7 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 22:10:32,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.60 ms. Allocated memory was 134.7 MB in the beginning and 199.2 MB in the end (delta: 64.5 MB). Free memory was 97.3 MB in the beginning and 152.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:10:32,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.76 ms. Allocated memory is still 199.2 MB. Free memory was 152.5 MB in the beginning and 150.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:10:32,352 INFO L168 Benchmark]: Boogie Preprocessor took 43.78 ms. Allocated memory is still 199.2 MB. Free memory was 150.4 MB in the beginning and 147.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:10:32,352 INFO L168 Benchmark]: RCFGBuilder took 803.41 ms. Allocated memory is still 199.2 MB. Free memory was 147.5 MB in the beginning and 101.0 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-27 22:10:32,352 INFO L168 Benchmark]: TraceAbstraction took 92509.45 ms. Allocated memory was 199.2 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 100.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 22:10:32,361 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.27 ms. Allocated memory is still 134.7 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 748.60 ms. Allocated memory was 134.7 MB in the beginning and 199.2 MB in the end (delta: 64.5 MB). Free memory was 97.3 MB in the beginning and 152.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.76 ms. Allocated memory is still 199.2 MB. Free memory was 152.5 MB in the beginning and 150.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.78 ms. Allocated memory is still 199.2 MB. Free memory was 150.4 MB in the beginning and 147.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 803.41 ms. Allocated memory is still 199.2 MB. Free memory was 147.5 MB in the beginning and 101.0 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92509.45 ms. Allocated memory was 199.2 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 100.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 93 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6473 VarBasedMoverChecksPositive, 209 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75395 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L818] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] 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_p0_EBX=0, __unbuffered_p2_EAX=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] [L820] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] 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) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2] [L737] 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) [L775] 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 [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 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 [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 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)) [L739] 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)) [L740] 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)) [L741] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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_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))=0, 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_buff1=0, x$w_buff1_used=0, y=2] [L741] 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)) [L743] 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)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 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, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 92.1s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 40.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5017 SDtfs, 9919 SDslu, 20461 SDs, 0 SdLazy, 20819 SolverSat, 775 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 752 GetRequests, 158 SyntacticMatches, 121 SemanticMatches, 473 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8229 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 217846 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1177 NumberOfCodeBlocks, 1177 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1095 ConstructedInterpolants, 0 QuantifiedInterpolants, 201051 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...