/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix049_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:26:09,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:26:09,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:26:09,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:26:09,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:26:09,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:26:09,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:26:09,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:26:09,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:26:09,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:26:09,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:26:09,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:26:09,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:26:09,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:26:09,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:26:09,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:26:09,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:26:09,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:26:09,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:26:09,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:26:09,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:26:09,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:26:09,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:26:09,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:26:09,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:26:09,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:26:09,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:26:09,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:26:09,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:26:09,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:26:09,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:26:09,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:26:09,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:26:09,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:26:09,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:26:09,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:26:09,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:26:09,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:26:09,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:26:09,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:26:09,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:26:09,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:26:09,935 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:26:09,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:26:09,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:26:09,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:26:09,937 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:26:09,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:26:09,938 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:26:09,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:26:09,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:26:09,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:26:09,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:26:09,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:26:09,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:26:09,939 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:26:09,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:26:09,939 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:26:09,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:26:09,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:26:09,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:26:09,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:26:09,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:26:09,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:26:09,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:26:09,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:26:09,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:26:09,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:26:09,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:26:09,941 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:26:09,942 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:26:09,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:26:09,942 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:26:09,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:26:10,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:26:10,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:26:10,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:26:10,240 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:26:10,241 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:26:10,241 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_pso.opt.i [2019-12-27 21:26:10,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceb24eef9/dbc9f0efcb41411793ee7ff5264381f2/FLAG4b8733aab [2019-12-27 21:26:10,908 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:26:10,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_pso.opt.i [2019-12-27 21:26:10,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceb24eef9/dbc9f0efcb41411793ee7ff5264381f2/FLAG4b8733aab [2019-12-27 21:26:11,163 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceb24eef9/dbc9f0efcb41411793ee7ff5264381f2 [2019-12-27 21:26:11,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:26:11,178 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:26:11,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:26:11,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:26:11,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:26:11,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:26:11" (1/1) ... [2019-12-27 21:26:11,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e8aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:26:11, skipping insertion in model container [2019-12-27 21:26:11,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:26:11" (1/1) ... [2019-12-27 21:26:11,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:26:11,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:26:11,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:26:11,813 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:26:11,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:26:11,959 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:26:11,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:26:11 WrapperNode [2019-12-27 21:26:11,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:26:11,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:26:11,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:26:11,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:26:11,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:26:11" (1/1) ... [2019-12-27 21:26:11,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:26:11" (1/1) ... [2019-12-27 21:26:12,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:26:12,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:26:12,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:26:12,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:26:12,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:26:11" (1/1) ... [2019-12-27 21:26:12,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:26:11" (1/1) ... [2019-12-27 21:26:12,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:26:11" (1/1) ... [2019-12-27 21:26:12,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:26:11" (1/1) ... [2019-12-27 21:26:12,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:26:11" (1/1) ... [2019-12-27 21:26:12,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:26:11" (1/1) ... [2019-12-27 21:26:12,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:26:11" (1/1) ... [2019-12-27 21:26:12,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:26:12,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:26:12,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:26:12,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:26:12,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:26:11" (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 21:26:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:26:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:26:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:26:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:26:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:26:12,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:26:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:26:12,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:26:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:26:12,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:26:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:26:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:26:12,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:26:12,132 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 21:26:12,951 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:26:12,951 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:26:12,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:26:12 BoogieIcfgContainer [2019-12-27 21:26:12,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:26:12,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:26:12,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:26:12,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:26:12,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:26:11" (1/3) ... [2019-12-27 21:26:12,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281625eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:26:12, skipping insertion in model container [2019-12-27 21:26:12,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:26:11" (2/3) ... [2019-12-27 21:26:12,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281625eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:26:12, skipping insertion in model container [2019-12-27 21:26:12,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:26:12" (3/3) ... [2019-12-27 21:26:12,962 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_pso.opt.i [2019-12-27 21:26:12,973 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:26:12,973 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:26:12,986 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:26:12,987 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:26:13,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,050 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,051 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,051 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,052 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,052 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,063 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,063 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,087 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,087 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,115 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,117 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,124 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,130 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,130 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:26:13,149 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:26:13,169 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:26:13,169 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:26:13,169 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:26:13,169 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:26:13,169 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:26:13,169 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:26:13,169 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:26:13,169 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:26:13,187 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 21:26:13,189 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 21:26:13,304 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 21:26:13,304 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:26:13,319 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 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:26:13,342 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 21:26:13,397 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 21:26:13,397 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:26:13,405 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 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:26:13,426 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 21:26:13,427 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:26:16,953 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 21:26:17,096 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 21:26:17,127 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85326 [2019-12-27 21:26:17,128 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 21:26:17,132 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 108 transitions [2019-12-27 21:26:39,967 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-27 21:26:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-27 21:26:39,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:26:39,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:26:39,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:26:39,976 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 21:26:39,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:26:39,981 INFO L82 PathProgramCache]: Analyzing trace with hash 910080, now seen corresponding path program 1 times [2019-12-27 21:26:39,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:26:39,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068175569] [2019-12-27 21:26:39,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:26:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:26:40,199 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 21:26:40,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068175569] [2019-12-27 21:26:40,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:26:40,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:26:40,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1322439536] [2019-12-27 21:26:40,204 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:26:40,208 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:26:40,221 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:26:40,221 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:26:40,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:26:40,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:26:40,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:26:40,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:26:40,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:26:40,243 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-27 21:26:41,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:26:41,419 INFO L93 Difference]: Finished difference Result 120110 states and 517368 transitions. [2019-12-27 21:26:41,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:26:41,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:26:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:26:45,502 INFO L225 Difference]: With dead ends: 120110 [2019-12-27 21:26:45,506 INFO L226 Difference]: Without dead ends: 112648 [2019-12-27 21:26:45,509 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 21:26:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112648 states. [2019-12-27 21:26:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112648 to 112648. [2019-12-27 21:26:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112648 states. [2019-12-27 21:26:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112648 states to 112648 states and 484580 transitions. [2019-12-27 21:26:58,093 INFO L78 Accepts]: Start accepts. Automaton has 112648 states and 484580 transitions. Word has length 3 [2019-12-27 21:26:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:26:58,094 INFO L462 AbstractCegarLoop]: Abstraction has 112648 states and 484580 transitions. [2019-12-27 21:26:58,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:26:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 112648 states and 484580 transitions. [2019-12-27 21:26:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:26:58,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:26:58,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:26:58,100 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 21:26:58,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:26:58,100 INFO L82 PathProgramCache]: Analyzing trace with hash 459684969, now seen corresponding path program 1 times [2019-12-27 21:26:58,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:26:58,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490451806] [2019-12-27 21:26:58,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:26:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:26:58,203 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 21:26:58,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490451806] [2019-12-27 21:26:58,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:26:58,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:26:58,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1277769979] [2019-12-27 21:26:58,204 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:26:58,206 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:26:58,211 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:26:58,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:26:58,213 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:26:58,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:26:58,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:26:58,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:26:58,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:26:58,215 INFO L87 Difference]: Start difference. First operand 112648 states and 484580 transitions. Second operand 4 states. [2019-12-27 21:27:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:04,212 INFO L93 Difference]: Finished difference Result 175220 states and 723657 transitions. [2019-12-27 21:27:04,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:27:04,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:27:04,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:04,911 INFO L225 Difference]: With dead ends: 175220 [2019-12-27 21:27:04,912 INFO L226 Difference]: Without dead ends: 175171 [2019-12-27 21:27:04,912 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 21:27:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175171 states. [2019-12-27 21:27:15,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175171 to 161661. [2019-12-27 21:27:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161661 states. [2019-12-27 21:27:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161661 states to 161661 states and 675776 transitions. [2019-12-27 21:27:15,566 INFO L78 Accepts]: Start accepts. Automaton has 161661 states and 675776 transitions. Word has length 11 [2019-12-27 21:27:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:15,567 INFO L462 AbstractCegarLoop]: Abstraction has 161661 states and 675776 transitions. [2019-12-27 21:27:15,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:27:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 161661 states and 675776 transitions. [2019-12-27 21:27:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:27:15,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:15,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:27:15,573 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 21:27:15,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:15,574 INFO L82 PathProgramCache]: Analyzing trace with hash 8923152, now seen corresponding path program 1 times [2019-12-27 21:27:15,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:15,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477372055] [2019-12-27 21:27:15,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:15,655 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 21:27:15,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477372055] [2019-12-27 21:27:15,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:15,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:27:15,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [46386023] [2019-12-27 21:27:15,657 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:15,658 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:15,660 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:27:15,660 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:15,660 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:27:15,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:27:15,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:15,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:27:15,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:27:15,661 INFO L87 Difference]: Start difference. First operand 161661 states and 675776 transitions. Second operand 3 states. [2019-12-27 21:27:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:15,848 INFO L93 Difference]: Finished difference Result 34935 states and 114696 transitions. [2019-12-27 21:27:15,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:27:15,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:27:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:15,915 INFO L225 Difference]: With dead ends: 34935 [2019-12-27 21:27:15,916 INFO L226 Difference]: Without dead ends: 34935 [2019-12-27 21:27:15,916 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 21:27:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34935 states. [2019-12-27 21:27:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34935 to 34935. [2019-12-27 21:27:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34935 states. [2019-12-27 21:27:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34935 states to 34935 states and 114696 transitions. [2019-12-27 21:27:21,744 INFO L78 Accepts]: Start accepts. Automaton has 34935 states and 114696 transitions. Word has length 13 [2019-12-27 21:27:21,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:21,745 INFO L462 AbstractCegarLoop]: Abstraction has 34935 states and 114696 transitions. [2019-12-27 21:27:21,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:27:21,745 INFO L276 IsEmpty]: Start isEmpty. Operand 34935 states and 114696 transitions. [2019-12-27 21:27:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:27:21,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:21,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:27:21,748 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 21:27:21,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:21,748 INFO L82 PathProgramCache]: Analyzing trace with hash 846496093, now seen corresponding path program 1 times [2019-12-27 21:27:21,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:21,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395133085] [2019-12-27 21:27:21,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:21,817 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 21:27:21,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395133085] [2019-12-27 21:27:21,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:21,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:27:21,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2060989374] [2019-12-27 21:27:21,822 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:21,824 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:21,828 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:27:21,829 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:21,829 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:27:21,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:27:21,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:21,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:27:21,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:27:21,831 INFO L87 Difference]: Start difference. First operand 34935 states and 114696 transitions. Second operand 3 states. [2019-12-27 21:27:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:22,075 INFO L93 Difference]: Finished difference Result 52469 states and 171833 transitions. [2019-12-27 21:27:22,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:27:22,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:27:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:22,165 INFO L225 Difference]: With dead ends: 52469 [2019-12-27 21:27:22,165 INFO L226 Difference]: Without dead ends: 52469 [2019-12-27 21:27:22,165 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 21:27:22,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52469 states. [2019-12-27 21:27:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52469 to 39684. [2019-12-27 21:27:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39684 states. [2019-12-27 21:27:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39684 states to 39684 states and 131828 transitions. [2019-12-27 21:27:23,360 INFO L78 Accepts]: Start accepts. Automaton has 39684 states and 131828 transitions. Word has length 16 [2019-12-27 21:27:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:23,361 INFO L462 AbstractCegarLoop]: Abstraction has 39684 states and 131828 transitions. [2019-12-27 21:27:23,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:27:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 39684 states and 131828 transitions. [2019-12-27 21:27:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:27:23,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:23,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:27:23,365 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 21:27:23,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:23,365 INFO L82 PathProgramCache]: Analyzing trace with hash 973495126, now seen corresponding path program 1 times [2019-12-27 21:27:23,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:23,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215914956] [2019-12-27 21:27:23,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:23,470 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 21:27:23,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215914956] [2019-12-27 21:27:23,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:23,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:27:23,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1101452078] [2019-12-27 21:27:23,472 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:23,475 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:23,478 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:27:23,478 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:23,478 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:27:23,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:27:23,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:23,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:27:23,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:27:23,479 INFO L87 Difference]: Start difference. First operand 39684 states and 131828 transitions. Second operand 5 states. [2019-12-27 21:27:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:23,982 INFO L93 Difference]: Finished difference Result 54128 states and 176711 transitions. [2019-12-27 21:27:23,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:27:23,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:27:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:24,075 INFO L225 Difference]: With dead ends: 54128 [2019-12-27 21:27:24,076 INFO L226 Difference]: Without dead ends: 54128 [2019-12-27 21:27:24,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:27:24,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54128 states. [2019-12-27 21:27:24,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54128 to 45196. [2019-12-27 21:27:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45196 states. [2019-12-27 21:27:25,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45196 states to 45196 states and 149182 transitions. [2019-12-27 21:27:25,652 INFO L78 Accepts]: Start accepts. Automaton has 45196 states and 149182 transitions. Word has length 16 [2019-12-27 21:27:25,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:25,652 INFO L462 AbstractCegarLoop]: Abstraction has 45196 states and 149182 transitions. [2019-12-27 21:27:25,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:27:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 45196 states and 149182 transitions. [2019-12-27 21:27:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:27:25,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:25,666 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 21:27:25,667 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 21:27:25,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:25,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1203621831, now seen corresponding path program 1 times [2019-12-27 21:27:25,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:25,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128543557] [2019-12-27 21:27:25,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:25,838 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 21:27:25,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128543557] [2019-12-27 21:27:25,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:25,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:27:25,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [604421054] [2019-12-27 21:27:25,840 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:25,844 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:25,850 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 21:27:25,850 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:25,894 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:27:25,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:27:25,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:25,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:27:25,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:27:25,896 INFO L87 Difference]: Start difference. First operand 45196 states and 149182 transitions. Second operand 7 states. [2019-12-27 21:27:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:26,958 INFO L93 Difference]: Finished difference Result 67629 states and 216350 transitions. [2019-12-27 21:27:26,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:27:26,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 21:27:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:27,086 INFO L225 Difference]: With dead ends: 67629 [2019-12-27 21:27:27,086 INFO L226 Difference]: Without dead ends: 67622 [2019-12-27 21:27:27,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:27:27,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2019-12-27 21:27:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 44823. [2019-12-27 21:27:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44823 states. [2019-12-27 21:27:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44823 states to 44823 states and 147733 transitions. [2019-12-27 21:27:28,742 INFO L78 Accepts]: Start accepts. Automaton has 44823 states and 147733 transitions. Word has length 22 [2019-12-27 21:27:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:28,742 INFO L462 AbstractCegarLoop]: Abstraction has 44823 states and 147733 transitions. [2019-12-27 21:27:28,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:27:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 44823 states and 147733 transitions. [2019-12-27 21:27:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:27:28,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:28,759 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 21:27:28,760 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 21:27:28,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:28,760 INFO L82 PathProgramCache]: Analyzing trace with hash -573645910, now seen corresponding path program 1 times [2019-12-27 21:27:28,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:28,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750065078] [2019-12-27 21:27:28,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:28,819 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 21:27:28,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750065078] [2019-12-27 21:27:28,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:28,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:27:28,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [782273577] [2019-12-27 21:27:28,820 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:28,823 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:28,832 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:27:28,832 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:28,867 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:27:28,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:27:28,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:28,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:27:28,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:27:28,870 INFO L87 Difference]: Start difference. First operand 44823 states and 147733 transitions. Second operand 5 states. [2019-12-27 21:27:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:28,954 INFO L93 Difference]: Finished difference Result 18428 states and 57604 transitions. [2019-12-27 21:27:28,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:27:28,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:27:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:28,982 INFO L225 Difference]: With dead ends: 18428 [2019-12-27 21:27:28,982 INFO L226 Difference]: Without dead ends: 18428 [2019-12-27 21:27:28,983 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 21:27:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-12-27 21:27:29,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18100. [2019-12-27 21:27:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18100 states. [2019-12-27 21:27:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18100 states to 18100 states and 56668 transitions. [2019-12-27 21:27:29,284 INFO L78 Accepts]: Start accepts. Automaton has 18100 states and 56668 transitions. Word has length 25 [2019-12-27 21:27:29,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:29,285 INFO L462 AbstractCegarLoop]: Abstraction has 18100 states and 56668 transitions. [2019-12-27 21:27:29,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:27:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 18100 states and 56668 transitions. [2019-12-27 21:27:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:27:29,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:29,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:27:29,299 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 21:27:29,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:29,299 INFO L82 PathProgramCache]: Analyzing trace with hash -558988390, now seen corresponding path program 1 times [2019-12-27 21:27:29,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:29,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920726194] [2019-12-27 21:27:29,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:29,379 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 21:27:29,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920726194] [2019-12-27 21:27:29,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:29,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:27:29,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [391291327] [2019-12-27 21:27:29,380 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:29,383 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:29,389 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:27:29,389 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:29,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:27:29,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:27:29,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:29,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:27:29,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:27:29,391 INFO L87 Difference]: Start difference. First operand 18100 states and 56668 transitions. Second operand 6 states. [2019-12-27 21:27:30,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:30,075 INFO L93 Difference]: Finished difference Result 25507 states and 76943 transitions. [2019-12-27 21:27:30,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:27:30,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:27:30,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:30,116 INFO L225 Difference]: With dead ends: 25507 [2019-12-27 21:27:30,116 INFO L226 Difference]: Without dead ends: 25507 [2019-12-27 21:27:30,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:27:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2019-12-27 21:27:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 20897. [2019-12-27 21:27:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20897 states. [2019-12-27 21:27:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 64463 transitions. [2019-12-27 21:27:30,511 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 64463 transitions. Word has length 27 [2019-12-27 21:27:30,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:30,511 INFO L462 AbstractCegarLoop]: Abstraction has 20897 states and 64463 transitions. [2019-12-27 21:27:30,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:27:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 64463 transitions. [2019-12-27 21:27:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:27:30,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:30,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:27:30,536 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 21:27:30,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:30,536 INFO L82 PathProgramCache]: Analyzing trace with hash -856650103, now seen corresponding path program 1 times [2019-12-27 21:27:30,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:30,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763262807] [2019-12-27 21:27:30,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:30,635 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 21:27:30,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763262807] [2019-12-27 21:27:30,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:30,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:27:30,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [244519284] [2019-12-27 21:27:30,637 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:30,642 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:30,654 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 21:27:30,654 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:30,673 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:27:30,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:27:30,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:30,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:27:30,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:27:30,674 INFO L87 Difference]: Start difference. First operand 20897 states and 64463 transitions. Second operand 8 states. [2019-12-27 21:27:32,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:32,074 INFO L93 Difference]: Finished difference Result 28486 states and 85230 transitions. [2019-12-27 21:27:32,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:27:32,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 21:27:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:32,135 INFO L225 Difference]: With dead ends: 28486 [2019-12-27 21:27:32,136 INFO L226 Difference]: Without dead ends: 28486 [2019-12-27 21:27:32,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:27:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28486 states. [2019-12-27 21:27:32,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28486 to 19834. [2019-12-27 21:27:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19834 states. [2019-12-27 21:27:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 61281 transitions. [2019-12-27 21:27:32,530 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 61281 transitions. Word has length 33 [2019-12-27 21:27:32,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:32,531 INFO L462 AbstractCegarLoop]: Abstraction has 19834 states and 61281 transitions. [2019-12-27 21:27:32,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:27:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 61281 transitions. [2019-12-27 21:27:32,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:27:32,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:32,557 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 21:27:32,557 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 21:27:32,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:32,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1785376658, now seen corresponding path program 1 times [2019-12-27 21:27:32,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:32,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876603274] [2019-12-27 21:27:32,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:32,645 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 21:27:32,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876603274] [2019-12-27 21:27:32,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:32,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:27:32,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [57434261] [2019-12-27 21:27:32,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:32,653 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:32,706 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 287 transitions. [2019-12-27 21:27:32,707 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:32,786 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:27:32,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:27:32,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:32,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:27:32,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:27:32,788 INFO L87 Difference]: Start difference. First operand 19834 states and 61281 transitions. Second operand 8 states. [2019-12-27 21:27:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:33,953 INFO L93 Difference]: Finished difference Result 28283 states and 86522 transitions. [2019-12-27 21:27:33,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:27:33,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-27 21:27:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:34,000 INFO L225 Difference]: With dead ends: 28283 [2019-12-27 21:27:34,001 INFO L226 Difference]: Without dead ends: 28283 [2019-12-27 21:27:34,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:27:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2019-12-27 21:27:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 26386. [2019-12-27 21:27:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26386 states. [2019-12-27 21:27:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 81240 transitions. [2019-12-27 21:27:34,455 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 81240 transitions. Word has length 39 [2019-12-27 21:27:34,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:34,455 INFO L462 AbstractCegarLoop]: Abstraction has 26386 states and 81240 transitions. [2019-12-27 21:27:34,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:27:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 81240 transitions. [2019-12-27 21:27:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:27:34,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:34,486 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 21:27:34,486 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 21:27:34,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:34,487 INFO L82 PathProgramCache]: Analyzing trace with hash -967157718, now seen corresponding path program 2 times [2019-12-27 21:27:34,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:34,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394023393] [2019-12-27 21:27:34,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:34,552 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 21:27:34,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394023393] [2019-12-27 21:27:34,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:34,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:27:34,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1702815641] [2019-12-27 21:27:34,553 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:34,560 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:34,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 331 transitions. [2019-12-27 21:27:34,621 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:34,659 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:27:34,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:27:34,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:34,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:27:34,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:27:34,661 INFO L87 Difference]: Start difference. First operand 26386 states and 81240 transitions. Second operand 7 states. [2019-12-27 21:27:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:35,097 INFO L93 Difference]: Finished difference Result 24998 states and 77951 transitions. [2019-12-27 21:27:35,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:27:35,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 21:27:35,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:35,145 INFO L225 Difference]: With dead ends: 24998 [2019-12-27 21:27:35,145 INFO L226 Difference]: Without dead ends: 24998 [2019-12-27 21:27:35,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:27:35,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24998 states. [2019-12-27 21:27:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24998 to 24032. [2019-12-27 21:27:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24032 states. [2019-12-27 21:27:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24032 states to 24032 states and 75345 transitions. [2019-12-27 21:27:35,521 INFO L78 Accepts]: Start accepts. Automaton has 24032 states and 75345 transitions. Word has length 39 [2019-12-27 21:27:35,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:35,521 INFO L462 AbstractCegarLoop]: Abstraction has 24032 states and 75345 transitions. [2019-12-27 21:27:35,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:27:35,522 INFO L276 IsEmpty]: Start isEmpty. Operand 24032 states and 75345 transitions. [2019-12-27 21:27:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:27:35,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:35,547 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 21:27:35,547 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 21:27:35,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:35,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1198798044, now seen corresponding path program 1 times [2019-12-27 21:27:35,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:35,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490428741] [2019-12-27 21:27:35,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:35,690 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 21:27:35,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490428741] [2019-12-27 21:27:35,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:35,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:27:35,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2005461171] [2019-12-27 21:27:35,691 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:35,712 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:35,885 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 321 transitions. [2019-12-27 21:27:35,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:35,919 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:27:35,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:27:35,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:35,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:27:35,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:27:35,920 INFO L87 Difference]: Start difference. First operand 24032 states and 75345 transitions. Second operand 8 states. [2019-12-27 21:27:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:36,824 INFO L93 Difference]: Finished difference Result 82358 states and 256539 transitions. [2019-12-27 21:27:36,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:27:36,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 21:27:36,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:36,941 INFO L225 Difference]: With dead ends: 82358 [2019-12-27 21:27:36,941 INFO L226 Difference]: Without dead ends: 66507 [2019-12-27 21:27:36,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:27:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66507 states. [2019-12-27 21:27:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66507 to 27688. [2019-12-27 21:27:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27688 states. [2019-12-27 21:27:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27688 states to 27688 states and 87532 transitions. [2019-12-27 21:27:38,091 INFO L78 Accepts]: Start accepts. Automaton has 27688 states and 87532 transitions. Word has length 64 [2019-12-27 21:27:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:38,091 INFO L462 AbstractCegarLoop]: Abstraction has 27688 states and 87532 transitions. [2019-12-27 21:27:38,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:27:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 27688 states and 87532 transitions. [2019-12-27 21:27:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:27:38,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:38,132 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 21:27:38,132 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 21:27:38,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:38,133 INFO L82 PathProgramCache]: Analyzing trace with hash 207970498, now seen corresponding path program 2 times [2019-12-27 21:27:38,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:38,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941818395] [2019-12-27 21:27:38,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:38,225 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 21:27:38,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941818395] [2019-12-27 21:27:38,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:38,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:27:38,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1687830314] [2019-12-27 21:27:38,226 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:38,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:38,379 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 275 transitions. [2019-12-27 21:27:38,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:38,440 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:27:38,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:27:38,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:38,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:27:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:27:38,442 INFO L87 Difference]: Start difference. First operand 27688 states and 87532 transitions. Second operand 10 states. [2019-12-27 21:27:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:40,723 INFO L93 Difference]: Finished difference Result 88226 states and 275339 transitions. [2019-12-27 21:27:40,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:27:40,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 21:27:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:40,839 INFO L225 Difference]: With dead ends: 88226 [2019-12-27 21:27:40,840 INFO L226 Difference]: Without dead ends: 65053 [2019-12-27 21:27:40,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:27:41,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65053 states. [2019-12-27 21:27:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65053 to 32348. [2019-12-27 21:27:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32348 states. [2019-12-27 21:27:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32348 states to 32348 states and 102236 transitions. [2019-12-27 21:27:42,129 INFO L78 Accepts]: Start accepts. Automaton has 32348 states and 102236 transitions. Word has length 64 [2019-12-27 21:27:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:42,129 INFO L462 AbstractCegarLoop]: Abstraction has 32348 states and 102236 transitions. [2019-12-27 21:27:42,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:27:42,129 INFO L276 IsEmpty]: Start isEmpty. Operand 32348 states and 102236 transitions. [2019-12-27 21:27:42,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:27:42,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:42,165 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 21:27:42,166 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 21:27:42,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:42,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1789319912, now seen corresponding path program 3 times [2019-12-27 21:27:42,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:42,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015219653] [2019-12-27 21:27:42,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:42,250 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 21:27:42,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015219653] [2019-12-27 21:27:42,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:42,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:27:42,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [9669283] [2019-12-27 21:27:42,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:42,273 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:42,475 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 361 transitions. [2019-12-27 21:27:42,475 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:42,520 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:27:42,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:27:42,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:42,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:27:42,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:27:42,521 INFO L87 Difference]: Start difference. First operand 32348 states and 102236 transitions. Second operand 8 states. [2019-12-27 21:27:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:44,286 INFO L93 Difference]: Finished difference Result 87822 states and 272155 transitions. [2019-12-27 21:27:44,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:27:44,287 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 21:27:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:44,492 INFO L225 Difference]: With dead ends: 87822 [2019-12-27 21:27:44,492 INFO L226 Difference]: Without dead ends: 78373 [2019-12-27 21:27:44,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:27:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78373 states. [2019-12-27 21:27:46,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78373 to 32656. [2019-12-27 21:27:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32656 states. [2019-12-27 21:27:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32656 states to 32656 states and 103187 transitions. [2019-12-27 21:27:46,103 INFO L78 Accepts]: Start accepts. Automaton has 32656 states and 103187 transitions. Word has length 64 [2019-12-27 21:27:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:46,103 INFO L462 AbstractCegarLoop]: Abstraction has 32656 states and 103187 transitions. [2019-12-27 21:27:46,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:27:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 32656 states and 103187 transitions. [2019-12-27 21:27:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:27:46,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:46,146 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 21:27:46,146 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 21:27:46,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:46,146 INFO L82 PathProgramCache]: Analyzing trace with hash 755538776, now seen corresponding path program 4 times [2019-12-27 21:27:46,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:46,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017479851] [2019-12-27 21:27:46,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:27:46,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017479851] [2019-12-27 21:27:46,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:46,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:27:46,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1671498767] [2019-12-27 21:27:46,225 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:46,244 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:46,500 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 500 transitions. [2019-12-27 21:27:46,500 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:46,501 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:27:46,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:27:46,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:46,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:27:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:27:46,501 INFO L87 Difference]: Start difference. First operand 32656 states and 103187 transitions. Second operand 3 states. [2019-12-27 21:27:46,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:46,664 INFO L93 Difference]: Finished difference Result 39410 states and 123345 transitions. [2019-12-27 21:27:46,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:27:46,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 21:27:46,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:46,719 INFO L225 Difference]: With dead ends: 39410 [2019-12-27 21:27:46,719 INFO L226 Difference]: Without dead ends: 39410 [2019-12-27 21:27:46,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:27:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39410 states. [2019-12-27 21:27:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39410 to 34552. [2019-12-27 21:27:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34552 states. [2019-12-27 21:27:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34552 states to 34552 states and 109132 transitions. [2019-12-27 21:27:47,648 INFO L78 Accepts]: Start accepts. Automaton has 34552 states and 109132 transitions. Word has length 64 [2019-12-27 21:27:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:47,648 INFO L462 AbstractCegarLoop]: Abstraction has 34552 states and 109132 transitions. [2019-12-27 21:27:47,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:27:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 34552 states and 109132 transitions. [2019-12-27 21:27:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:27:47,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:47,686 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 21:27:47,686 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 21:27:47,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:47,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2009701319, now seen corresponding path program 1 times [2019-12-27 21:27:47,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:47,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268739686] [2019-12-27 21:27:47,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:47,739 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 21:27:47,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268739686] [2019-12-27 21:27:47,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:47,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:27:47,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1135439276] [2019-12-27 21:27:47,742 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:47,775 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:47,948 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 304 transitions. [2019-12-27 21:27:47,948 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:47,967 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:27:47,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:27:47,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:47,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:27:47,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:27:47,968 INFO L87 Difference]: Start difference. First operand 34552 states and 109132 transitions. Second operand 5 states. [2019-12-27 21:27:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:48,574 INFO L93 Difference]: Finished difference Result 61028 states and 191780 transitions. [2019-12-27 21:27:48,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:27:48,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 21:27:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:48,682 INFO L225 Difference]: With dead ends: 61028 [2019-12-27 21:27:48,682 INFO L226 Difference]: Without dead ends: 61028 [2019-12-27 21:27:48,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:27:48,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61028 states. [2019-12-27 21:27:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61028 to 37988. [2019-12-27 21:27:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37988 states. [2019-12-27 21:27:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37988 states to 37988 states and 121326 transitions. [2019-12-27 21:27:50,060 INFO L78 Accepts]: Start accepts. Automaton has 37988 states and 121326 transitions. Word has length 65 [2019-12-27 21:27:50,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:50,061 INFO L462 AbstractCegarLoop]: Abstraction has 37988 states and 121326 transitions. [2019-12-27 21:27:50,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:27:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 37988 states and 121326 transitions. [2019-12-27 21:27:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:27:50,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:50,103 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 21:27:50,104 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 21:27:50,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:50,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2089376379, now seen corresponding path program 2 times [2019-12-27 21:27:50,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:50,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347554772] [2019-12-27 21:27:50,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:50,163 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 21:27:50,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347554772] [2019-12-27 21:27:50,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:50,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:27:50,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1949234486] [2019-12-27 21:27:50,164 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:50,186 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:50,379 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 173 states and 296 transitions. [2019-12-27 21:27:50,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:50,388 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:27:50,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:27:50,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:50,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:27:50,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:27:50,389 INFO L87 Difference]: Start difference. First operand 37988 states and 121326 transitions. Second operand 3 states. [2019-12-27 21:27:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:50,675 INFO L93 Difference]: Finished difference Result 53096 states and 168447 transitions. [2019-12-27 21:27:50,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:27:50,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:27:50,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:50,760 INFO L225 Difference]: With dead ends: 53096 [2019-12-27 21:27:50,760 INFO L226 Difference]: Without dead ends: 53096 [2019-12-27 21:27:50,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 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 21:27:50,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53096 states. [2019-12-27 21:27:51,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53096 to 38139. [2019-12-27 21:27:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38139 states. [2019-12-27 21:27:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38139 states to 38139 states and 121744 transitions. [2019-12-27 21:27:51,489 INFO L78 Accepts]: Start accepts. Automaton has 38139 states and 121744 transitions. Word has length 65 [2019-12-27 21:27:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:51,490 INFO L462 AbstractCegarLoop]: Abstraction has 38139 states and 121744 transitions. [2019-12-27 21:27:51,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:27:51,490 INFO L276 IsEmpty]: Start isEmpty. Operand 38139 states and 121744 transitions. [2019-12-27 21:27:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:27:51,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:51,538 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 21:27:51,538 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 21:27:51,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:51,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1789961201, now seen corresponding path program 3 times [2019-12-27 21:27:51,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:51,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551833999] [2019-12-27 21:27:51,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:51,628 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 21:27:51,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551833999] [2019-12-27 21:27:51,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:51,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:27:51,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1267016217] [2019-12-27 21:27:51,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:51,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:52,213 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 279 transitions. [2019-12-27 21:27:52,213 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:52,237 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:27:52,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:27:52,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:52,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:27:52,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:27:52,239 INFO L87 Difference]: Start difference. First operand 38139 states and 121744 transitions. Second operand 7 states. [2019-12-27 21:27:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:52,852 INFO L93 Difference]: Finished difference Result 80217 states and 251951 transitions. [2019-12-27 21:27:52,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:27:52,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 21:27:52,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:52,964 INFO L225 Difference]: With dead ends: 80217 [2019-12-27 21:27:52,964 INFO L226 Difference]: Without dead ends: 73955 [2019-12-27 21:27:52,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:27:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73955 states. [2019-12-27 21:27:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73955 to 38203. [2019-12-27 21:27:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38203 states. [2019-12-27 21:27:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38203 states to 38203 states and 121962 transitions. [2019-12-27 21:27:53,903 INFO L78 Accepts]: Start accepts. Automaton has 38203 states and 121962 transitions. Word has length 65 [2019-12-27 21:27:53,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:53,903 INFO L462 AbstractCegarLoop]: Abstraction has 38203 states and 121962 transitions. [2019-12-27 21:27:53,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:27:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 38203 states and 121962 transitions. [2019-12-27 21:27:53,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:27:53,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:53,949 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 21:27:53,949 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 21:27:53,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:53,950 INFO L82 PathProgramCache]: Analyzing trace with hash 206855563, now seen corresponding path program 4 times [2019-12-27 21:27:53,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:53,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716222461] [2019-12-27 21:27:53,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:54,048 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 21:27:54,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716222461] [2019-12-27 21:27:54,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:54,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:27:54,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [75876318] [2019-12-27 21:27:54,049 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:54,069 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:54,294 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 387 transitions. [2019-12-27 21:27:54,294 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:54,387 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:27:54,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:27:54,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:54,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:27:54,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:27:54,389 INFO L87 Difference]: Start difference. First operand 38203 states and 121962 transitions. Second operand 10 states. [2019-12-27 21:27:54,721 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-12-27 21:27:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:56,697 INFO L93 Difference]: Finished difference Result 93660 states and 294565 transitions. [2019-12-27 21:27:56,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 21:27:56,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 21:27:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:56,875 INFO L225 Difference]: With dead ends: 93660 [2019-12-27 21:27:56,875 INFO L226 Difference]: Without dead ends: 93660 [2019-12-27 21:27:56,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:27:57,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93660 states. [2019-12-27 21:27:57,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93660 to 36001. [2019-12-27 21:27:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36001 states. [2019-12-27 21:27:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36001 states to 36001 states and 113537 transitions. [2019-12-27 21:27:57,919 INFO L78 Accepts]: Start accepts. Automaton has 36001 states and 113537 transitions. Word has length 65 [2019-12-27 21:27:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:57,920 INFO L462 AbstractCegarLoop]: Abstraction has 36001 states and 113537 transitions. [2019-12-27 21:27:57,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:27:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 36001 states and 113537 transitions. [2019-12-27 21:27:57,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:27:57,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:57,958 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 21:27:57,958 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 21:27:57,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:57,958 INFO L82 PathProgramCache]: Analyzing trace with hash -217073613, now seen corresponding path program 5 times [2019-12-27 21:27:57,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:57,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438845650] [2019-12-27 21:27:57,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:58,025 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 21:27:58,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438845650] [2019-12-27 21:27:58,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:58,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:27:58,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [880731134] [2019-12-27 21:27:58,026 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:58,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:58,629 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 237 states and 414 transitions. [2019-12-27 21:27:58,630 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:58,630 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:27:58,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:27:58,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:58,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:27:58,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:27:58,631 INFO L87 Difference]: Start difference. First operand 36001 states and 113537 transitions. Second operand 4 states. [2019-12-27 21:27:58,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:27:58,830 INFO L93 Difference]: Finished difference Result 43922 states and 137939 transitions. [2019-12-27 21:27:58,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:27:58,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 21:27:58,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:27:58,892 INFO L225 Difference]: With dead ends: 43922 [2019-12-27 21:27:58,893 INFO L226 Difference]: Without dead ends: 43922 [2019-12-27 21:27:58,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 21:27:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43922 states. [2019-12-27 21:27:59,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43922 to 36010. [2019-12-27 21:27:59,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36010 states. [2019-12-27 21:27:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36010 states to 36010 states and 114136 transitions. [2019-12-27 21:27:59,520 INFO L78 Accepts]: Start accepts. Automaton has 36010 states and 114136 transitions. Word has length 65 [2019-12-27 21:27:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:27:59,520 INFO L462 AbstractCegarLoop]: Abstraction has 36010 states and 114136 transitions. [2019-12-27 21:27:59,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:27:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 36010 states and 114136 transitions. [2019-12-27 21:27:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:27:59,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:27:59,558 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 21:27:59,558 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 21:27:59,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:27:59,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1865713068, now seen corresponding path program 1 times [2019-12-27 21:27:59,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:27:59,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522151472] [2019-12-27 21:27:59,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:27:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:27:59,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 21:27:59,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522151472] [2019-12-27 21:27:59,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:27:59,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:27:59,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [716169585] [2019-12-27 21:27:59,623 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:27:59,642 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:27:59,927 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 501 transitions. [2019-12-27 21:27:59,927 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:27:59,928 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:27:59,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:27:59,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:27:59,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:27:59,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:27:59,929 INFO L87 Difference]: Start difference. First operand 36010 states and 114136 transitions. Second operand 3 states. [2019-12-27 21:28:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:28:00,033 INFO L93 Difference]: Finished difference Result 36010 states and 114135 transitions. [2019-12-27 21:28:00,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:28:00,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:28:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:28:00,087 INFO L225 Difference]: With dead ends: 36010 [2019-12-27 21:28:00,087 INFO L226 Difference]: Without dead ends: 36010 [2019-12-27 21:28:00,088 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 21:28:00,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36010 states. [2019-12-27 21:28:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36010 to 31976. [2019-12-27 21:28:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31976 states. [2019-12-27 21:28:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31976 states to 31976 states and 102860 transitions. [2019-12-27 21:28:01,098 INFO L78 Accepts]: Start accepts. Automaton has 31976 states and 102860 transitions. Word has length 65 [2019-12-27 21:28:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:28:01,098 INFO L462 AbstractCegarLoop]: Abstraction has 31976 states and 102860 transitions. [2019-12-27 21:28:01,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:28:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 31976 states and 102860 transitions. [2019-12-27 21:28:01,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:28:01,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:28:01,138 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 21:28:01,138 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 21:28:01,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:28:01,138 INFO L82 PathProgramCache]: Analyzing trace with hash 747197170, now seen corresponding path program 1 times [2019-12-27 21:28:01,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:28:01,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163177093] [2019-12-27 21:28:01,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:28:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:28:01,202 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 21:28:01,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163177093] [2019-12-27 21:28:01,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:28:01,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:28:01,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1069306040] [2019-12-27 21:28:01,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:28:01,219 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:28:01,527 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 280 states and 502 transitions. [2019-12-27 21:28:01,527 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:28:01,536 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:28:01,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:28:01,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:28:01,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:28:01,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:28:01,537 INFO L87 Difference]: Start difference. First operand 31976 states and 102860 transitions. Second operand 4 states. [2019-12-27 21:28:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:28:01,823 INFO L93 Difference]: Finished difference Result 34683 states and 108446 transitions. [2019-12-27 21:28:01,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:28:01,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 21:28:01,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:28:01,873 INFO L225 Difference]: With dead ends: 34683 [2019-12-27 21:28:01,873 INFO L226 Difference]: Without dead ends: 34683 [2019-12-27 21:28:01,873 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 21:28:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34683 states. [2019-12-27 21:28:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34683 to 24273. [2019-12-27 21:28:02,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24273 states. [2019-12-27 21:28:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24273 states to 24273 states and 76412 transitions. [2019-12-27 21:28:02,320 INFO L78 Accepts]: Start accepts. Automaton has 24273 states and 76412 transitions. Word has length 66 [2019-12-27 21:28:02,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:28:02,320 INFO L462 AbstractCegarLoop]: Abstraction has 24273 states and 76412 transitions. [2019-12-27 21:28:02,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:28:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 24273 states and 76412 transitions. [2019-12-27 21:28:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:28:02,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:28:02,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:28:02,352 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 21:28:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:28:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash 863231349, now seen corresponding path program 1 times [2019-12-27 21:28:02,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:28:02,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379294279] [2019-12-27 21:28:02,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:28:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:28:02,507 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 21:28:02,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379294279] [2019-12-27 21:28:02,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:28:02,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:28:02,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2048170018] [2019-12-27 21:28:02,508 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:28:02,524 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:28:02,748 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 322 transitions. [2019-12-27 21:28:02,749 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:28:02,854 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:28:02,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:28:02,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:28:02,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:28:02,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:28:02,855 INFO L87 Difference]: Start difference. First operand 24273 states and 76412 transitions. Second operand 12 states. [2019-12-27 21:28:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:28:04,422 INFO L93 Difference]: Finished difference Result 35523 states and 111659 transitions. [2019-12-27 21:28:04,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:28:04,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 21:28:04,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:28:04,465 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 21:28:04,465 INFO L226 Difference]: Without dead ends: 28791 [2019-12-27 21:28:04,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2019-12-27 21:28:04,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28791 states. [2019-12-27 21:28:05,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28791 to 24621. [2019-12-27 21:28:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24621 states. [2019-12-27 21:28:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24621 states to 24621 states and 77383 transitions. [2019-12-27 21:28:05,146 INFO L78 Accepts]: Start accepts. Automaton has 24621 states and 77383 transitions. Word has length 67 [2019-12-27 21:28:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:28:05,146 INFO L462 AbstractCegarLoop]: Abstraction has 24621 states and 77383 transitions. [2019-12-27 21:28:05,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:28:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 24621 states and 77383 transitions. [2019-12-27 21:28:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:28:05,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:28:05,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:28:05,171 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 21:28:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:28:05,172 INFO L82 PathProgramCache]: Analyzing trace with hash -783490325, now seen corresponding path program 2 times [2019-12-27 21:28:05,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:28:05,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724758484] [2019-12-27 21:28:05,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:28:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:28:05,350 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 21:28:05,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724758484] [2019-12-27 21:28:05,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:28:05,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:28:05,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1517109205] [2019-12-27 21:28:05,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:28:05,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:28:05,518 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 341 transitions. [2019-12-27 21:28:05,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:28:05,639 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 21:28:05,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:28:05,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:28:05,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:28:05,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:28:05,640 INFO L87 Difference]: Start difference. First operand 24621 states and 77383 transitions. Second operand 13 states. [2019-12-27 21:28:07,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:28:07,425 INFO L93 Difference]: Finished difference Result 45644 states and 141958 transitions. [2019-12-27 21:28:07,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 21:28:07,426 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 21:28:07,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:28:07,484 INFO L225 Difference]: With dead ends: 45644 [2019-12-27 21:28:07,484 INFO L226 Difference]: Without dead ends: 40426 [2019-12-27 21:28:07,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:28:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40426 states. [2019-12-27 21:28:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40426 to 25169. [2019-12-27 21:28:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25169 states. [2019-12-27 21:28:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25169 states to 25169 states and 78786 transitions. [2019-12-27 21:28:07,993 INFO L78 Accepts]: Start accepts. Automaton has 25169 states and 78786 transitions. Word has length 67 [2019-12-27 21:28:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:28:07,994 INFO L462 AbstractCegarLoop]: Abstraction has 25169 states and 78786 transitions. [2019-12-27 21:28:07,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:28:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 25169 states and 78786 transitions. [2019-12-27 21:28:08,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:28:08,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:28:08,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:28:08,022 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 21:28:08,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:28:08,022 INFO L82 PathProgramCache]: Analyzing trace with hash 17868619, now seen corresponding path program 3 times [2019-12-27 21:28:08,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:28:08,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751853902] [2019-12-27 21:28:08,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:28:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:28:08,193 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 21:28:08,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751853902] [2019-12-27 21:28:08,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:28:08,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:28:08,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [163270311] [2019-12-27 21:28:08,194 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:28:08,208 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:28:08,774 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 302 states and 617 transitions. [2019-12-27 21:28:08,774 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:28:08,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:28:08,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:28:09,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 21:28:09,566 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:28:09,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 21:28:09,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:28:09,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 21:28:09,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:28:09,568 INFO L87 Difference]: Start difference. First operand 25169 states and 78786 transitions. Second operand 19 states. [2019-12-27 21:28:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:28:12,807 INFO L93 Difference]: Finished difference Result 34459 states and 107407 transitions. [2019-12-27 21:28:12,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:28:12,808 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 21:28:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:28:12,852 INFO L225 Difference]: With dead ends: 34459 [2019-12-27 21:28:12,852 INFO L226 Difference]: Without dead ends: 30448 [2019-12-27 21:28:12,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-12-27 21:28:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30448 states. [2019-12-27 21:28:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30448 to 24805. [2019-12-27 21:28:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24805 states. [2019-12-27 21:28:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24805 states to 24805 states and 77645 transitions. [2019-12-27 21:28:13,297 INFO L78 Accepts]: Start accepts. Automaton has 24805 states and 77645 transitions. Word has length 67 [2019-12-27 21:28:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:28:13,297 INFO L462 AbstractCegarLoop]: Abstraction has 24805 states and 77645 transitions. [2019-12-27 21:28:13,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 21:28:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 24805 states and 77645 transitions. [2019-12-27 21:28:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:28:13,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:28:13,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:28:13,323 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 21:28:13,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:28:13,323 INFO L82 PathProgramCache]: Analyzing trace with hash 455548979, now seen corresponding path program 4 times [2019-12-27 21:28:13,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:28:13,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626131911] [2019-12-27 21:28:13,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:28:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:28:13,504 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 21:28:13,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626131911] [2019-12-27 21:28:13,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:28:13,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:28:13,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1325619729] [2019-12-27 21:28:13,505 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:28:13,518 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:28:13,675 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 324 transitions. [2019-12-27 21:28:13,676 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:28:13,834 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:28:13,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:28:13,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:28:13,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:28:13,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:28:13,835 INFO L87 Difference]: Start difference. First operand 24805 states and 77645 transitions. Second operand 15 states. [2019-12-27 21:28:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:28:16,148 INFO L93 Difference]: Finished difference Result 50603 states and 158867 transitions. [2019-12-27 21:28:16,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 21:28:16,149 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 21:28:16,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:28:16,217 INFO L225 Difference]: With dead ends: 50603 [2019-12-27 21:28:16,217 INFO L226 Difference]: Without dead ends: 48055 [2019-12-27 21:28:16,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 21:28:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48055 states. [2019-12-27 21:28:16,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48055 to 28332. [2019-12-27 21:28:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28332 states. [2019-12-27 21:28:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28332 states to 28332 states and 88818 transitions. [2019-12-27 21:28:16,819 INFO L78 Accepts]: Start accepts. Automaton has 28332 states and 88818 transitions. Word has length 67 [2019-12-27 21:28:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:28:16,819 INFO L462 AbstractCegarLoop]: Abstraction has 28332 states and 88818 transitions. [2019-12-27 21:28:16,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:28:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 28332 states and 88818 transitions. [2019-12-27 21:28:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:28:16,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:28:16,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:28:16,852 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 21:28:16,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:28:16,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1142961965, now seen corresponding path program 5 times [2019-12-27 21:28:16,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:28:16,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192096856] [2019-12-27 21:28:16,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:28:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:28:17,591 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 21:28:17,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192096856] [2019-12-27 21:28:17,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:28:17,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 21:28:17,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1015140271] [2019-12-27 21:28:17,593 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:28:17,607 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:28:17,906 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 323 states and 677 transitions. [2019-12-27 21:28:17,907 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:28:18,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:28:18,826 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 21:28:18,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 21:28:18,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:28:18,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 21:28:18,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2019-12-27 21:28:18,827 INFO L87 Difference]: Start difference. First operand 28332 states and 88818 transitions. Second operand 30 states. [2019-12-27 21:28:23,476 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2019-12-27 21:28:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:28:35,426 INFO L93 Difference]: Finished difference Result 72523 states and 221832 transitions. [2019-12-27 21:28:35,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-12-27 21:28:35,426 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 21:28:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:28:35,533 INFO L225 Difference]: With dead ends: 72523 [2019-12-27 21:28:35,533 INFO L226 Difference]: Without dead ends: 68051 [2019-12-27 21:28:35,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 13 SyntacticMatches, 17 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3362 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1365, Invalid=9977, Unknown=0, NotChecked=0, Total=11342 [2019-12-27 21:28:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68051 states. [2019-12-27 21:28:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68051 to 29878. [2019-12-27 21:28:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29878 states. [2019-12-27 21:28:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29878 states to 29878 states and 93126 transitions. [2019-12-27 21:28:36,604 INFO L78 Accepts]: Start accepts. Automaton has 29878 states and 93126 transitions. Word has length 67 [2019-12-27 21:28:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:28:36,604 INFO L462 AbstractCegarLoop]: Abstraction has 29878 states and 93126 transitions. [2019-12-27 21:28:36,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 21:28:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 29878 states and 93126 transitions. [2019-12-27 21:28:36,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:28:36,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:28:36,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:28:36,640 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 21:28:36,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:28:36,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1883446901, now seen corresponding path program 6 times [2019-12-27 21:28:36,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:28:36,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247566184] [2019-12-27 21:28:36,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:28:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:28:36,886 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 21:28:36,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247566184] [2019-12-27 21:28:36,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:28:36,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:28:36,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [95654825] [2019-12-27 21:28:36,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:28:36,896 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:28:37,030 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 332 transitions. [2019-12-27 21:28:37,030 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:28:38,372 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-12-27 21:28:38,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 21:28:38,629 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 21:28:38,630 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 21:28:38,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 21:28:38,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:28:38,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 21:28:38,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2019-12-27 21:28:38,632 INFO L87 Difference]: Start difference. First operand 29878 states and 93126 transitions. Second operand 30 states. [2019-12-27 21:28:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:28:52,717 INFO L93 Difference]: Finished difference Result 86305 states and 261561 transitions. [2019-12-27 21:28:52,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 21:28:52,718 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 21:28:52,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:28:52,816 INFO L225 Difference]: With dead ends: 86305 [2019-12-27 21:28:52,816 INFO L226 Difference]: Without dead ends: 61976 [2019-12-27 21:28:52,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2727 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1733, Invalid=8979, Unknown=0, NotChecked=0, Total=10712 [2019-12-27 21:28:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61976 states. [2019-12-27 21:28:53,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61976 to 36156. [2019-12-27 21:28:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36156 states. [2019-12-27 21:28:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36156 states to 36156 states and 113038 transitions. [2019-12-27 21:28:53,643 INFO L78 Accepts]: Start accepts. Automaton has 36156 states and 113038 transitions. Word has length 67 [2019-12-27 21:28:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:28:53,643 INFO L462 AbstractCegarLoop]: Abstraction has 36156 states and 113038 transitions. [2019-12-27 21:28:53,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 21:28:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 36156 states and 113038 transitions. [2019-12-27 21:28:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:28:53,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:28:53,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:28:53,692 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 21:28:53,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:28:53,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1208603803, now seen corresponding path program 7 times [2019-12-27 21:28:53,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:28:53,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254822749] [2019-12-27 21:28:53,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:28:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:28:53,876 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 21:28:53,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254822749] [2019-12-27 21:28:53,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:28:53,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:28:53,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2042085202] [2019-12-27 21:28:53,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:28:53,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:28:54,569 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 310 states and 633 transitions. [2019-12-27 21:28:54,569 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:28:55,009 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 21:28:55,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 21:28:55,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:28:55,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 21:28:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:28:55,010 INFO L87 Difference]: Start difference. First operand 36156 states and 113038 transitions. Second operand 18 states. [2019-12-27 21:29:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:02,619 INFO L93 Difference]: Finished difference Result 102722 states and 315866 transitions. [2019-12-27 21:29:02,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-12-27 21:29:02,620 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 21:29:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:02,750 INFO L225 Difference]: With dead ends: 102722 [2019-12-27 21:29:02,750 INFO L226 Difference]: Without dead ends: 82661 [2019-12-27 21:29:02,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3566 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1699, Invalid=8603, Unknown=0, NotChecked=0, Total=10302 [2019-12-27 21:29:03,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82661 states. [2019-12-27 21:29:03,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82661 to 32016. [2019-12-27 21:29:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32016 states. [2019-12-27 21:29:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32016 states to 32016 states and 100147 transitions. [2019-12-27 21:29:03,965 INFO L78 Accepts]: Start accepts. Automaton has 32016 states and 100147 transitions. Word has length 67 [2019-12-27 21:29:03,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:03,965 INFO L462 AbstractCegarLoop]: Abstraction has 32016 states and 100147 transitions. [2019-12-27 21:29:03,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 21:29:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 32016 states and 100147 transitions. [2019-12-27 21:29:04,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:29:04,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:04,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:04,004 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 21:29:04,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:04,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1929562173, now seen corresponding path program 8 times [2019-12-27 21:29:04,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:04,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998618396] [2019-12-27 21:29:04,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:29:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:29:04,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:29:04,112 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:29:04,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1306~0.base_21| 1)) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_78 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$w_buff0_used~0_113 0) (= v_~z$read_delayed_var~0.offset_6 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1306~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1306~0.base_21|) |v_ULTIMATE.start_main_~#t1306~0.offset_16| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~z$w_buff0~0_27) (= 0 v_~z$r_buff1_thd2~0_17) (= 0 v_~z$flush_delayed~0_13) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~z$r_buff0_thd1~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= |v_ULTIMATE.start_main_~#t1306~0.offset_16| 0) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1306~0.base_21| 4)) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd0~0_18 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1306~0.base_21|) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_26) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1306~0.base_21|)) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1308~0.base=|v_ULTIMATE.start_main_~#t1308~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_~#t1307~0.offset=|v_ULTIMATE.start_main_~#t1307~0.offset_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ULTIMATE.start_main_~#t1307~0.base=|v_ULTIMATE.start_main_~#t1307~0.base_19|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ULTIMATE.start_main_~#t1306~0.base=|v_ULTIMATE.start_main_~#t1306~0.base_21|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~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_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t1306~0.offset=|v_ULTIMATE.start_main_~#t1306~0.offset_16|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~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_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_~#t1308~0.offset=|v_ULTIMATE.start_main_~#t1308~0.offset_15|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1308~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1307~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1307~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1306~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1306~0.offset, ~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_~#t1308~0.offset, 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 21:29:04,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1307~0.offset_9|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1307~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1307~0.base_11|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1307~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1307~0.base_11|) |v_ULTIMATE.start_main_~#t1307~0.offset_9| 1))) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1307~0.base_11| 1)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1307~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1307~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1307~0.base=|v_ULTIMATE.start_main_~#t1307~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1307~0.offset=|v_ULTIMATE.start_main_~#t1307~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1307~0.base, #length, ULTIMATE.start_main_~#t1307~0.offset] because there is no mapped edge [2019-12-27 21:29:04,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_16 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_17 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff1_thd3~0_33) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_4) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_10)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_16, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~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] because there is no mapped edge [2019-12-27 21:29:04,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1147577923 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1147577923 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1147577923| ~z~0_In-1147577923) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-1147577923| ~z$w_buff1~0_In-1147577923) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1147577923, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1147577923, ~z$w_buff1~0=~z$w_buff1~0_In-1147577923, ~z~0=~z~0_In-1147577923} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1147577923|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1147577923, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1147577923, ~z$w_buff1~0=~z$w_buff1~0_In-1147577923, ~z~0=~z~0_In-1147577923} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 21:29:04,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 21:29:04,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L824-1-->L826: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1308~0.base_13| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1308~0.base_13| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1308~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1308~0.base_13|) |v_ULTIMATE.start_main_~#t1308~0.offset_11| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1308~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1308~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1308~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1308~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1308~0.base=|v_ULTIMATE.start_main_~#t1308~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1308~0.offset=|v_ULTIMATE.start_main_~#t1308~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1308~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1308~0.offset] because there is no mapped edge [2019-12-27 21:29:04,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In385373264 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In385373264 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In385373264 |P1Thread1of1ForFork2_#t~ite11_Out385373264|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out385373264|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In385373264, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In385373264} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In385373264, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out385373264|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In385373264} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 21:29:04,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1588124087 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1588124087 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1588124087 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1588124087 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1588124087| ~z$w_buff1_used~0_In-1588124087) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1588124087| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1588124087, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1588124087, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1588124087, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1588124087} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1588124087, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1588124087, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1588124087, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1588124087|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1588124087} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 21:29:04,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-954721810 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-954721810 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-954721810|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-954721810 |P1Thread1of1ForFork2_#t~ite13_Out-954721810|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-954721810, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-954721810} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-954721810, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-954721810|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-954721810} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 21:29:04,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-634365658 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-634365658| ~z$w_buff0_used~0_In-634365658) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-634365658| |P2Thread1of1ForFork0_#t~ite26_Out-634365658|)) (and (= |P2Thread1of1ForFork0_#t~ite26_Out-634365658| |P2Thread1of1ForFork0_#t~ite27_Out-634365658|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-634365658 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-634365658 256))) (= 0 (mod ~z$w_buff0_used~0_In-634365658 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-634365658 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite26_Out-634365658| ~z$w_buff0_used~0_In-634365658)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-634365658|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-634365658, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-634365658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-634365658, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-634365658, ~weak$$choice2~0=~weak$$choice2~0_In-634365658} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-634365658|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-634365658|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-634365658, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-634365658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-634365658, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-634365658, ~weak$$choice2~0=~weak$$choice2~0_In-634365658} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 21:29:04,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_63 v_~z$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 21:29:04,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-389870546 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-389870546 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-389870546|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-389870546 |P0Thread1of1ForFork1_#t~ite5_Out-389870546|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-389870546, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-389870546} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-389870546|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-389870546, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-389870546} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 21:29:04,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:29:04,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1786662452 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1786662452 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1786662452| |P2Thread1of1ForFork0_#t~ite39_Out1786662452|))) (or (and (not .cse0) (not .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1786662452| ~z$w_buff1~0_In1786662452)) (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1786662452| ~z~0_In1786662452)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1786662452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1786662452, ~z$w_buff1~0=~z$w_buff1~0_In1786662452, ~z~0=~z~0_In1786662452} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1786662452|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1786662452|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1786662452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1786662452, ~z$w_buff1~0=~z$w_buff1~0_In1786662452, ~z~0=~z~0_In1786662452} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 21:29:04,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In248231995 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In248231995 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out248231995| ~z$w_buff0_used~0_In248231995)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out248231995| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In248231995, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In248231995} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In248231995, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out248231995|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In248231995} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 21:29:04,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1063522128 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1063522128 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1063522128 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1063522128 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out1063522128| ~z$w_buff1_used~0_In1063522128) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out1063522128| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1063522128, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1063522128, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1063522128, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1063522128} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1063522128, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1063522128, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1063522128, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1063522128, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1063522128|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 21:29:04,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1801489328 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1801489328 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1801489328|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1801489328| ~z$r_buff0_thd3~0_In1801489328)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1801489328, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1801489328} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1801489328, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1801489328, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1801489328|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 21:29:04,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In1923029573 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1923029573 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1923029573 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1923029573 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1923029573 |P2Thread1of1ForFork0_#t~ite43_Out1923029573|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1923029573|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1923029573, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1923029573, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1923029573, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1923029573} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1923029573|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1923029573, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1923029573, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1923029573, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1923029573} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 21:29:04,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, 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 21:29:04,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In1693486402 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1693486402 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1693486402 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1693486402 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1693486402 |P0Thread1of1ForFork1_#t~ite6_Out1693486402|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1693486402|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1693486402, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1693486402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1693486402, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1693486402} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1693486402, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1693486402|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1693486402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1693486402, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1693486402} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 21:29:04,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1431314168 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1431314168 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-1431314168 ~z$r_buff0_thd1~0_Out-1431314168)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-1431314168)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1431314168, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1431314168} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1431314168, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1431314168|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1431314168} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:29:04,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1304129698 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1304129698 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In1304129698 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1304129698 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1304129698| ~z$r_buff1_thd1~0_In1304129698) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out1304129698| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1304129698, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1304129698, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1304129698, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1304129698} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1304129698|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1304129698, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1304129698, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1304129698, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1304129698} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:29:04,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} 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 21:29:04,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-995396765 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-995396765 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-995396765 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-995396765 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-995396765|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In-995396765 |P1Thread1of1ForFork2_#t~ite14_Out-995396765|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-995396765, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-995396765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-995396765, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-995396765} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-995396765, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-995396765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-995396765, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-995396765|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-995396765} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 21:29:04,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, 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 21:29:04,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:29:04,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-31922195| |ULTIMATE.start_main_#t~ite47_Out-31922195|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-31922195 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-31922195 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-31922195| ~z~0_In-31922195) .cse0 (or .cse1 .cse2)) (and (= |ULTIMATE.start_main_#t~ite47_Out-31922195| ~z$w_buff1~0_In-31922195) .cse0 (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-31922195, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-31922195, ~z$w_buff1~0=~z$w_buff1~0_In-31922195, ~z~0=~z~0_In-31922195} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-31922195, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-31922195|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-31922195, ~z$w_buff1~0=~z$w_buff1~0_In-31922195, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-31922195|, ~z~0=~z~0_In-31922195} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 21:29:04,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1418687278 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1418687278 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out1418687278|) (not .cse1)) (and (= ~z$w_buff0_used~0_In1418687278 |ULTIMATE.start_main_#t~ite49_Out1418687278|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1418687278, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1418687278} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1418687278, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1418687278, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1418687278|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 21:29:04,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1168212236 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1168212236 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1168212236 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1168212236 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1168212236| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1168212236 |ULTIMATE.start_main_#t~ite50_Out-1168212236|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1168212236, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1168212236, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1168212236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1168212236} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1168212236|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1168212236, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1168212236, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1168212236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1168212236} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 21:29:04,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In592562717 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In592562717 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In592562717 |ULTIMATE.start_main_#t~ite51_Out592562717|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out592562717|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In592562717, ~z$w_buff0_used~0=~z$w_buff0_used~0_In592562717} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In592562717, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out592562717|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In592562717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 21:29:04,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In246941066 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In246941066 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In246941066 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In246941066 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out246941066|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In246941066 |ULTIMATE.start_main_#t~ite52_Out246941066|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In246941066, ~z$w_buff0_used~0=~z$w_buff0_used~0_In246941066, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In246941066, ~z$w_buff1_used~0=~z$w_buff1_used~0_In246941066} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out246941066|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In246941066, ~z$w_buff0_used~0=~z$w_buff0_used~0_In246941066, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In246941066, ~z$w_buff1_used~0=~z$w_buff1_used~0_In246941066} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 21:29:04,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} 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 21:29:04,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:29:04 BasicIcfg [2019-12-27 21:29:04,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:29:04,223 INFO L168 Benchmark]: Toolchain (without parser) took 173045.73 ms. Allocated memory was 145.8 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 101.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 21:29:04,224 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:29:04,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.04 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 101.5 MB in the beginning and 155.5 MB in the end (delta: -54.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:29:04,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.90 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:29:04,228 INFO L168 Benchmark]: Boogie Preprocessor took 41.35 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:29:04,228 INFO L168 Benchmark]: RCFGBuilder took 887.00 ms. Allocated memory is still 202.4 MB. Free memory was 150.3 MB in the beginning and 100.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:29:04,231 INFO L168 Benchmark]: TraceAbstraction took 171267.42 ms. Allocated memory was 202.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 21:29:04,234 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.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.04 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 101.5 MB in the beginning and 155.5 MB in the end (delta: -54.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.90 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.35 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 887.00 ms. Allocated memory is still 202.4 MB. Free memory was 150.3 MB in the beginning and 100.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 171267.42 ms. Allocated memory was 202.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 29 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85326 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1306, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=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] [L824] FCALL, FORK 0 pthread_create(&t1307, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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 = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L766] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1308, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 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) [L788] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [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 [L788] 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)) [L789] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 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)) [L790] 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)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 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)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [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 [L799] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 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) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 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 [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [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 [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 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 [L835] 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: 170.9s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 76.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7910 SDtfs, 15334 SDslu, 38060 SDs, 0 SdLazy, 39677 SolverSat, 1253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 770 GetRequests, 120 SyntacticMatches, 67 SemanticMatches, 583 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10593 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161661occurred 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: 51.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 509773 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1492 NumberOfCodeBlocks, 1492 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1396 ConstructedInterpolants, 0 QuantifiedInterpolants, 295786 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...