/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:11:10,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:11:10,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:11:10,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:11:10,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:11:10,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:11:10,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:11:10,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:11:10,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:11:10,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:11:10,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:11:10,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:11:10,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:11:10,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:11:10,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:11:10,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:11:10,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:11:10,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:11:10,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:11:10,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:11:10,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:11:10,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:11:10,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:11:10,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:11:10,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:11:10,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:11:10,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:11:10,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:11:10,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:11:10,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:11:10,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:11:10,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:11:10,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:11:10,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:11:10,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:11:10,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:11:10,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:11:10,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:11:10,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:11:10,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:11:10,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:11:10,925 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:11:10,939 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:11:10,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:11:10,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:11:10,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:11:10,941 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:11:10,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:11:10,941 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:11:10,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:11:10,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:11:10,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:11:10,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:11:10,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:11:10,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:11:10,943 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:11:10,943 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:11:10,943 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:11:10,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:11:10,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:11:10,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:11:10,944 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:11:10,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:11:10,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:11:10,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:11:10,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:11:10,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:11:10,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:11:10,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:11:10,946 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:11:10,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:11:10,946 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:11:10,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:11:11,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:11:11,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:11:11,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:11:11,239 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:11:11,239 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:11:11,240 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_rmo.oepc.i [2019-12-27 16:11:11,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e2457a8/9b8a8b4c3d064b92b512d3f3098d1a2d/FLAG26aa2940f [2019-12-27 16:11:11,874 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:11:11,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_rmo.oepc.i [2019-12-27 16:11:11,891 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e2457a8/9b8a8b4c3d064b92b512d3f3098d1a2d/FLAG26aa2940f [2019-12-27 16:11:12,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e2457a8/9b8a8b4c3d064b92b512d3f3098d1a2d [2019-12-27 16:11:12,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:11:12,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:11:12,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:11:12,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:11:12,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:11:12,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:11:12" (1/1) ... [2019-12-27 16:11:12,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ede25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:12, skipping insertion in model container [2019-12-27 16:11:12,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:11:12" (1/1) ... [2019-12-27 16:11:12,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:11:12,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:11:12,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:11:12,849 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:11:12,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:11:13,010 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:11:13,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:13 WrapperNode [2019-12-27 16:11:13,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:11:13,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:11:13,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:11:13,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:11:13,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:13" (1/1) ... [2019-12-27 16:11:13,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:13" (1/1) ... [2019-12-27 16:11:13,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:11:13,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:11:13,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:11:13,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:11:13,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:13" (1/1) ... [2019-12-27 16:11:13,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:13" (1/1) ... [2019-12-27 16:11:13,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:13" (1/1) ... [2019-12-27 16:11:13,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:13" (1/1) ... [2019-12-27 16:11:13,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:13" (1/1) ... [2019-12-27 16:11:13,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:13" (1/1) ... [2019-12-27 16:11:13,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:13" (1/1) ... [2019-12-27 16:11:13,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:11:13,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:11:13,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:11:13,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:11:13,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:11:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:11:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:11:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:11:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:11:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:11:13,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:11:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:11:13,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:11:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:11:13,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:11:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:11:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:11:13,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:11:13,200 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:11:13,999 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:11:13,999 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:11:14,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:11:14 BoogieIcfgContainer [2019-12-27 16:11:14,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:11:14,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:11:14,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:11:14,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:11:14,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:11:12" (1/3) ... [2019-12-27 16:11:14,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686c3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:11:14, skipping insertion in model container [2019-12-27 16:11:14,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:11:13" (2/3) ... [2019-12-27 16:11:14,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686c3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:11:14, skipping insertion in model container [2019-12-27 16:11:14,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:11:14" (3/3) ... [2019-12-27 16:11:14,009 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_rmo.oepc.i [2019-12-27 16:11:14,020 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:11:14,020 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:11:14,027 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:11:14,028 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:11:14,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,071 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,071 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,071 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,080 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,080 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,089 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,089 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,156 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,158 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,176 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,176 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:11:14,196 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:11:14,216 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:11:14,217 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:11:14,217 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:11:14,217 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:11:14,217 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:11:14,217 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:11:14,217 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:11:14,217 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:11:14,234 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 16:11:14,235 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 16:11:14,351 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 16:11:14,351 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:11:14,368 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:11:14,390 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 16:11:14,479 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 16:11:14,480 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:11:14,488 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:11:14,509 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:11:14,510 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:11:19,954 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 16:11:20,081 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 16:11:20,325 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-27 16:11:20,326 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 16:11:20,330 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-27 16:11:42,360 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-27 16:11:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-27 16:11:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:11:42,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:11:42,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:11:42,368 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:11:42,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:11:42,373 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-27 16:11:42,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:11:42,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637222373] [2019-12-27 16:11:42,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:11:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:11:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:11:42,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637222373] [2019-12-27 16:11:42,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:11:42,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:11:42,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1629235705] [2019-12-27 16:11:42,655 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:11:42,659 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:11:42,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:11:42,671 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:11:42,675 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:11:42,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:11:42,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:11:42,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:11:42,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:11:42,692 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-27 16:11:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:11:46,387 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-27 16:11:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:11:46,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:11:46,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:11:46,985 INFO L225 Difference]: With dead ends: 121140 [2019-12-27 16:11:46,985 INFO L226 Difference]: Without dead ends: 107958 [2019-12-27 16:11:46,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:11:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-27 16:11:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-27 16:11:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-27 16:12:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-27 16:12:00,857 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-27 16:12:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:00,857 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-27 16:12:00,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:12:00,858 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-27 16:12:00,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:12:00,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:00,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:00,863 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:00,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:00,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-27 16:12:00,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:00,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167525057] [2019-12-27 16:12:00,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:00,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167525057] [2019-12-27 16:12:00,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:00,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:12:00,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1677728705] [2019-12-27 16:12:00,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:00,990 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:00,996 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:12:00,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:00,997 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:12:00,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:12:00,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:00,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:12:00,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:12:00,999 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-27 16:12:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:02,347 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-27 16:12:02,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:12:02,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:12:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:03,981 INFO L225 Difference]: With dead ends: 172022 [2019-12-27 16:12:03,981 INFO L226 Difference]: Without dead ends: 171924 [2019-12-27 16:12:03,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:12:13,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-27 16:12:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-27 16:12:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-27 16:12:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-27 16:12:17,480 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-27 16:12:17,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:17,480 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-27 16:12:17,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:12:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-27 16:12:17,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:12:17,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:17,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:17,491 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:17,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:17,491 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-27 16:12:17,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:17,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40343701] [2019-12-27 16:12:17,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:17,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40343701] [2019-12-27 16:12:17,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:17,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:12:17,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1755199280] [2019-12-27 16:12:17,559 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:17,560 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:17,563 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:12:17,563 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:17,563 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:12:17,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:12:17,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:17,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:12:17,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:12:17,565 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-27 16:12:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:17,727 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-27 16:12:17,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:12:17,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:12:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:17,785 INFO L225 Difference]: With dead ends: 33388 [2019-12-27 16:12:17,785 INFO L226 Difference]: Without dead ends: 33388 [2019-12-27 16:12:17,785 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 16:12:17,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-27 16:12:18,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-27 16:12:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-27 16:12:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-27 16:12:18,400 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-27 16:12:18,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:18,400 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-27 16:12:18,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:12:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-27 16:12:18,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:12:18,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:18,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:18,404 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:18,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:18,404 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-27 16:12:18,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:18,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565793567] [2019-12-27 16:12:18,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:18,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565793567] [2019-12-27 16:12:18,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:18,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:12:18,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [147589446] [2019-12-27 16:12:18,504 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:18,507 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:18,510 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:12:18,510 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:18,510 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:12:18,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:12:18,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:18,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:12:18,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:12:18,512 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-27 16:12:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:18,718 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-27 16:12:18,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:12:18,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 16:12:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:18,807 INFO L225 Difference]: With dead ends: 52822 [2019-12-27 16:12:18,807 INFO L226 Difference]: Without dead ends: 52822 [2019-12-27 16:12:18,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:12:21,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-27 16:12:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-27 16:12:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-27 16:12:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-27 16:12:22,097 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-27 16:12:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:22,098 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-27 16:12:22,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:12:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-27 16:12:22,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:12:22,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:22,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:22,103 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:22,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:22,103 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-27 16:12:22,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:22,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728893309] [2019-12-27 16:12:22,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:22,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728893309] [2019-12-27 16:12:22,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:22,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:12:22,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1530784860] [2019-12-27 16:12:22,180 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:22,183 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:22,186 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:12:22,186 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:22,187 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:12:22,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:12:22,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:22,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:12:22,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:12:22,188 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-27 16:12:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:22,546 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-27 16:12:22,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:12:22,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:12:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:22,638 INFO L225 Difference]: With dead ends: 46903 [2019-12-27 16:12:22,638 INFO L226 Difference]: Without dead ends: 46903 [2019-12-27 16:12:22,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:12:22,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-27 16:12:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-27 16:12:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 16:12:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-27 16:12:23,780 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-27 16:12:23,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:23,780 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-27 16:12:23,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:12:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-27 16:12:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:12:23,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:23,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:23,784 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:23,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:23,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-27 16:12:23,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:23,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215868235] [2019-12-27 16:12:23,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:23,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215868235] [2019-12-27 16:12:23,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:23,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:12:23,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1040173814] [2019-12-27 16:12:23,837 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:23,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:23,842 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:12:23,842 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:23,842 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:12:23,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:12:23,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:23,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:12:23,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:12:23,843 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-27 16:12:24,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:24,210 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-27 16:12:24,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:12:24,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:12:24,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:24,319 INFO L225 Difference]: With dead ends: 51478 [2019-12-27 16:12:24,319 INFO L226 Difference]: Without dead ends: 51478 [2019-12-27 16:12:24,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:12:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-27 16:12:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-27 16:12:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-27 16:12:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-27 16:12:25,192 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-27 16:12:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:25,192 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-27 16:12:25,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:12:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-27 16:12:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:12:25,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:25,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:25,202 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:25,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:25,203 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-27 16:12:25,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:25,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614363855] [2019-12-27 16:12:25,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:25,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:25,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614363855] [2019-12-27 16:12:25,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:25,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:12:25,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [172831680] [2019-12-27 16:12:25,281 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:25,285 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:25,293 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 60 transitions. [2019-12-27 16:12:25,293 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:25,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:12:25,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:12:25,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:25,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:12:25,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:12:25,297 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-27 16:12:25,834 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-27 16:12:26,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:26,262 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-27 16:12:26,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:12:26,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:12:26,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:26,361 INFO L225 Difference]: With dead ends: 61264 [2019-12-27 16:12:26,361 INFO L226 Difference]: Without dead ends: 61250 [2019-12-27 16:12:26,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:12:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-27 16:12:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-27 16:12:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-27 16:12:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-27 16:12:27,220 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-27 16:12:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:27,221 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-27 16:12:27,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:12:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-27 16:12:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:12:27,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:27,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:27,230 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-27 16:12:27,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:27,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227001230] [2019-12-27 16:12:27,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:27,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227001230] [2019-12-27 16:12:27,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:27,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:12:27,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1602343289] [2019-12-27 16:12:27,296 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:27,299 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:27,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 60 transitions. [2019-12-27 16:12:27,307 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:27,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:12:27,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:12:27,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:27,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:12:27,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:12:27,309 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-27 16:12:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:28,054 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-27 16:12:28,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:12:28,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:12:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:28,165 INFO L225 Difference]: With dead ends: 63752 [2019-12-27 16:12:28,165 INFO L226 Difference]: Without dead ends: 63738 [2019-12-27 16:12:28,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:12:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-27 16:12:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-27 16:12:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-27 16:12:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-27 16:12:29,456 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-27 16:12:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:29,456 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-27 16:12:29,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:12:29,456 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-27 16:12:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:12:29,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:29,468 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:29,468 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:29,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:29,468 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-27 16:12:29,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:29,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166716515] [2019-12-27 16:12:29,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:29,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166716515] [2019-12-27 16:12:29,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:29,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:12:29,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1897372250] [2019-12-27 16:12:29,535 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:29,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:29,548 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:12:29,549 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:29,580 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:12:29,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:12:29,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:29,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:12:29,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:12:29,581 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 5 states. [2019-12-27 16:12:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:29,675 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-27 16:12:29,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:12:29,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:12:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:29,701 INFO L225 Difference]: With dead ends: 17193 [2019-12-27 16:12:29,701 INFO L226 Difference]: Without dead ends: 17193 [2019-12-27 16:12:29,701 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 16:12:29,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-27 16:12:29,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-27 16:12:29,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-27 16:12:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-27 16:12:29,960 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-27 16:12:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:29,960 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-27 16:12:29,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:12:29,961 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-27 16:12:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:12:29,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:29,973 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] [2019-12-27 16:12:29,973 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:29,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:29,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-27 16:12:29,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:29,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82927845] [2019-12-27 16:12:29,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:30,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82927845] [2019-12-27 16:12:30,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:30,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:12:30,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [48416392] [2019-12-27 16:12:30,050 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:30,054 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:30,061 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 16:12:30,061 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:30,061 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:12:30,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:12:30,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:30,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:12:30,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:12:30,062 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-27 16:12:30,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:30,434 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-27 16:12:30,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:12:30,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:12:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:30,467 INFO L225 Difference]: With dead ends: 21613 [2019-12-27 16:12:30,467 INFO L226 Difference]: Without dead ends: 21613 [2019-12-27 16:12:30,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:12:30,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-27 16:12:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-27 16:12:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-27 16:12:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-27 16:12:31,036 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-27 16:12:31,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:31,037 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-27 16:12:31,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:12:31,037 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-27 16:12:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:12:31,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:31,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:31,052 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:31,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:31,052 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-27 16:12:31,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:31,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112754269] [2019-12-27 16:12:31,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:31,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112754269] [2019-12-27 16:12:31,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:31,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:12:31,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1413577296] [2019-12-27 16:12:31,120 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:31,125 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:31,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:12:31,133 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:31,133 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:12:31,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:12:31,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:31,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:12:31,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:12:31,134 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-27 16:12:31,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:31,529 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-27 16:12:31,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:12:31,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 16:12:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:31,569 INFO L225 Difference]: With dead ends: 23624 [2019-12-27 16:12:31,569 INFO L226 Difference]: Without dead ends: 23624 [2019-12-27 16:12:31,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:12:31,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-27 16:12:31,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-27 16:12:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-27 16:12:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-27 16:12:31,883 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-27 16:12:31,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:31,883 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-27 16:12:31,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:12:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-27 16:12:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:12:31,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:31,904 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] [2019-12-27 16:12:31,904 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:31,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:31,904 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-27 16:12:31,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:31,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447154629] [2019-12-27 16:12:31,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:32,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447154629] [2019-12-27 16:12:32,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:32,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:12:32,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1115753344] [2019-12-27 16:12:32,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:32,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:32,035 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 76 transitions. [2019-12-27 16:12:32,035 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:32,036 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:12:32,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:12:32,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:32,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:12:32,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:12:32,037 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-27 16:12:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:32,730 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-27 16:12:32,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:12:32,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 16:12:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:32,771 INFO L225 Difference]: With dead ends: 27031 [2019-12-27 16:12:32,771 INFO L226 Difference]: Without dead ends: 27031 [2019-12-27 16:12:32,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:12:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-27 16:12:33,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-27 16:12:33,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-27 16:12:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-27 16:12:33,124 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-27 16:12:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:33,125 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-27 16:12:33,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:12:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-27 16:12:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:12:33,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:33,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:33,148 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:33,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:33,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-27 16:12:33,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:33,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334462492] [2019-12-27 16:12:33,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:33,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334462492] [2019-12-27 16:12:33,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:33,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:12:33,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1594733905] [2019-12-27 16:12:33,234 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:33,241 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:33,262 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 82 transitions. [2019-12-27 16:12:33,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:33,263 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:12:33,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:12:33,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:33,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:12:33,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:12:33,264 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-27 16:12:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:33,952 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-27 16:12:33,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:12:33,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 16:12:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:33,992 INFO L225 Difference]: With dead ends: 26334 [2019-12-27 16:12:33,992 INFO L226 Difference]: Without dead ends: 26334 [2019-12-27 16:12:33,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:12:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-27 16:12:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-27 16:12:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-27 16:12:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-27 16:12:34,616 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-27 16:12:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:34,617 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-27 16:12:34,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:12:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-27 16:12:34,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:12:34,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:34,633 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 16:12:34,633 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:34,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:34,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-27 16:12:34,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:34,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506087026] [2019-12-27 16:12:34,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:34,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506087026] [2019-12-27 16:12:34,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:34,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:12:34,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [854000604] [2019-12-27 16:12:34,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:34,694 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:34,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 424 transitions. [2019-12-27 16:12:34,769 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:34,771 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:12:34,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:12:34,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:34,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:12:34,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:12:34,772 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-27 16:12:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:34,847 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-27 16:12:34,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:12:34,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:12:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:34,882 INFO L225 Difference]: With dead ends: 17641 [2019-12-27 16:12:34,883 INFO L226 Difference]: Without dead ends: 17641 [2019-12-27 16:12:34,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:12:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-27 16:12:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-27 16:12:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-27 16:12:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-27 16:12:35,152 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-27 16:12:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:35,152 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-27 16:12:35,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:12:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-27 16:12:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:12:35,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:35,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:35,173 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:35,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:35,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-27 16:12:35,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:35,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703528824] [2019-12-27 16:12:35,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:35,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703528824] [2019-12-27 16:12:35,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:35,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:12:35,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102411714] [2019-12-27 16:12:35,265 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:35,274 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:35,377 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 488 transitions. [2019-12-27 16:12:35,378 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:35,436 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:12:35,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:12:35,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:35,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:12:35,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:12:35,438 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 7 states. [2019-12-27 16:12:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:36,383 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-27 16:12:36,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:12:36,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:12:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:36,421 INFO L225 Difference]: With dead ends: 25346 [2019-12-27 16:12:36,421 INFO L226 Difference]: Without dead ends: 25346 [2019-12-27 16:12:36,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:12:36,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-27 16:12:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-27 16:12:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-27 16:12:36,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-27 16:12:36,779 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-27 16:12:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:36,779 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-27 16:12:36,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:12:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-27 16:12:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:12:36,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:36,808 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 16:12:36,809 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:36,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:36,809 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-27 16:12:36,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:36,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822215234] [2019-12-27 16:12:36,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:36,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822215234] [2019-12-27 16:12:36,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:36,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:12:36,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1709117554] [2019-12-27 16:12:36,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:36,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:36,970 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 448 transitions. [2019-12-27 16:12:36,971 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:37,009 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:12:37,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:12:37,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:37,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:12:37,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:12:37,011 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 7 states. [2019-12-27 16:12:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:37,428 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-27 16:12:37,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:12:37,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:12:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:37,459 INFO L225 Difference]: With dead ends: 22175 [2019-12-27 16:12:37,459 INFO L226 Difference]: Without dead ends: 22175 [2019-12-27 16:12:37,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:12:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-27 16:12:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-27 16:12:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-27 16:12:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-27 16:12:37,794 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-27 16:12:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:37,794 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-27 16:12:37,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:12:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-27 16:12:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:12:37,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:37,823 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:37,824 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:37,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:37,824 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-27 16:12:37,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:37,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437909552] [2019-12-27 16:12:37,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:37,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:37,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437909552] [2019-12-27 16:12:37,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:37,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:12:37,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [310284407] [2019-12-27 16:12:37,920 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:37,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:38,170 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 413 transitions. [2019-12-27 16:12:38,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:38,185 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:12:38,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:12:38,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:38,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:12:38,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:12:38,186 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-27 16:12:38,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:38,821 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-27 16:12:38,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 16:12:38,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 16:12:38,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:38,892 INFO L225 Difference]: With dead ends: 62478 [2019-12-27 16:12:38,892 INFO L226 Difference]: Without dead ends: 47634 [2019-12-27 16:12:38,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:12:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-27 16:12:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-27 16:12:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-27 16:12:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-27 16:12:39,471 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-27 16:12:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:39,471 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-27 16:12:39,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:12:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-27 16:12:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:12:39,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:39,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:39,503 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:39,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:39,503 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-27 16:12:39,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:39,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905737850] [2019-12-27 16:12:39,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:39,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905737850] [2019-12-27 16:12:39,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:39,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:12:39,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [133097481] [2019-12-27 16:12:39,597 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:39,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:40,088 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 475 transitions. [2019-12-27 16:12:40,088 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:40,153 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:12:40,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:12:40,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:40,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:12:40,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:12:40,154 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 9 states. [2019-12-27 16:12:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:42,394 INFO L93 Difference]: Finished difference Result 79135 states and 244004 transitions. [2019-12-27 16:12:42,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:12:42,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-27 16:12:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:42,486 INFO L225 Difference]: With dead ends: 79135 [2019-12-27 16:12:42,486 INFO L226 Difference]: Without dead ends: 58736 [2019-12-27 16:12:42,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:12:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58736 states. [2019-12-27 16:12:43,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58736 to 28798. [2019-12-27 16:12:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-27 16:12:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-27 16:12:43,171 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-27 16:12:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:43,171 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-27 16:12:43,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:12:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-27 16:12:43,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:12:43,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:43,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:43,204 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:43,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:43,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-27 16:12:43,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:43,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368852587] [2019-12-27 16:12:43,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:43,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368852587] [2019-12-27 16:12:43,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:43,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:12:43,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1108189334] [2019-12-27 16:12:43,291 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:43,311 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:43,823 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 422 transitions. [2019-12-27 16:12:43,823 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:43,889 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:12:43,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:12:43,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:43,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:12:43,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:12:43,890 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 8 states. [2019-12-27 16:12:45,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:45,535 INFO L93 Difference]: Finished difference Result 80513 states and 245595 transitions. [2019-12-27 16:12:45,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:12:45,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 16:12:45,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:45,639 INFO L225 Difference]: With dead ends: 80513 [2019-12-27 16:12:45,639 INFO L226 Difference]: Without dead ends: 71377 [2019-12-27 16:12:45,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:12:45,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71377 states. [2019-12-27 16:12:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71377 to 29106. [2019-12-27 16:12:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-27 16:12:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-27 16:12:46,443 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-27 16:12:46,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:46,443 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-27 16:12:46,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:12:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-27 16:12:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:12:46,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:46,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:46,477 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:46,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:46,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-27 16:12:46,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:46,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603097766] [2019-12-27 16:12:46,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:46,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:46,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603097766] [2019-12-27 16:12:46,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:46,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:12:46,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [323681569] [2019-12-27 16:12:46,536 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:46,555 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:47,210 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 234 states and 407 transitions. [2019-12-27 16:12:47,210 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:47,212 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:12:47,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:12:47,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:47,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:12:47,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:12:47,213 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 3 states. [2019-12-27 16:12:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:47,455 INFO L93 Difference]: Finished difference Result 35624 states and 109784 transitions. [2019-12-27 16:12:47,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:12:47,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 16:12:47,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:47,526 INFO L225 Difference]: With dead ends: 35624 [2019-12-27 16:12:47,527 INFO L226 Difference]: Without dead ends: 35624 [2019-12-27 16:12:47,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:12:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35624 states. [2019-12-27 16:12:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35624 to 31022. [2019-12-27 16:12:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31022 states. [2019-12-27 16:12:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31022 states to 31022 states and 96384 transitions. [2019-12-27 16:12:48,036 INFO L78 Accepts]: Start accepts. Automaton has 31022 states and 96384 transitions. Word has length 63 [2019-12-27 16:12:48,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:48,036 INFO L462 AbstractCegarLoop]: Abstraction has 31022 states and 96384 transitions. [2019-12-27 16:12:48,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:12:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 31022 states and 96384 transitions. [2019-12-27 16:12:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:12:48,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:48,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:48,068 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:48,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:48,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1820548391, now seen corresponding path program 1 times [2019-12-27 16:12:48,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:48,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387073593] [2019-12-27 16:12:48,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:48,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387073593] [2019-12-27 16:12:48,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:48,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 16:12:48,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1543156952] [2019-12-27 16:12:48,357 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:48,376 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:48,556 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 407 transitions. [2019-12-27 16:12:48,556 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:48,651 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 16:12:48,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:12:48,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:48,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:12:48,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:12:48,652 INFO L87 Difference]: Start difference. First operand 31022 states and 96384 transitions. Second operand 11 states. [2019-12-27 16:12:52,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:52,338 INFO L93 Difference]: Finished difference Result 61396 states and 184421 transitions. [2019-12-27 16:12:52,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 16:12:52,338 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 16:12:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:52,423 INFO L225 Difference]: With dead ends: 61396 [2019-12-27 16:12:52,424 INFO L226 Difference]: Without dead ends: 61016 [2019-12-27 16:12:52,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=308, Invalid=1332, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 16:12:52,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61016 states. [2019-12-27 16:12:53,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61016 to 35887. [2019-12-27 16:12:53,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35887 states. [2019-12-27 16:12:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35887 states to 35887 states and 110395 transitions. [2019-12-27 16:12:53,165 INFO L78 Accepts]: Start accepts. Automaton has 35887 states and 110395 transitions. Word has length 64 [2019-12-27 16:12:53,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:53,165 INFO L462 AbstractCegarLoop]: Abstraction has 35887 states and 110395 transitions. [2019-12-27 16:12:53,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:12:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 35887 states and 110395 transitions. [2019-12-27 16:12:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:12:53,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:53,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:53,206 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:53,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:53,206 INFO L82 PathProgramCache]: Analyzing trace with hash -772692697, now seen corresponding path program 2 times [2019-12-27 16:12:53,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:53,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338913933] [2019-12-27 16:12:53,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:53,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338913933] [2019-12-27 16:12:53,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:53,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:12:53,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1555960579] [2019-12-27 16:12:53,448 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:53,467 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:53,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 427 transitions. [2019-12-27 16:12:53,671 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:53,751 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 16:12:53,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:12:53,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:53,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:12:53,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:12:53,753 INFO L87 Difference]: Start difference. First operand 35887 states and 110395 transitions. Second operand 11 states. [2019-12-27 16:12:55,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:12:55,994 INFO L93 Difference]: Finished difference Result 65939 states and 198928 transitions. [2019-12-27 16:12:55,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 16:12:55,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 16:12:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:12:56,094 INFO L225 Difference]: With dead ends: 65939 [2019-12-27 16:12:56,095 INFO L226 Difference]: Without dead ends: 65719 [2019-12-27 16:12:56,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2019-12-27 16:12:56,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65719 states. [2019-12-27 16:12:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65719 to 40866. [2019-12-27 16:12:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40866 states. [2019-12-27 16:12:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40866 states to 40866 states and 125305 transitions. [2019-12-27 16:12:57,304 INFO L78 Accepts]: Start accepts. Automaton has 40866 states and 125305 transitions. Word has length 64 [2019-12-27 16:12:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:12:57,304 INFO L462 AbstractCegarLoop]: Abstraction has 40866 states and 125305 transitions. [2019-12-27 16:12:57,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:12:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 40866 states and 125305 transitions. [2019-12-27 16:12:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:12:57,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:12:57,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:12:57,346 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:12:57,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:12:57,347 INFO L82 PathProgramCache]: Analyzing trace with hash 98843029, now seen corresponding path program 3 times [2019-12-27 16:12:57,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:12:57,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602148844] [2019-12-27 16:12:57,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:12:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:12:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:12:57,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602148844] [2019-12-27 16:12:57,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:12:57,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:12:57,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1117404032] [2019-12-27 16:12:57,534 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:12:57,552 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:12:57,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 230 states and 381 transitions. [2019-12-27 16:12:57,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:12:57,824 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 16:12:57,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:12:57,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:12:57,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:12:57,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:12:57,825 INFO L87 Difference]: Start difference. First operand 40866 states and 125305 transitions. Second operand 11 states. [2019-12-27 16:13:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:13:00,874 INFO L93 Difference]: Finished difference Result 69623 states and 210239 transitions. [2019-12-27 16:13:00,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 16:13:00,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 16:13:00,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:13:00,985 INFO L225 Difference]: With dead ends: 69623 [2019-12-27 16:13:00,986 INFO L226 Difference]: Without dead ends: 69371 [2019-12-27 16:13:00,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 16:13:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69371 states. [2019-12-27 16:13:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69371 to 42374. [2019-12-27 16:13:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42374 states. [2019-12-27 16:13:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42374 states to 42374 states and 130427 transitions. [2019-12-27 16:13:02,316 INFO L78 Accepts]: Start accepts. Automaton has 42374 states and 130427 transitions. Word has length 64 [2019-12-27 16:13:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:13:02,316 INFO L462 AbstractCegarLoop]: Abstraction has 42374 states and 130427 transitions. [2019-12-27 16:13:02,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:13:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 42374 states and 130427 transitions. [2019-12-27 16:13:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:13:02,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:13:02,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:13:02,361 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:13:02,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:13:02,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1550075121, now seen corresponding path program 4 times [2019-12-27 16:13:02,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:13:02,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679306743] [2019-12-27 16:13:02,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:13:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:13:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:13:02,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679306743] [2019-12-27 16:13:02,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:13:02,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:13:02,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1058605356] [2019-12-27 16:13:02,428 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:13:02,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:13:02,662 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 383 transitions. [2019-12-27 16:13:02,662 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:13:02,671 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:13:02,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:13:02,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:13:02,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:13:02,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:13:02,672 INFO L87 Difference]: Start difference. First operand 42374 states and 130427 transitions. Second operand 4 states. [2019-12-27 16:13:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:13:02,981 INFO L93 Difference]: Finished difference Result 40422 states and 121939 transitions. [2019-12-27 16:13:02,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:13:02,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 16:13:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:13:03,035 INFO L225 Difference]: With dead ends: 40422 [2019-12-27 16:13:03,035 INFO L226 Difference]: Without dead ends: 40422 [2019-12-27 16:13:03,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:13:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40422 states. [2019-12-27 16:13:03,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40422 to 30525. [2019-12-27 16:13:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30525 states. [2019-12-27 16:13:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30525 states to 30525 states and 92879 transitions. [2019-12-27 16:13:03,545 INFO L78 Accepts]: Start accepts. Automaton has 30525 states and 92879 transitions. Word has length 64 [2019-12-27 16:13:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:13:03,545 INFO L462 AbstractCegarLoop]: Abstraction has 30525 states and 92879 transitions. [2019-12-27 16:13:03,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:13:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 30525 states and 92879 transitions. [2019-12-27 16:13:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:13:03,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:13:03,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:13:03,577 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:13:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:13:03,577 INFO L82 PathProgramCache]: Analyzing trace with hash -625357365, now seen corresponding path program 1 times [2019-12-27 16:13:03,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:13:03,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733638398] [2019-12-27 16:13:03,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:13:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:13:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:13:03,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733638398] [2019-12-27 16:13:03,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:13:03,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:13:03,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1027897823] [2019-12-27 16:13:03,748 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:13:03,775 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:13:04,353 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 302 states and 619 transitions. [2019-12-27 16:13:04,353 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:13:04,458 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 16:13:04,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:13:04,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:13:04,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:13:04,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:13:04,459 INFO L87 Difference]: Start difference. First operand 30525 states and 92879 transitions. Second operand 12 states. [2019-12-27 16:13:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:13:07,457 INFO L93 Difference]: Finished difference Result 43656 states and 130853 transitions. [2019-12-27 16:13:07,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 16:13:07,457 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 16:13:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:13:07,517 INFO L225 Difference]: With dead ends: 43656 [2019-12-27 16:13:07,517 INFO L226 Difference]: Without dead ends: 43656 [2019-12-27 16:13:07,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=1101, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 16:13:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43656 states. [2019-12-27 16:13:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43656 to 30461. [2019-12-27 16:13:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30461 states. [2019-12-27 16:13:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30461 states to 30461 states and 92845 transitions. [2019-12-27 16:13:08,056 INFO L78 Accepts]: Start accepts. Automaton has 30461 states and 92845 transitions. Word has length 65 [2019-12-27 16:13:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:13:08,056 INFO L462 AbstractCegarLoop]: Abstraction has 30461 states and 92845 transitions. [2019-12-27 16:13:08,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:13:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 30461 states and 92845 transitions. [2019-12-27 16:13:08,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:13:08,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:13:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:13:08,088 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:13:08,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:13:08,088 INFO L82 PathProgramCache]: Analyzing trace with hash 946511855, now seen corresponding path program 2 times [2019-12-27 16:13:08,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:13:08,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322966098] [2019-12-27 16:13:08,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:13:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:13:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:13:08,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322966098] [2019-12-27 16:13:08,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:13:08,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:13:08,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1983460511] [2019-12-27 16:13:08,264 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:13:08,284 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:13:08,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 211 states and 389 transitions. [2019-12-27 16:13:08,545 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:13:08,691 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:13:08,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:13:08,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:13:08,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:13:08,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:13:08,692 INFO L87 Difference]: Start difference. First operand 30461 states and 92845 transitions. Second operand 13 states. [2019-12-27 16:13:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:13:10,720 INFO L93 Difference]: Finished difference Result 46692 states and 140993 transitions. [2019-12-27 16:13:10,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:13:10,721 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 16:13:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:13:10,772 INFO L225 Difference]: With dead ends: 46692 [2019-12-27 16:13:10,773 INFO L226 Difference]: Without dead ends: 37633 [2019-12-27 16:13:10,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:13:10,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37633 states. [2019-12-27 16:13:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37633 to 31087. [2019-12-27 16:13:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31087 states. [2019-12-27 16:13:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31087 states to 31087 states and 94244 transitions. [2019-12-27 16:13:11,323 INFO L78 Accepts]: Start accepts. Automaton has 31087 states and 94244 transitions. Word has length 65 [2019-12-27 16:13:11,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:13:11,324 INFO L462 AbstractCegarLoop]: Abstraction has 31087 states and 94244 transitions. [2019-12-27 16:13:11,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:13:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 31087 states and 94244 transitions. [2019-12-27 16:13:11,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:13:11,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:13:11,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:13:11,363 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:13:11,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:13:11,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1007435361, now seen corresponding path program 3 times [2019-12-27 16:13:11,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:13:11,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742906978] [2019-12-27 16:13:11,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:13:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:13:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:13:11,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742906978] [2019-12-27 16:13:11,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:13:11,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 16:13:11,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [183086821] [2019-12-27 16:13:11,782 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:13:11,801 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:13:12,017 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 363 transitions. [2019-12-27 16:13:12,018 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:13:12,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:13:12,401 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 16:13:12,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:13:12,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:13:12,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:13:12,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:13:12,402 INFO L87 Difference]: Start difference. First operand 31087 states and 94244 transitions. Second operand 18 states. [2019-12-27 16:13:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:13:17,398 INFO L93 Difference]: Finished difference Result 37951 states and 114703 transitions. [2019-12-27 16:13:17,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 16:13:17,399 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2019-12-27 16:13:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:13:17,453 INFO L225 Difference]: With dead ends: 37951 [2019-12-27 16:13:17,453 INFO L226 Difference]: Without dead ends: 34986 [2019-12-27 16:13:17,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 16:13:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34986 states. [2019-12-27 16:13:18,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34986 to 32237. [2019-12-27 16:13:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32237 states. [2019-12-27 16:13:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32237 states to 32237 states and 97531 transitions. [2019-12-27 16:13:18,275 INFO L78 Accepts]: Start accepts. Automaton has 32237 states and 97531 transitions. Word has length 65 [2019-12-27 16:13:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:13:18,275 INFO L462 AbstractCegarLoop]: Abstraction has 32237 states and 97531 transitions. [2019-12-27 16:13:18,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:13:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 32237 states and 97531 transitions. [2019-12-27 16:13:18,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:13:18,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:13:18,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:13:18,307 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:13:18,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:13:18,307 INFO L82 PathProgramCache]: Analyzing trace with hash -503372891, now seen corresponding path program 4 times [2019-12-27 16:13:18,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:13:18,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512340880] [2019-12-27 16:13:18,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:13:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:13:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:13:19,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512340880] [2019-12-27 16:13:19,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:13:19,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-27 16:13:19,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1180895711] [2019-12-27 16:13:19,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:13:19,382 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:13:19,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 483 transitions. [2019-12-27 16:13:19,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:13:20,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:13:20,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:13:20,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:13:20,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:13:20,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:13:20,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 51 times. [2019-12-27 16:13:20,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 16:13:20,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:13:20,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 16:13:20,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 16:13:20,763 INFO L87 Difference]: Start difference. First operand 32237 states and 97531 transitions. Second operand 35 states. [2019-12-27 16:13:25,800 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-12-27 16:13:27,516 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-12-27 16:13:31,824 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-12-27 16:13:38,566 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-12-27 16:13:42,772 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-12-27 16:13:43,615 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-12-27 16:13:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:13:46,648 INFO L93 Difference]: Finished difference Result 81548 states and 242592 transitions. [2019-12-27 16:13:46,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-12-27 16:13:46,648 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 65 [2019-12-27 16:13:46,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:13:46,760 INFO L225 Difference]: With dead ends: 81548 [2019-12-27 16:13:46,760 INFO L226 Difference]: Without dead ends: 75101 [2019-12-27 16:13:46,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 25 SyntacticMatches, 20 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10892 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=2211, Invalid=28941, Unknown=0, NotChecked=0, Total=31152 [2019-12-27 16:13:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75101 states. [2019-12-27 16:13:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75101 to 33810. [2019-12-27 16:13:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33810 states. [2019-12-27 16:13:47,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33810 states to 33810 states and 102137 transitions. [2019-12-27 16:13:47,545 INFO L78 Accepts]: Start accepts. Automaton has 33810 states and 102137 transitions. Word has length 65 [2019-12-27 16:13:47,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:13:47,545 INFO L462 AbstractCegarLoop]: Abstraction has 33810 states and 102137 transitions. [2019-12-27 16:13:47,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 16:13:47,546 INFO L276 IsEmpty]: Start isEmpty. Operand 33810 states and 102137 transitions. [2019-12-27 16:13:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:13:47,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:13:47,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:13:47,586 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:13:47,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:13:47,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1275313811, now seen corresponding path program 5 times [2019-12-27 16:13:47,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:13:47,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99894625] [2019-12-27 16:13:47,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:13:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:13:47,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:13:47,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99894625] [2019-12-27 16:13:47,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:13:47,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:13:47,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [79092409] [2019-12-27 16:13:47,771 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:13:47,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:13:48,152 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 272 states and 540 transitions. [2019-12-27 16:13:48,153 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:13:48,415 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 16:13:48,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:13:48,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:13:48,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:13:48,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:13:48,416 INFO L87 Difference]: Start difference. First operand 33810 states and 102137 transitions. Second operand 14 states. [2019-12-27 16:13:51,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:13:51,572 INFO L93 Difference]: Finished difference Result 88084 states and 265830 transitions. [2019-12-27 16:13:51,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 16:13:51,573 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 16:13:51,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:13:51,689 INFO L225 Difference]: With dead ends: 88084 [2019-12-27 16:13:51,689 INFO L226 Difference]: Without dead ends: 69681 [2019-12-27 16:13:51,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=356, Invalid=1714, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 16:13:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69681 states. [2019-12-27 16:13:52,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69681 to 30074. [2019-12-27 16:13:52,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30074 states. [2019-12-27 16:13:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30074 states to 30074 states and 91046 transitions. [2019-12-27 16:13:52,426 INFO L78 Accepts]: Start accepts. Automaton has 30074 states and 91046 transitions. Word has length 65 [2019-12-27 16:13:52,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:13:52,427 INFO L462 AbstractCegarLoop]: Abstraction has 30074 states and 91046 transitions. [2019-12-27 16:13:52,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:13:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 30074 states and 91046 transitions. [2019-12-27 16:13:52,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:13:52,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:13:52,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:13:52,458 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:13:52,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:13:52,458 INFO L82 PathProgramCache]: Analyzing trace with hash 720302319, now seen corresponding path program 6 times [2019-12-27 16:13:52,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:13:52,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364317466] [2019-12-27 16:13:52,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:13:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:13:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:13:52,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364317466] [2019-12-27 16:13:52,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:13:52,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:13:52,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1020609831] [2019-12-27 16:13:52,623 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:13:52,636 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:13:52,953 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 292 states and 552 transitions. [2019-12-27 16:13:52,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:13:53,324 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 16:13:53,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:13:53,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:13:53,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:13:53,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:13:53,325 INFO L87 Difference]: Start difference. First operand 30074 states and 91046 transitions. Second operand 13 states. [2019-12-27 16:13:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:13:54,666 INFO L93 Difference]: Finished difference Result 33136 states and 99353 transitions. [2019-12-27 16:13:54,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 16:13:54,667 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 16:13:54,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:13:54,710 INFO L225 Difference]: With dead ends: 33136 [2019-12-27 16:13:54,711 INFO L226 Difference]: Without dead ends: 32132 [2019-12-27 16:13:54,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 13 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:13:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32132 states. [2019-12-27 16:13:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32132 to 29674. [2019-12-27 16:13:55,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29674 states. [2019-12-27 16:13:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29674 states to 29674 states and 89895 transitions. [2019-12-27 16:13:55,367 INFO L78 Accepts]: Start accepts. Automaton has 29674 states and 89895 transitions. Word has length 65 [2019-12-27 16:13:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:13:55,367 INFO L462 AbstractCegarLoop]: Abstraction has 29674 states and 89895 transitions. [2019-12-27 16:13:55,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:13:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 29674 states and 89895 transitions. [2019-12-27 16:13:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:13:55,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:13:55,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:13:55,395 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:13:55,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:13:55,395 INFO L82 PathProgramCache]: Analyzing trace with hash 491693849, now seen corresponding path program 7 times [2019-12-27 16:13:55,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:13:55,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399349781] [2019-12-27 16:13:55,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:13:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:13:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:13:55,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399349781] [2019-12-27 16:13:55,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:13:55,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:13:55,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [950280264] [2019-12-27 16:13:55,451 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:13:55,464 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:13:55,646 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 399 transitions. [2019-12-27 16:13:55,647 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:13:55,647 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:13:55,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:13:55,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:13:55,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:13:55,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:13:55,648 INFO L87 Difference]: Start difference. First operand 29674 states and 89895 transitions. Second operand 3 states. [2019-12-27 16:13:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:13:55,734 INFO L93 Difference]: Finished difference Result 29673 states and 89893 transitions. [2019-12-27 16:13:55,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:13:55,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 16:13:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:13:55,775 INFO L225 Difference]: With dead ends: 29673 [2019-12-27 16:13:55,775 INFO L226 Difference]: Without dead ends: 29673 [2019-12-27 16:13:55,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:13:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29673 states. [2019-12-27 16:13:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29673 to 21548. [2019-12-27 16:13:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21548 states. [2019-12-27 16:13:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21548 states to 21548 states and 65950 transitions. [2019-12-27 16:13:56,166 INFO L78 Accepts]: Start accepts. Automaton has 21548 states and 65950 transitions. Word has length 65 [2019-12-27 16:13:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:13:56,166 INFO L462 AbstractCegarLoop]: Abstraction has 21548 states and 65950 transitions. [2019-12-27 16:13:56,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:13:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 21548 states and 65950 transitions. [2019-12-27 16:13:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:13:56,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:13:56,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:13:56,190 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:13:56,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:13:56,190 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 1 times [2019-12-27 16:13:56,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:13:56,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644169778] [2019-12-27 16:13:56,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:13:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:13:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:13:56,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644169778] [2019-12-27 16:13:56,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:13:56,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 16:13:56,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [440352196] [2019-12-27 16:13:56,657 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:13:56,667 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:13:56,912 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 326 states and 666 transitions. [2019-12-27 16:13:56,912 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:13:58,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 16:13:58,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 16:13:58,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:13:58,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 16:13:58,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:13:58,025 INFO L87 Difference]: Start difference. First operand 21548 states and 65950 transitions. Second operand 24 states. [2019-12-27 16:14:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:14:05,457 INFO L93 Difference]: Finished difference Result 40004 states and 120368 transitions. [2019-12-27 16:14:05,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 16:14:05,457 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2019-12-27 16:14:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:14:05,507 INFO L225 Difference]: With dead ends: 40004 [2019-12-27 16:14:05,507 INFO L226 Difference]: Without dead ends: 33402 [2019-12-27 16:14:05,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 15 SyntacticMatches, 20 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=483, Invalid=2597, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 16:14:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33402 states. [2019-12-27 16:14:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33402 to 24410. [2019-12-27 16:14:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24410 states. [2019-12-27 16:14:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24410 states to 24410 states and 74524 transitions. [2019-12-27 16:14:05,977 INFO L78 Accepts]: Start accepts. Automaton has 24410 states and 74524 transitions. Word has length 66 [2019-12-27 16:14:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:14:05,978 INFO L462 AbstractCegarLoop]: Abstraction has 24410 states and 74524 transitions. [2019-12-27 16:14:05,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 16:14:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 24410 states and 74524 transitions. [2019-12-27 16:14:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:14:06,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:14:06,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:14:06,009 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:14:06,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:14:06,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2033523235, now seen corresponding path program 2 times [2019-12-27 16:14:06,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:14:06,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541190411] [2019-12-27 16:14:06,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:14:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:14:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:14:06,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541190411] [2019-12-27 16:14:06,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:14:06,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:14:06,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1110888361] [2019-12-27 16:14:06,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:14:06,188 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:14:06,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 295 states and 583 transitions. [2019-12-27 16:14:06,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:14:06,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:14:06,867 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 16:14:06,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 16:14:06,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:14:06,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 16:14:06,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:14:06,868 INFO L87 Difference]: Start difference. First operand 24410 states and 74524 transitions. Second operand 16 states. [2019-12-27 16:14:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:14:08,724 INFO L93 Difference]: Finished difference Result 28391 states and 85864 transitions. [2019-12-27 16:14:08,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 16:14:08,724 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 16:14:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:14:08,763 INFO L225 Difference]: With dead ends: 28391 [2019-12-27 16:14:08,763 INFO L226 Difference]: Without dead ends: 28000 [2019-12-27 16:14:08,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:14:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28000 states. [2019-12-27 16:14:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28000 to 24226. [2019-12-27 16:14:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24226 states. [2019-12-27 16:14:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24226 states to 24226 states and 74058 transitions. [2019-12-27 16:14:09,338 INFO L78 Accepts]: Start accepts. Automaton has 24226 states and 74058 transitions. Word has length 66 [2019-12-27 16:14:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:14:09,338 INFO L462 AbstractCegarLoop]: Abstraction has 24226 states and 74058 transitions. [2019-12-27 16:14:09,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 16:14:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 24226 states and 74058 transitions. [2019-12-27 16:14:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:14:09,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:14:09,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:14:09,362 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:14:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:14:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 3 times [2019-12-27 16:14:09,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:14:09,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881678795] [2019-12-27 16:14:09,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:14:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:14:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:14:09,466 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:14:09,466 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:14:09,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t509~0.base_22|) 0) (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_ULTIMATE.start_main_~#t509~0.offset_16| 0) (= |v_#NULL.offset_6| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t509~0.base_22| 1) |v_#valid_69|) (= 0 v_~z$r_buff0_thd3~0_377) (= v_~__unbuffered_cnt~0_128 0) (= v_~z$r_buff0_thd1~0_378 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd0~0_195 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t509~0.base_22| 4)) (= v_~y~0_28 0) (= v_~z$w_buff1_used~0_500 0) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t509~0.base_22|) (= v_~z$r_buff0_thd2~0_182 0) (= 0 v_~z$r_buff1_thd3~0_396) (= 0 v_~x~0_245) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_35) (= v_~z$r_buff1_thd0~0_294 0) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= v_~__unbuffered_p2_EBX~0_48 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t509~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t509~0.base_22|) |v_ULTIMATE.start_main_~#t509~0.offset_16| 0)) |v_#memory_int_19|) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_~#t509~0.base=|v_ULTIMATE.start_main_~#t509~0.base_22|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_72|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_195, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ULTIMATE.start_main_~#t511~0.offset=|v_ULTIMATE.start_main_~#t511~0.offset_14|, ULTIMATE.start_main_~#t509~0.offset=|v_ULTIMATE.start_main_~#t509~0.offset_16|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_~#t510~0.offset=|v_ULTIMATE.start_main_~#t510~0.offset_14|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t510~0.base=|v_ULTIMATE.start_main_~#t510~0.base_19|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t511~0.base=|v_ULTIMATE.start_main_~#t511~0.base_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_377, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_245, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_294, ~y~0=v_~y~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_182, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_378} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t509~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t511~0.offset, ULTIMATE.start_main_~#t509~0.offset, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t510~0.offset, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t510~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t511~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:14:09,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~x~0_11 1) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 16:14:09,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t510~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t510~0.base_11|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t510~0.base_11| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t510~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t510~0.base_11|) |v_ULTIMATE.start_main_~#t510~0.offset_10| 1)) |v_#memory_int_13|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t510~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t510~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t510~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t510~0.offset=|v_ULTIMATE.start_main_~#t510~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t510~0.base=|v_ULTIMATE.start_main_~#t510~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t510~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t510~0.base, #length] because there is no mapped edge [2019-12-27 16:14:09,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t511~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t511~0.base_12| 4)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t511~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t511~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t511~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t511~0.base_12|) |v_ULTIMATE.start_main_~#t511~0.offset_10| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t511~0.offset_10| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t511~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t511~0.base=|v_ULTIMATE.start_main_~#t511~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t511~0.offset=|v_ULTIMATE.start_main_~#t511~0.offset_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t511~0.base, ULTIMATE.start_main_~#t511~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 16:14:09,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In-1160144017 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1160144017 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out-1160144017| |P1Thread1of1ForFork2_#t~ite9_Out-1160144017|))) (or (and (or .cse0 .cse1) (= ~z~0_In-1160144017 |P1Thread1of1ForFork2_#t~ite9_Out-1160144017|) .cse2) (and (= ~z$w_buff1~0_In-1160144017 |P1Thread1of1ForFork2_#t~ite9_Out-1160144017|) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1160144017, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1160144017, ~z$w_buff1~0=~z$w_buff1~0_In-1160144017, ~z~0=~z~0_In-1160144017} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1160144017|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1160144017, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1160144017|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1160144017, ~z$w_buff1~0=~z$w_buff1~0_In-1160144017, ~z~0=~z~0_In-1160144017} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 16:14:09,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-96333239 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_Out-96333239| ~z$w_buff1~0_In-96333239) .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out-96333239| |P2Thread1of1ForFork0_#t~ite23_Out-96333239|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-96333239 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-96333239 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-96333239 256)) (and (= (mod ~z$w_buff1_used~0_In-96333239 256) 0) .cse1)))) (and (= |P2Thread1of1ForFork0_#t~ite23_In-96333239| |P2Thread1of1ForFork0_#t~ite23_Out-96333239|) (= |P2Thread1of1ForFork0_#t~ite24_Out-96333239| ~z$w_buff1~0_In-96333239) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-96333239, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-96333239, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-96333239|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-96333239, ~z$w_buff1~0=~z$w_buff1~0_In-96333239, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-96333239, ~weak$$choice2~0=~weak$$choice2~0_In-96333239} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-96333239, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-96333239|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-96333239, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-96333239|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-96333239, ~z$w_buff1~0=~z$w_buff1~0_In-96333239, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-96333239, ~weak$$choice2~0=~weak$$choice2~0_In-96333239} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 16:14:09,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse5 (= (mod ~z$w_buff1_used~0_In-888188217 256) 0)) (.cse4 (= 0 (mod ~z$w_buff0_used~0_In-888188217 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-888188217 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-888188217 256))) (.cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out-888188217| |P2Thread1of1ForFork0_#t~ite30_Out-888188217|)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-888188217 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_In-888188217| |P2Thread1of1ForFork0_#t~ite28_Out-888188217|) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite29_Out-888188217| |P2Thread1of1ForFork0_#t~ite29_In-888188217|) (= ~z$w_buff1_used~0_In-888188217 |P2Thread1of1ForFork0_#t~ite30_Out-888188217|)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out-888188217| ~z$w_buff1_used~0_In-888188217) .cse0 .cse1 (or (and .cse2 .cse3) .cse4 (and .cse3 .cse5))))) (let ((.cse6 (not .cse3))) (and (or (not .cse5) .cse6) (not .cse4) (or (not .cse2) .cse6) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out-888188217|) .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out-888188217| |P2Thread1of1ForFork0_#t~ite28_Out-888188217|) .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-888188217|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-888188217, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-888188217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-888188217, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-888188217, ~weak$$choice2~0=~weak$$choice2~0_In-888188217, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-888188217|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-888188217|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-888188217, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-888188217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-888188217, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-888188217, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-888188217|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-888188217|, ~weak$$choice2~0=~weak$$choice2~0_In-888188217} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:14:09,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_371 v_~z$r_buff0_thd3~0_370) (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_370, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:14:09,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:14:09,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out1855930481| |P2Thread1of1ForFork0_#t~ite39_Out1855930481|)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1855930481 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1855930481 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out1855930481| ~z$w_buff1~0_In1855930481) (not .cse0) .cse1 (not .cse2)) (and .cse1 (or .cse2 .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out1855930481| ~z~0_In1855930481)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1855930481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1855930481, ~z$w_buff1~0=~z$w_buff1~0_In1855930481, ~z~0=~z~0_In1855930481} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1855930481|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1855930481|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1855930481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1855930481, ~z$w_buff1~0=~z$w_buff1~0_In1855930481, ~z~0=~z~0_In1855930481} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:14:09,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-755176662 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-755176662 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-755176662| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-755176662 |P2Thread1of1ForFork0_#t~ite40_Out-755176662|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-755176662, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-755176662} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-755176662, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-755176662|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-755176662} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:14:09,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In276248816 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In276248816 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In276248816 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In276248816 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out276248816| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out276248816| ~z$w_buff1_used~0_In276248816)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In276248816, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In276248816, ~z$w_buff1_used~0=~z$w_buff1_used~0_In276248816, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In276248816} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In276248816, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In276248816, ~z$w_buff1_used~0=~z$w_buff1_used~0_In276248816, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In276248816, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out276248816|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:14:09,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In44421764 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In44421764 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In44421764 |P2Thread1of1ForFork0_#t~ite42_Out44421764|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out44421764|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In44421764, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In44421764} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In44421764, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In44421764, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out44421764|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:14:09,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1685637533 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1685637533 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1685637533 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1685637533 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1685637533|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1685637533 |P2Thread1of1ForFork0_#t~ite43_Out-1685637533|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1685637533, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1685637533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1685637533, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1685637533} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1685637533|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1685637533, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1685637533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1685637533, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1685637533} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:14:09,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_308 |v_P2Thread1of1ForFork0_#t~ite43_56|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:14:09,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1551328388 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1551328388 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1551328388| 0)) (and (= ~z$w_buff0_used~0_In-1551328388 |P0Thread1of1ForFork1_#t~ite5_Out-1551328388|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1551328388, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1551328388} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1551328388|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1551328388, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1551328388} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:14:09,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1026363291 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1026363291 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1026363291 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1026363291 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1026363291| 0)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1026363291| ~z$w_buff1_used~0_In-1026363291) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1026363291, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1026363291, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1026363291, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1026363291} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1026363291, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1026363291|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1026363291, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1026363291, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1026363291} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:14:09,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-283491662 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-283491662 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-283491662 ~z$r_buff0_thd1~0_Out-283491662)) (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-283491662)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-283491662, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-283491662} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-283491662, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-283491662|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-283491662} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:14:09,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1063445195 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1063445195 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1063445195 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1063445195 256)))) (or (and (= ~z$r_buff1_thd1~0_In-1063445195 |P0Thread1of1ForFork1_#t~ite8_Out-1063445195|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1063445195|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1063445195, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1063445195, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1063445195, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1063445195} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1063445195|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1063445195, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1063445195, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1063445195, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1063445195} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:14:09,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:14:09,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2072394625 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In2072394625 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out2072394625|)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out2072394625| ~z$w_buff0_used~0_In2072394625) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2072394625, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2072394625} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2072394625, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out2072394625|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2072394625} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:14:09,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1741094974 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1741094974 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1741094974 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1741094974 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1741094974 |P1Thread1of1ForFork2_#t~ite12_Out1741094974|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1741094974|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1741094974, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1741094974, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1741094974, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1741094974} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1741094974, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1741094974, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1741094974, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1741094974|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1741094974} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:14:09,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1774932567 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1774932567 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out1774932567| ~z$r_buff0_thd2~0_In1774932567) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out1774932567| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1774932567, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1774932567} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1774932567, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1774932567|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1774932567} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:14:09,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1682944807 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1682944807 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1682944807 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In1682944807 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1682944807|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In1682944807 |P1Thread1of1ForFork2_#t~ite14_Out1682944807|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1682944807, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1682944807, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1682944807, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1682944807} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1682944807, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1682944807, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1682944807, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1682944807|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1682944807} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:14:09,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= v_~z$r_buff1_thd2~0_188 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:14:09,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:14:09,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In656765934 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In656765934 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out656765934| ~z~0_In656765934)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out656765934| ~z$w_buff1~0_In656765934) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In656765934, ~z$w_buff1_used~0=~z$w_buff1_used~0_In656765934, ~z$w_buff1~0=~z$w_buff1~0_In656765934, ~z~0=~z~0_In656765934} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In656765934, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out656765934|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In656765934, ~z$w_buff1~0=~z$w_buff1~0_In656765934, ~z~0=~z~0_In656765934} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:14:09,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 16:14:09,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-719441001 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-719441001 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-719441001|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-719441001 |ULTIMATE.start_main_#t~ite49_Out-719441001|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-719441001, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-719441001} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-719441001, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-719441001, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-719441001|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:14:09,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2002630720 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-2002630720 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-2002630720 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2002630720 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-2002630720| 0)) (and (= |ULTIMATE.start_main_#t~ite50_Out-2002630720| ~z$w_buff1_used~0_In-2002630720) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2002630720, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2002630720, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2002630720, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2002630720} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2002630720|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2002630720, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2002630720, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2002630720, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2002630720} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:14:09,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-160813072 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-160813072 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-160813072|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-160813072 |ULTIMATE.start_main_#t~ite51_Out-160813072|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-160813072, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-160813072} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-160813072, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-160813072|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-160813072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:14:09,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In3469198 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In3469198 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In3469198 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In3469198 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out3469198| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out3469198| ~z$r_buff1_thd0~0_In3469198)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In3469198, ~z$w_buff0_used~0=~z$w_buff0_used~0_In3469198, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In3469198, ~z$w_buff1_used~0=~z$w_buff1_used~0_In3469198} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out3469198|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In3469198, ~z$w_buff0_used~0=~z$w_buff0_used~0_In3469198, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In3469198, ~z$w_buff1_used~0=~z$w_buff1_used~0_In3469198} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:14:09,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p1_EAX~0_22) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 2 v_~x~0_186)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:14:09,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:14:09 BasicIcfg [2019-12-27 16:14:09,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:14:09,587 INFO L168 Benchmark]: Toolchain (without parser) took 177449.86 ms. Allocated memory was 137.4 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 100.7 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 881.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:14:09,587 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 16:14:09,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 872.15 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 154.9 MB in the end (delta: -54.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:14:09,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.75 ms. Allocated memory is still 201.9 MB. Free memory was 154.9 MB in the beginning and 152.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:14:09,589 INFO L168 Benchmark]: Boogie Preprocessor took 43.96 ms. Allocated memory is still 201.9 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:14:09,589 INFO L168 Benchmark]: RCFGBuilder took 883.90 ms. Allocated memory is still 201.9 MB. Free memory was 150.1 MB in the beginning and 99.8 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:14:09,590 INFO L168 Benchmark]: TraceAbstraction took 175583.70 ms. Allocated memory was 201.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.8 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 815.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:14:09,592 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 872.15 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 154.9 MB in the end (delta: -54.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.75 ms. Allocated memory is still 201.9 MB. Free memory was 154.9 MB in the beginning and 152.8 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.96 ms. Allocated memory is still 201.9 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 883.90 ms. Allocated memory is still 201.9 MB. Free memory was 150.1 MB in the beginning and 99.8 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 175583.70 ms. Allocated memory was 201.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.8 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 815.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7044 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t509, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t510, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 2 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t511, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 175.2s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 79.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8835 SDtfs, 12985 SDslu, 38327 SDs, 0 SdLazy, 45715 SolverSat, 859 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1011 GetRequests, 237 SyntacticMatches, 131 SemanticMatches, 643 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14485 ImplicationChecksByTransitivity, 22.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 50.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 412460 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1544 NumberOfCodeBlocks, 1544 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1445 ConstructedInterpolants, 0 QuantifiedInterpolants, 393095 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...