/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:23:11,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:23:11,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:23:11,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:23:11,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:23:11,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:23:11,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:23:11,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:23:11,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:23:11,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:23:11,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:23:11,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:23:11,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:23:11,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:23:11,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:23:11,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:23:11,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:23:11,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:23:11,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:23:11,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:23:11,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:23:11,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:23:11,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:23:11,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:23:11,950 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:23:11,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:23:11,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:23:11,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:23:11,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:23:11,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:23:11,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:23:11,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:23:11,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:23:11,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:23:11,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:23:11,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:23:11,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:23:11,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:23:11,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:23:11,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:23:11,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:23:11,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:23:11,992 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:23:11,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:23:11,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:23:11,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:23:11,994 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:23:11,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:23:11,995 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:23:11,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:23:11,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:23:11,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:23:11,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:23:11,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:23:11,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:23:11,996 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:23:11,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:23:11,997 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:23:11,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:23:11,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:23:11,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:23:11,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:23:11,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:23:11,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:23:11,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:23:11,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:23:11,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:23:11,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:23:11,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:23:11,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:23:11,999 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:23:11,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:23:12,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:23:12,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:23:12,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:23:12,299 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:23:12,299 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:23:12,300 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i [2019-12-26 22:23:12,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a9f6da3/57984ed3ca894066b1cc743abb26a6f8/FLAGb57cd33b4 [2019-12-26 22:23:12,871 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:23:12,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i [2019-12-26 22:23:12,892 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a9f6da3/57984ed3ca894066b1cc743abb26a6f8/FLAGb57cd33b4 [2019-12-26 22:23:13,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a9f6da3/57984ed3ca894066b1cc743abb26a6f8 [2019-12-26 22:23:13,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:23:13,206 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:23:13,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:23:13,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:23:13,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:23:13,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:23:13" (1/1) ... [2019-12-26 22:23:13,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:13, skipping insertion in model container [2019-12-26 22:23:13,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:23:13" (1/1) ... [2019-12-26 22:23:13,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:23:13,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:23:13,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:23:13,828 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:23:13,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:23:13,965 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:23:13,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:13 WrapperNode [2019-12-26 22:23:13,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:23:13,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:23:13,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:23:13,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:23:13,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:13" (1/1) ... [2019-12-26 22:23:14,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:13" (1/1) ... [2019-12-26 22:23:14,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:23:14,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:23:14,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:23:14,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:23:14,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:13" (1/1) ... [2019-12-26 22:23:14,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:13" (1/1) ... [2019-12-26 22:23:14,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:13" (1/1) ... [2019-12-26 22:23:14,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:13" (1/1) ... [2019-12-26 22:23:14,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:13" (1/1) ... [2019-12-26 22:23:14,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:13" (1/1) ... [2019-12-26 22:23:14,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:13" (1/1) ... [2019-12-26 22:23:14,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:23:14,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:23:14,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:23:14,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:23:14,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:23:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:23:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:23:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:23:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:23:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:23:14,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:23:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:23:14,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:23:14,162 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:23:14,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:23:14,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:23:14,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:23:14,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:23:14,164 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:23:15,002 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:23:15,003 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:23:15,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:23:15 BoogieIcfgContainer [2019-12-26 22:23:15,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:23:15,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:23:15,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:23:15,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:23:15,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:23:13" (1/3) ... [2019-12-26 22:23:15,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657f3d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:23:15, skipping insertion in model container [2019-12-26 22:23:15,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:13" (2/3) ... [2019-12-26 22:23:15,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657f3d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:23:15, skipping insertion in model container [2019-12-26 22:23:15,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:23:15" (3/3) ... [2019-12-26 22:23:15,013 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_tso.oepc.i [2019-12-26 22:23:15,023 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:23:15,023 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:23:15,030 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:23:15,031 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:23:15,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,073 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,073 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,089 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,090 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,098 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,098 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,157 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,159 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,175 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,176 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,176 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,179 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,179 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:15,198 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:23:15,218 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:23:15,219 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:23:15,219 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:23:15,219 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:23:15,220 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:23:15,221 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:23:15,221 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:23:15,221 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:23:15,243 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-26 22:23:15,245 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 22:23:15,357 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 22:23:15,357 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:23:15,376 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:23:15,403 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 22:23:15,487 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 22:23:15,488 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:23:15,496 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:23:15,517 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 22:23:15,518 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:23:20,929 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 22:23:21,070 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 22:23:21,192 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83880 [2019-12-26 22:23:21,193 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-26 22:23:21,196 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-26 22:23:41,383 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118052 states. [2019-12-26 22:23:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 118052 states. [2019-12-26 22:23:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:23:41,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:41,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:23:41,393 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-26 22:23:41,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:41,400 INFO L82 PathProgramCache]: Analyzing trace with hash 918883, now seen corresponding path program 1 times [2019-12-26 22:23:41,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:41,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901432703] [2019-12-26 22:23:41,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:23:41,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901432703] [2019-12-26 22:23:41,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:41,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:23:41,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213110537] [2019-12-26 22:23:41,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:23:41,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:41,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:23:41,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:23:41,681 INFO L87 Difference]: Start difference. First operand 118052 states. Second operand 3 states. [2019-12-26 22:23:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:43,288 INFO L93 Difference]: Finished difference Result 117122 states and 502402 transitions. [2019-12-26 22:23:43,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:23:43,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:23:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:23:44,022 INFO L225 Difference]: With dead ends: 117122 [2019-12-26 22:23:44,023 INFO L226 Difference]: Without dead ends: 109842 [2019-12-26 22:23:44,025 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-26 22:23:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109842 states. [2019-12-26 22:23:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109842 to 109842. [2019-12-26 22:23:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109842 states. [2019-12-26 22:23:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109842 states to 109842 states and 470538 transitions. [2019-12-26 22:23:54,341 INFO L78 Accepts]: Start accepts. Automaton has 109842 states and 470538 transitions. Word has length 3 [2019-12-26 22:23:54,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:23:54,341 INFO L462 AbstractCegarLoop]: Abstraction has 109842 states and 470538 transitions. [2019-12-26 22:23:54,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:23:54,342 INFO L276 IsEmpty]: Start isEmpty. Operand 109842 states and 470538 transitions. [2019-12-26 22:23:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:23:54,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:23:54,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:23:54,347 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-26 22:23:54,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:23:54,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1326055600, now seen corresponding path program 1 times [2019-12-26 22:23:54,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:23:54,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890656688] [2019-12-26 22:23:54,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:23:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:23:54,495 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-26 22:23:54,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890656688] [2019-12-26 22:23:54,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:23:54,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:23:54,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294513041] [2019-12-26 22:23:54,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:23:54,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:23:54,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:23:54,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:23:54,499 INFO L87 Difference]: Start difference. First operand 109842 states and 470538 transitions. Second operand 4 states. [2019-12-26 22:23:59,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:23:59,867 INFO L93 Difference]: Finished difference Result 170700 states and 702967 transitions. [2019-12-26 22:23:59,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:23:59,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:23:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:00,538 INFO L225 Difference]: With dead ends: 170700 [2019-12-26 22:24:00,539 INFO L226 Difference]: Without dead ends: 170651 [2019-12-26 22:24:00,540 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-26 22:24:06,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170651 states. [2019-12-26 22:24:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170651 to 155174. [2019-12-26 22:24:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155174 states. [2019-12-26 22:24:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155174 states to 155174 states and 647977 transitions. [2019-12-26 22:24:14,709 INFO L78 Accepts]: Start accepts. Automaton has 155174 states and 647977 transitions. Word has length 11 [2019-12-26 22:24:14,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:14,709 INFO L462 AbstractCegarLoop]: Abstraction has 155174 states and 647977 transitions. [2019-12-26 22:24:14,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:24:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 155174 states and 647977 transitions. [2019-12-26 22:24:14,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:24:14,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:14,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:14,717 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-26 22:24:14,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:14,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1447855061, now seen corresponding path program 1 times [2019-12-26 22:24:14,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:14,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921753178] [2019-12-26 22:24:14,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:14,808 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-26 22:24:14,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921753178] [2019-12-26 22:24:14,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:14,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:24:14,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061288867] [2019-12-26 22:24:14,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:14,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:14,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:14,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:14,811 INFO L87 Difference]: Start difference. First operand 155174 states and 647977 transitions. Second operand 3 states. [2019-12-26 22:24:14,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:14,956 INFO L93 Difference]: Finished difference Result 33806 states and 110729 transitions. [2019-12-26 22:24:14,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:14,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:24:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:15,035 INFO L225 Difference]: With dead ends: 33806 [2019-12-26 22:24:15,035 INFO L226 Difference]: Without dead ends: 33806 [2019-12-26 22:24:15,036 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-26 22:24:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33806 states. [2019-12-26 22:24:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33806 to 33806. [2019-12-26 22:24:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33806 states. [2019-12-26 22:24:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33806 states to 33806 states and 110729 transitions. [2019-12-26 22:24:15,695 INFO L78 Accepts]: Start accepts. Automaton has 33806 states and 110729 transitions. Word has length 13 [2019-12-26 22:24:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:15,696 INFO L462 AbstractCegarLoop]: Abstraction has 33806 states and 110729 transitions. [2019-12-26 22:24:15,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:24:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 33806 states and 110729 transitions. [2019-12-26 22:24:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:24:15,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:15,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:15,699 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-26 22:24:15,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash 627665056, now seen corresponding path program 1 times [2019-12-26 22:24:15,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:15,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313218221] [2019-12-26 22:24:15,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:15,750 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-26 22:24:15,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313218221] [2019-12-26 22:24:15,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:15,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:24:15,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184970999] [2019-12-26 22:24:15,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:15,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:15,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:15,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:15,752 INFO L87 Difference]: Start difference. First operand 33806 states and 110729 transitions. Second operand 3 states. [2019-12-26 22:24:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:15,964 INFO L93 Difference]: Finished difference Result 52205 states and 169891 transitions. [2019-12-26 22:24:15,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:15,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 22:24:15,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:16,057 INFO L225 Difference]: With dead ends: 52205 [2019-12-26 22:24:16,057 INFO L226 Difference]: Without dead ends: 52205 [2019-12-26 22:24:16,057 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-26 22:24:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52205 states. [2019-12-26 22:24:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52205 to 38718. [2019-12-26 22:24:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38718 states. [2019-12-26 22:24:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38718 states to 38718 states and 127749 transitions. [2019-12-26 22:24:19,719 INFO L78 Accepts]: Start accepts. Automaton has 38718 states and 127749 transitions. Word has length 16 [2019-12-26 22:24:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:19,720 INFO L462 AbstractCegarLoop]: Abstraction has 38718 states and 127749 transitions. [2019-12-26 22:24:19,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:24:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 38718 states and 127749 transitions. [2019-12-26 22:24:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:24:19,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:19,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:19,724 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-26 22:24:19,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:19,725 INFO L82 PathProgramCache]: Analyzing trace with hash 712450242, now seen corresponding path program 1 times [2019-12-26 22:24:19,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:19,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054193280] [2019-12-26 22:24:19,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:19,805 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-26 22:24:19,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054193280] [2019-12-26 22:24:19,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:19,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:24:19,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829068275] [2019-12-26 22:24:19,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:24:19,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:19,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:24:19,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:24:19,807 INFO L87 Difference]: Start difference. First operand 38718 states and 127749 transitions. Second operand 4 states. [2019-12-26 22:24:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:20,197 INFO L93 Difference]: Finished difference Result 46485 states and 150983 transitions. [2019-12-26 22:24:20,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:24:20,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:24:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:20,274 INFO L225 Difference]: With dead ends: 46485 [2019-12-26 22:24:20,274 INFO L226 Difference]: Without dead ends: 46485 [2019-12-26 22:24:20,274 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-26 22:24:20,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46485 states. [2019-12-26 22:24:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46485 to 42622. [2019-12-26 22:24:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42622 states. [2019-12-26 22:24:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42622 states to 42622 states and 139503 transitions. [2019-12-26 22:24:21,035 INFO L78 Accepts]: Start accepts. Automaton has 42622 states and 139503 transitions. Word has length 16 [2019-12-26 22:24:21,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:21,035 INFO L462 AbstractCegarLoop]: Abstraction has 42622 states and 139503 transitions. [2019-12-26 22:24:21,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:24:21,035 INFO L276 IsEmpty]: Start isEmpty. Operand 42622 states and 139503 transitions. [2019-12-26 22:24:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:24:21,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:21,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:21,039 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-26 22:24:21,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:21,040 INFO L82 PathProgramCache]: Analyzing trace with hash 646000998, now seen corresponding path program 1 times [2019-12-26 22:24:21,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:21,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315606574] [2019-12-26 22:24:21,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:21,111 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-26 22:24:21,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315606574] [2019-12-26 22:24:21,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:21,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:24:21,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292097549] [2019-12-26 22:24:21,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:24:21,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:21,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:24:21,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:24:21,113 INFO L87 Difference]: Start difference. First operand 42622 states and 139503 transitions. Second operand 4 states. [2019-12-26 22:24:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:21,510 INFO L93 Difference]: Finished difference Result 51005 states and 165609 transitions. [2019-12-26 22:24:21,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:24:21,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:24:21,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:21,598 INFO L225 Difference]: With dead ends: 51005 [2019-12-26 22:24:21,598 INFO L226 Difference]: Without dead ends: 51005 [2019-12-26 22:24:21,598 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-26 22:24:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51005 states. [2019-12-26 22:24:22,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51005 to 44274. [2019-12-26 22:24:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44274 states. [2019-12-26 22:24:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44274 states to 44274 states and 144974 transitions. [2019-12-26 22:24:22,929 INFO L78 Accepts]: Start accepts. Automaton has 44274 states and 144974 transitions. Word has length 16 [2019-12-26 22:24:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:22,930 INFO L462 AbstractCegarLoop]: Abstraction has 44274 states and 144974 transitions. [2019-12-26 22:24:22,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:24:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 44274 states and 144974 transitions. [2019-12-26 22:24:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:24:22,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:22,940 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-26 22:24:22,941 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-26 22:24:22,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:22,941 INFO L82 PathProgramCache]: Analyzing trace with hash -2051800974, now seen corresponding path program 1 times [2019-12-26 22:24:22,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:22,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110513224] [2019-12-26 22:24:22,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:23,030 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-26 22:24:23,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110513224] [2019-12-26 22:24:23,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:23,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:24:23,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859244735] [2019-12-26 22:24:23,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:24:23,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:23,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:24:23,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:24:23,034 INFO L87 Difference]: Start difference. First operand 44274 states and 144974 transitions. Second operand 5 states. [2019-12-26 22:24:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:23,700 INFO L93 Difference]: Finished difference Result 60565 states and 193473 transitions. [2019-12-26 22:24:23,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:24:23,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:24:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:23,803 INFO L225 Difference]: With dead ends: 60565 [2019-12-26 22:24:23,803 INFO L226 Difference]: Without dead ends: 60558 [2019-12-26 22:24:23,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:24:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60558 states. [2019-12-26 22:24:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60558 to 45614. [2019-12-26 22:24:24,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45614 states. [2019-12-26 22:24:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45614 states to 45614 states and 149067 transitions. [2019-12-26 22:24:24,687 INFO L78 Accepts]: Start accepts. Automaton has 45614 states and 149067 transitions. Word has length 22 [2019-12-26 22:24:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:24,688 INFO L462 AbstractCegarLoop]: Abstraction has 45614 states and 149067 transitions. [2019-12-26 22:24:24,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:24:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 45614 states and 149067 transitions. [2019-12-26 22:24:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:24:24,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:24,698 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-26 22:24:24,698 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-26 22:24:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2118250218, now seen corresponding path program 1 times [2019-12-26 22:24:24,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:24,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140356332] [2019-12-26 22:24:24,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:24,780 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-26 22:24:24,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140356332] [2019-12-26 22:24:24,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:24,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:24:24,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729872693] [2019-12-26 22:24:24,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:24:24,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:24,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:24:24,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:24:24,783 INFO L87 Difference]: Start difference. First operand 45614 states and 149067 transitions. Second operand 5 states. [2019-12-26 22:24:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:25,446 INFO L93 Difference]: Finished difference Result 63360 states and 201880 transitions. [2019-12-26 22:24:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:24:25,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:24:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:25,559 INFO L225 Difference]: With dead ends: 63360 [2019-12-26 22:24:25,559 INFO L226 Difference]: Without dead ends: 63353 [2019-12-26 22:24:25,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:24:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63353 states. [2019-12-26 22:24:26,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63353 to 43925. [2019-12-26 22:24:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43925 states. [2019-12-26 22:24:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43925 states to 43925 states and 143672 transitions. [2019-12-26 22:24:26,808 INFO L78 Accepts]: Start accepts. Automaton has 43925 states and 143672 transitions. Word has length 22 [2019-12-26 22:24:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:26,809 INFO L462 AbstractCegarLoop]: Abstraction has 43925 states and 143672 transitions. [2019-12-26 22:24:26,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:24:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 43925 states and 143672 transitions. [2019-12-26 22:24:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:24:26,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:26,821 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-26 22:24:26,821 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-26 22:24:26,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:26,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1701171988, now seen corresponding path program 1 times [2019-12-26 22:24:26,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:26,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470921702] [2019-12-26 22:24:26,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:26,867 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-26 22:24:26,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470921702] [2019-12-26 22:24:26,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:26,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:24:26,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505292113] [2019-12-26 22:24:26,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:24:26,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:26,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:24:26,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:24:26,870 INFO L87 Difference]: Start difference. First operand 43925 states and 143672 transitions. Second operand 4 states. [2019-12-26 22:24:26,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:26,965 INFO L93 Difference]: Finished difference Result 18121 states and 56197 transitions. [2019-12-26 22:24:26,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:24:26,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:24:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:27,000 INFO L225 Difference]: With dead ends: 18121 [2019-12-26 22:24:27,000 INFO L226 Difference]: Without dead ends: 18121 [2019-12-26 22:24:27,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:24:27,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2019-12-26 22:24:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17758. [2019-12-26 22:24:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-26 22:24:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 55161 transitions. [2019-12-26 22:24:27,268 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 55161 transitions. Word has length 25 [2019-12-26 22:24:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:27,268 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 55161 transitions. [2019-12-26 22:24:27,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:24:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 55161 transitions. [2019-12-26 22:24:27,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:24:27,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:27,282 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-26 22:24:27,283 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-26 22:24:27,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:27,283 INFO L82 PathProgramCache]: Analyzing trace with hash -735951720, now seen corresponding path program 1 times [2019-12-26 22:24:27,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:27,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298516051] [2019-12-26 22:24:27,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:27,325 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-26 22:24:27,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298516051] [2019-12-26 22:24:27,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:27,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:24:27,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064062907] [2019-12-26 22:24:27,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:27,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:27,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:27,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:27,327 INFO L87 Difference]: Start difference. First operand 17758 states and 55161 transitions. Second operand 3 states. [2019-12-26 22:24:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:27,481 INFO L93 Difference]: Finished difference Result 23499 states and 69479 transitions. [2019-12-26 22:24:27,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:27,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 22:24:27,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:27,525 INFO L225 Difference]: With dead ends: 23499 [2019-12-26 22:24:27,525 INFO L226 Difference]: Without dead ends: 23499 [2019-12-26 22:24:27,525 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-26 22:24:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23499 states. [2019-12-26 22:24:27,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23499 to 17758. [2019-12-26 22:24:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-26 22:24:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 52847 transitions. [2019-12-26 22:24:27,889 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 52847 transitions. Word has length 27 [2019-12-26 22:24:27,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:27,890 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 52847 transitions. [2019-12-26 22:24:27,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:24:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 52847 transitions. [2019-12-26 22:24:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:24:27,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:27,902 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-26 22:24:27,902 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-26 22:24:27,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:27,903 INFO L82 PathProgramCache]: Analyzing trace with hash -963527987, now seen corresponding path program 1 times [2019-12-26 22:24:27,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:27,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605502576] [2019-12-26 22:24:27,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:27,979 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-26 22:24:27,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605502576] [2019-12-26 22:24:27,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:27,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:24:27,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026892491] [2019-12-26 22:24:27,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:24:27,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:27,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:24:27,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:24:27,985 INFO L87 Difference]: Start difference. First operand 17758 states and 52847 transitions. Second operand 5 states. [2019-12-26 22:24:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:28,336 INFO L93 Difference]: Finished difference Result 21964 states and 64554 transitions. [2019-12-26 22:24:28,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:24:28,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 22:24:28,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:28,365 INFO L225 Difference]: With dead ends: 21964 [2019-12-26 22:24:28,366 INFO L226 Difference]: Without dead ends: 21964 [2019-12-26 22:24:28,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:24:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21964 states. [2019-12-26 22:24:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21964 to 20594. [2019-12-26 22:24:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20594 states. [2019-12-26 22:24:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20594 states to 20594 states and 61091 transitions. [2019-12-26 22:24:28,669 INFO L78 Accepts]: Start accepts. Automaton has 20594 states and 61091 transitions. Word has length 27 [2019-12-26 22:24:28,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:28,669 INFO L462 AbstractCegarLoop]: Abstraction has 20594 states and 61091 transitions. [2019-12-26 22:24:28,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:24:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 20594 states and 61091 transitions. [2019-12-26 22:24:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:24:28,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:28,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:28,684 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-26 22:24:28,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:28,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1072867226, now seen corresponding path program 1 times [2019-12-26 22:24:28,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:28,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044080144] [2019-12-26 22:24:28,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:28,773 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-26 22:24:28,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044080144] [2019-12-26 22:24:28,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:28,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:24:28,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467110479] [2019-12-26 22:24:28,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:24:28,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:28,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:24:28,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:24:28,775 INFO L87 Difference]: Start difference. First operand 20594 states and 61091 transitions. Second operand 5 states. [2019-12-26 22:24:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:29,121 INFO L93 Difference]: Finished difference Result 24066 states and 70567 transitions. [2019-12-26 22:24:29,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:24:29,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 22:24:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:29,152 INFO L225 Difference]: With dead ends: 24066 [2019-12-26 22:24:29,153 INFO L226 Difference]: Without dead ends: 24066 [2019-12-26 22:24:29,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:24:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24066 states. [2019-12-26 22:24:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24066 to 20500. [2019-12-26 22:24:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20500 states. [2019-12-26 22:24:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20500 states to 20500 states and 60659 transitions. [2019-12-26 22:24:29,593 INFO L78 Accepts]: Start accepts. Automaton has 20500 states and 60659 transitions. Word has length 28 [2019-12-26 22:24:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:29,593 INFO L462 AbstractCegarLoop]: Abstraction has 20500 states and 60659 transitions. [2019-12-26 22:24:29,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:24:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 20500 states and 60659 transitions. [2019-12-26 22:24:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:24:29,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:29,614 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-26 22:24:29,615 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-26 22:24:29,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:29,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1459957021, now seen corresponding path program 1 times [2019-12-26 22:24:29,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:29,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181017804] [2019-12-26 22:24:29,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:29,744 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-26 22:24:29,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181017804] [2019-12-26 22:24:29,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:29,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:24:29,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167319881] [2019-12-26 22:24:29,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:24:29,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:29,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:24:29,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:24:29,748 INFO L87 Difference]: Start difference. First operand 20500 states and 60659 transitions. Second operand 6 states. [2019-12-26 22:24:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:30,474 INFO L93 Difference]: Finished difference Result 27550 states and 80418 transitions. [2019-12-26 22:24:30,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:24:30,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-26 22:24:30,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:30,531 INFO L225 Difference]: With dead ends: 27550 [2019-12-26 22:24:30,531 INFO L226 Difference]: Without dead ends: 27550 [2019-12-26 22:24:30,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:24:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27550 states. [2019-12-26 22:24:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27550 to 21734. [2019-12-26 22:24:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21734 states. [2019-12-26 22:24:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21734 states to 21734 states and 64417 transitions. [2019-12-26 22:24:30,896 INFO L78 Accepts]: Start accepts. Automaton has 21734 states and 64417 transitions. Word has length 33 [2019-12-26 22:24:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:30,896 INFO L462 AbstractCegarLoop]: Abstraction has 21734 states and 64417 transitions. [2019-12-26 22:24:30,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:24:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 21734 states and 64417 transitions. [2019-12-26 22:24:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:24:30,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:30,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:30,916 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-26 22:24:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1108508854, now seen corresponding path program 1 times [2019-12-26 22:24:30,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:30,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439562191] [2019-12-26 22:24:30,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:31,021 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-26 22:24:31,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439562191] [2019-12-26 22:24:31,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:31,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:24:31,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783596267] [2019-12-26 22:24:31,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:24:31,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:31,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:24:31,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:24:31,023 INFO L87 Difference]: Start difference. First operand 21734 states and 64417 transitions. Second operand 6 states. [2019-12-26 22:24:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:31,855 INFO L93 Difference]: Finished difference Result 26719 states and 78128 transitions. [2019-12-26 22:24:31,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:24:31,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-26 22:24:31,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:31,891 INFO L225 Difference]: With dead ends: 26719 [2019-12-26 22:24:31,892 INFO L226 Difference]: Without dead ends: 26719 [2019-12-26 22:24:31,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:24:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26719 states. [2019-12-26 22:24:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26719 to 18663. [2019-12-26 22:24:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18663 states. [2019-12-26 22:24:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18663 states to 18663 states and 55458 transitions. [2019-12-26 22:24:32,215 INFO L78 Accepts]: Start accepts. Automaton has 18663 states and 55458 transitions. Word has length 34 [2019-12-26 22:24:32,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:32,216 INFO L462 AbstractCegarLoop]: Abstraction has 18663 states and 55458 transitions. [2019-12-26 22:24:32,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:24:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 18663 states and 55458 transitions. [2019-12-26 22:24:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:24:32,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:32,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:32,233 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-26 22:24:32,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:32,233 INFO L82 PathProgramCache]: Analyzing trace with hash -282480739, now seen corresponding path program 1 times [2019-12-26 22:24:32,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:32,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995548332] [2019-12-26 22:24:32,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:24:32,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995548332] [2019-12-26 22:24:32,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:32,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:24:32,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116294337] [2019-12-26 22:24:32,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:32,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:32,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:32,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:32,293 INFO L87 Difference]: Start difference. First operand 18663 states and 55458 transitions. Second operand 3 states. [2019-12-26 22:24:32,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:32,389 INFO L93 Difference]: Finished difference Result 18662 states and 55456 transitions. [2019-12-26 22:24:32,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:32,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 22:24:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:32,430 INFO L225 Difference]: With dead ends: 18662 [2019-12-26 22:24:32,430 INFO L226 Difference]: Without dead ends: 18662 [2019-12-26 22:24:32,433 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-26 22:24:32,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18662 states. [2019-12-26 22:24:32,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18662 to 18662. [2019-12-26 22:24:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18662 states. [2019-12-26 22:24:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18662 states to 18662 states and 55456 transitions. [2019-12-26 22:24:32,882 INFO L78 Accepts]: Start accepts. Automaton has 18662 states and 55456 transitions. Word has length 39 [2019-12-26 22:24:32,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:32,882 INFO L462 AbstractCegarLoop]: Abstraction has 18662 states and 55456 transitions. [2019-12-26 22:24:32,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:24:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 18662 states and 55456 transitions. [2019-12-26 22:24:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:24:32,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:32,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:32,908 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-26 22:24:32,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1129418560, now seen corresponding path program 1 times [2019-12-26 22:24:32,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:32,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752216040] [2019-12-26 22:24:32,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:32,995 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-26 22:24:32,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752216040] [2019-12-26 22:24:32,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:32,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:24:32,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253193037] [2019-12-26 22:24:33,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:24:33,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:33,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:24:33,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:24:33,001 INFO L87 Difference]: Start difference. First operand 18662 states and 55456 transitions. Second operand 5 states. [2019-12-26 22:24:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:33,670 INFO L93 Difference]: Finished difference Result 29897 states and 87501 transitions. [2019-12-26 22:24:33,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:24:33,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:24:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:33,711 INFO L225 Difference]: With dead ends: 29897 [2019-12-26 22:24:33,711 INFO L226 Difference]: Without dead ends: 29897 [2019-12-26 22:24:33,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:24:33,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29897 states. [2019-12-26 22:24:34,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29897 to 23727. [2019-12-26 22:24:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23727 states. [2019-12-26 22:24:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23727 states to 23727 states and 70357 transitions. [2019-12-26 22:24:34,210 INFO L78 Accepts]: Start accepts. Automaton has 23727 states and 70357 transitions. Word has length 40 [2019-12-26 22:24:34,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:34,211 INFO L462 AbstractCegarLoop]: Abstraction has 23727 states and 70357 transitions. [2019-12-26 22:24:34,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:24:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 23727 states and 70357 transitions. [2019-12-26 22:24:34,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:24:34,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:34,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:34,241 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-26 22:24:34,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:34,241 INFO L82 PathProgramCache]: Analyzing trace with hash -554035702, now seen corresponding path program 2 times [2019-12-26 22:24:34,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:34,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444020023] [2019-12-26 22:24:34,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:34,317 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-26 22:24:34,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444020023] [2019-12-26 22:24:34,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:34,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:24:34,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232841460] [2019-12-26 22:24:34,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:34,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:34,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:34,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:34,319 INFO L87 Difference]: Start difference. First operand 23727 states and 70357 transitions. Second operand 3 states. [2019-12-26 22:24:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:34,402 INFO L93 Difference]: Finished difference Result 23727 states and 70280 transitions. [2019-12-26 22:24:34,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:34,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 22:24:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:34,433 INFO L225 Difference]: With dead ends: 23727 [2019-12-26 22:24:34,433 INFO L226 Difference]: Without dead ends: 23727 [2019-12-26 22:24:34,434 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-26 22:24:34,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23727 states. [2019-12-26 22:24:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23727 to 19401. [2019-12-26 22:24:34,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19401 states. [2019-12-26 22:24:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19401 states to 19401 states and 58172 transitions. [2019-12-26 22:24:34,747 INFO L78 Accepts]: Start accepts. Automaton has 19401 states and 58172 transitions. Word has length 40 [2019-12-26 22:24:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:34,747 INFO L462 AbstractCegarLoop]: Abstraction has 19401 states and 58172 transitions. [2019-12-26 22:24:34,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:24:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 19401 states and 58172 transitions. [2019-12-26 22:24:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 22:24:34,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:34,770 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] [2019-12-26 22:24:34,771 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-26 22:24:34,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:34,771 INFO L82 PathProgramCache]: Analyzing trace with hash 88308807, now seen corresponding path program 1 times [2019-12-26 22:24:34,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:34,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885196987] [2019-12-26 22:24:34,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:34,831 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-26 22:24:34,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885196987] [2019-12-26 22:24:34,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:34,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:24:34,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105153705] [2019-12-26 22:24:34,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:24:34,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:34,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:24:34,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:24:34,834 INFO L87 Difference]: Start difference. First operand 19401 states and 58172 transitions. Second operand 5 states. [2019-12-26 22:24:34,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:34,930 INFO L93 Difference]: Finished difference Result 18184 states and 55553 transitions. [2019-12-26 22:24:34,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:24:34,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-26 22:24:34,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:34,963 INFO L225 Difference]: With dead ends: 18184 [2019-12-26 22:24:34,963 INFO L226 Difference]: Without dead ends: 18184 [2019-12-26 22:24:34,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:24:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18184 states. [2019-12-26 22:24:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18184 to 18184. [2019-12-26 22:24:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18184 states. [2019-12-26 22:24:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18184 states to 18184 states and 55553 transitions. [2019-12-26 22:24:35,269 INFO L78 Accepts]: Start accepts. Automaton has 18184 states and 55553 transitions. Word has length 41 [2019-12-26 22:24:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:35,269 INFO L462 AbstractCegarLoop]: Abstraction has 18184 states and 55553 transitions. [2019-12-26 22:24:35,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:24:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 18184 states and 55553 transitions. [2019-12-26 22:24:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:24:35,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:35,296 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-26 22:24:35,297 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-26 22:24:35,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:35,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1304450216, now seen corresponding path program 1 times [2019-12-26 22:24:35,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:35,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083305171] [2019-12-26 22:24:35,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:35,376 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-26 22:24:35,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083305171] [2019-12-26 22:24:35,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:35,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:24:35,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815236085] [2019-12-26 22:24:35,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:24:35,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:35,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:24:35,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:24:35,378 INFO L87 Difference]: Start difference. First operand 18184 states and 55553 transitions. Second operand 7 states. [2019-12-26 22:24:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:35,931 INFO L93 Difference]: Finished difference Result 50247 states and 151616 transitions. [2019-12-26 22:24:35,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:24:35,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 22:24:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:35,987 INFO L225 Difference]: With dead ends: 50247 [2019-12-26 22:24:35,987 INFO L226 Difference]: Without dead ends: 37910 [2019-12-26 22:24:35,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:24:36,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37910 states. [2019-12-26 22:24:36,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37910 to 21511. [2019-12-26 22:24:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21511 states. [2019-12-26 22:24:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21511 states to 21511 states and 65394 transitions. [2019-12-26 22:24:36,432 INFO L78 Accepts]: Start accepts. Automaton has 21511 states and 65394 transitions. Word has length 65 [2019-12-26 22:24:36,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:36,432 INFO L462 AbstractCegarLoop]: Abstraction has 21511 states and 65394 transitions. [2019-12-26 22:24:36,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:24:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 21511 states and 65394 transitions. [2019-12-26 22:24:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:24:36,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:36,452 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-26 22:24:36,452 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-26 22:24:36,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:36,452 INFO L82 PathProgramCache]: Analyzing trace with hash 365557572, now seen corresponding path program 2 times [2019-12-26 22:24:36,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:36,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129106320] [2019-12-26 22:24:36,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:36,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-26 22:24:36,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129106320] [2019-12-26 22:24:36,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:36,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:24:36,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132838996] [2019-12-26 22:24:36,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:24:36,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:36,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:24:36,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:24:36,556 INFO L87 Difference]: Start difference. First operand 21511 states and 65394 transitions. Second operand 7 states. [2019-12-26 22:24:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:37,060 INFO L93 Difference]: Finished difference Result 55830 states and 166918 transitions. [2019-12-26 22:24:37,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:24:37,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 22:24:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:37,116 INFO L225 Difference]: With dead ends: 55830 [2019-12-26 22:24:37,116 INFO L226 Difference]: Without dead ends: 40904 [2019-12-26 22:24:37,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:24:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40904 states. [2019-12-26 22:24:37,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40904 to 25412. [2019-12-26 22:24:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25412 states. [2019-12-26 22:24:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25412 states to 25412 states and 76768 transitions. [2019-12-26 22:24:37,793 INFO L78 Accepts]: Start accepts. Automaton has 25412 states and 76768 transitions. Word has length 65 [2019-12-26 22:24:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:37,793 INFO L462 AbstractCegarLoop]: Abstraction has 25412 states and 76768 transitions. [2019-12-26 22:24:37,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:24:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 25412 states and 76768 transitions. [2019-12-26 22:24:37,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:24:37,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:37,822 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-26 22:24:37,822 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-26 22:24:37,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:37,822 INFO L82 PathProgramCache]: Analyzing trace with hash -145794860, now seen corresponding path program 3 times [2019-12-26 22:24:37,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:37,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465084223] [2019-12-26 22:24:37,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:37,897 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-26 22:24:37,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465084223] [2019-12-26 22:24:37,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:37,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:24:37,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123434258] [2019-12-26 22:24:37,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:24:37,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:37,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:24:37,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:24:37,899 INFO L87 Difference]: Start difference. First operand 25412 states and 76768 transitions. Second operand 7 states. [2019-12-26 22:24:38,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:38,368 INFO L93 Difference]: Finished difference Result 48947 states and 145828 transitions. [2019-12-26 22:24:38,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 22:24:38,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 22:24:38,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:38,456 INFO L225 Difference]: With dead ends: 48947 [2019-12-26 22:24:38,456 INFO L226 Difference]: Without dead ends: 45034 [2019-12-26 22:24:38,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:24:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45034 states. [2019-12-26 22:24:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45034 to 25538. [2019-12-26 22:24:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25538 states. [2019-12-26 22:24:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25538 states to 25538 states and 77209 transitions. [2019-12-26 22:24:39,028 INFO L78 Accepts]: Start accepts. Automaton has 25538 states and 77209 transitions. Word has length 65 [2019-12-26 22:24:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:39,028 INFO L462 AbstractCegarLoop]: Abstraction has 25538 states and 77209 transitions. [2019-12-26 22:24:39,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:24:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 25538 states and 77209 transitions. [2019-12-26 22:24:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:24:39,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:39,062 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-26 22:24:39,063 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-26 22:24:39,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:39,063 INFO L82 PathProgramCache]: Analyzing trace with hash -156874998, now seen corresponding path program 4 times [2019-12-26 22:24:39,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:39,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918528815] [2019-12-26 22:24:39,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:39,111 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-26 22:24:39,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918528815] [2019-12-26 22:24:39,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:39,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:24:39,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309543701] [2019-12-26 22:24:39,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:39,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:39,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:39,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:39,113 INFO L87 Difference]: Start difference. First operand 25538 states and 77209 transitions. Second operand 3 states. [2019-12-26 22:24:39,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:39,274 INFO L93 Difference]: Finished difference Result 29013 states and 87993 transitions. [2019-12-26 22:24:39,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:39,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:24:39,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:39,339 INFO L225 Difference]: With dead ends: 29013 [2019-12-26 22:24:39,339 INFO L226 Difference]: Without dead ends: 29013 [2019-12-26 22:24:39,346 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-26 22:24:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29013 states. [2019-12-26 22:24:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29013 to 23876. [2019-12-26 22:24:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23876 states. [2019-12-26 22:24:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23876 states to 23876 states and 73099 transitions. [2019-12-26 22:24:40,128 INFO L78 Accepts]: Start accepts. Automaton has 23876 states and 73099 transitions. Word has length 65 [2019-12-26 22:24:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:40,129 INFO L462 AbstractCegarLoop]: Abstraction has 23876 states and 73099 transitions. [2019-12-26 22:24:40,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:24:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 23876 states and 73099 transitions. [2019-12-26 22:24:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:24:40,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:40,170 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-26 22:24:40,170 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-26 22:24:40,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:40,171 INFO L82 PathProgramCache]: Analyzing trace with hash -777729737, now seen corresponding path program 1 times [2019-12-26 22:24:40,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:40,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145442733] [2019-12-26 22:24:40,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:40,264 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-26 22:24:40,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145442733] [2019-12-26 22:24:40,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:40,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:24:40,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212207803] [2019-12-26 22:24:40,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:24:40,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:40,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:24:40,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:24:40,269 INFO L87 Difference]: Start difference. First operand 23876 states and 73099 transitions. Second operand 7 states. [2019-12-26 22:24:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:40,762 INFO L93 Difference]: Finished difference Result 50319 states and 152416 transitions. [2019-12-26 22:24:40,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 22:24:40,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-26 22:24:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:40,829 INFO L225 Difference]: With dead ends: 50319 [2019-12-26 22:24:40,829 INFO L226 Difference]: Without dead ends: 45490 [2019-12-26 22:24:40,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:24:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45490 states. [2019-12-26 22:24:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45490 to 24050. [2019-12-26 22:24:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24050 states. [2019-12-26 22:24:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24050 states to 24050 states and 73751 transitions. [2019-12-26 22:24:41,508 INFO L78 Accepts]: Start accepts. Automaton has 24050 states and 73751 transitions. Word has length 66 [2019-12-26 22:24:41,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:41,508 INFO L462 AbstractCegarLoop]: Abstraction has 24050 states and 73751 transitions. [2019-12-26 22:24:41,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:24:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 24050 states and 73751 transitions. [2019-12-26 22:24:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:24:41,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:41,532 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-26 22:24:41,532 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-26 22:24:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2128783339, now seen corresponding path program 2 times [2019-12-26 22:24:41,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:41,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173802416] [2019-12-26 22:24:41,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:41,610 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-26 22:24:41,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173802416] [2019-12-26 22:24:41,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:41,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:24:41,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650356458] [2019-12-26 22:24:41,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:24:41,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:41,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:24:41,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:24:41,614 INFO L87 Difference]: Start difference. First operand 24050 states and 73751 transitions. Second operand 4 states. [2019-12-26 22:24:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:41,746 INFO L93 Difference]: Finished difference Result 23832 states and 72874 transitions. [2019-12-26 22:24:41,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:24:41,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 22:24:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:41,778 INFO L225 Difference]: With dead ends: 23832 [2019-12-26 22:24:41,778 INFO L226 Difference]: Without dead ends: 23832 [2019-12-26 22:24:41,778 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-26 22:24:41,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23832 states. [2019-12-26 22:24:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23832 to 21655. [2019-12-26 22:24:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21655 states. [2019-12-26 22:24:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21655 states to 21655 states and 66392 transitions. [2019-12-26 22:24:42,137 INFO L78 Accepts]: Start accepts. Automaton has 21655 states and 66392 transitions. Word has length 66 [2019-12-26 22:24:42,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:42,137 INFO L462 AbstractCegarLoop]: Abstraction has 21655 states and 66392 transitions. [2019-12-26 22:24:42,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:24:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 21655 states and 66392 transitions. [2019-12-26 22:24:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:24:42,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:42,158 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-26 22:24:42,158 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-26 22:24:42,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:42,158 INFO L82 PathProgramCache]: Analyzing trace with hash 771503262, now seen corresponding path program 1 times [2019-12-26 22:24:42,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:42,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491192952] [2019-12-26 22:24:42,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:42,216 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-26 22:24:42,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491192952] [2019-12-26 22:24:42,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:42,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:24:42,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576992170] [2019-12-26 22:24:42,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:42,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:42,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:42,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:42,218 INFO L87 Difference]: Start difference. First operand 21655 states and 66392 transitions. Second operand 3 states. [2019-12-26 22:24:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:42,291 INFO L93 Difference]: Finished difference Result 15945 states and 48065 transitions. [2019-12-26 22:24:42,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:42,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 22:24:42,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:42,318 INFO L225 Difference]: With dead ends: 15945 [2019-12-26 22:24:42,318 INFO L226 Difference]: Without dead ends: 15945 [2019-12-26 22:24:42,318 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-26 22:24:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15945 states. [2019-12-26 22:24:42,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15945 to 14321. [2019-12-26 22:24:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14321 states. [2019-12-26 22:24:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14321 states to 14321 states and 43147 transitions. [2019-12-26 22:24:42,545 INFO L78 Accepts]: Start accepts. Automaton has 14321 states and 43147 transitions. Word has length 66 [2019-12-26 22:24:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:42,546 INFO L462 AbstractCegarLoop]: Abstraction has 14321 states and 43147 transitions. [2019-12-26 22:24:42,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:24:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 14321 states and 43147 transitions. [2019-12-26 22:24:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:24:42,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:42,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:42,560 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-26 22:24:42,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:42,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1509100091, now seen corresponding path program 1 times [2019-12-26 22:24:42,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:42,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633331707] [2019-12-26 22:24:42,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:24:42,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633331707] [2019-12-26 22:24:42,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:42,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:24:42,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679135044] [2019-12-26 22:24:42,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:24:42,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:42,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:24:42,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:24:42,714 INFO L87 Difference]: Start difference. First operand 14321 states and 43147 transitions. Second operand 11 states. [2019-12-26 22:24:43,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:43,949 INFO L93 Difference]: Finished difference Result 32485 states and 96620 transitions. [2019-12-26 22:24:43,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-26 22:24:43,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 22:24:43,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:44,002 INFO L225 Difference]: With dead ends: 32485 [2019-12-26 22:24:44,002 INFO L226 Difference]: Without dead ends: 24944 [2019-12-26 22:24:44,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 22:24:44,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24944 states. [2019-12-26 22:24:44,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24944 to 13865. [2019-12-26 22:24:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13865 states. [2019-12-26 22:24:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13865 states to 13865 states and 41455 transitions. [2019-12-26 22:24:44,495 INFO L78 Accepts]: Start accepts. Automaton has 13865 states and 41455 transitions. Word has length 67 [2019-12-26 22:24:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:44,495 INFO L462 AbstractCegarLoop]: Abstraction has 13865 states and 41455 transitions. [2019-12-26 22:24:44,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:24:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 13865 states and 41455 transitions. [2019-12-26 22:24:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:24:44,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:44,509 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-26 22:24:44,509 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-26 22:24:44,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:44,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1209104993, now seen corresponding path program 2 times [2019-12-26 22:24:44,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:44,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251187035] [2019-12-26 22:24:44,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:24:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:24:44,626 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:24:44,627 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:24:44,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t931~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t931~0.base_30|) |v_ULTIMATE.start_main_~#t931~0.offset_22| 0)) |v_#memory_int_19|) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t931~0.base_30|) (= 0 v_~a$w_buff1_used~0_450) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t931~0.base_30| 1)) (= 0 |v_ULTIMATE.start_main_~#t931~0.offset_22|) (= 0 v_~__unbuffered_p0_EAX~0_159) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t931~0.base_30| 4)) (= v_~a$mem_tmp~0_16 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t931~0.base_30|) 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= 0 v_~x~0_153) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ULTIMATE.start_main_~#t932~0.base=|v_ULTIMATE.start_main_~#t932~0.base_23|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ULTIMATE.start_main_~#t931~0.offset=|v_ULTIMATE.start_main_~#t931~0.offset_22|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ULTIMATE.start_main_~#t931~0.base=|v_ULTIMATE.start_main_~#t931~0.base_30|, ~x~0=v_~x~0_153, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ULTIMATE.start_main_~#t933~0.base=|v_ULTIMATE.start_main_~#t933~0.base_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ULTIMATE.start_main_~#t932~0.offset=|v_ULTIMATE.start_main_~#t932~0.offset_17|, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ULTIMATE.start_main_~#t933~0.offset=|v_ULTIMATE.start_main_~#t933~0.offset_13|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t932~0.base, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t931~0.offset, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t931~0.base, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ULTIMATE.start_main_~#t933~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t932~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t933~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-26 22:24:44,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (= ~a$r_buff0_thd3~0_In-1748894179 ~a$r_buff1_thd3~0_Out-1748894179) (= ~a$r_buff1_thd1~0_Out-1748894179 ~a$r_buff0_thd1~0_In-1748894179) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1748894179 0)) (= ~a$r_buff0_thd1~0_Out-1748894179 1) (= ~a$r_buff0_thd0~0_In-1748894179 ~a$r_buff1_thd0~0_Out-1748894179) (= ~a$r_buff1_thd2~0_Out-1748894179 ~a$r_buff0_thd2~0_In-1748894179) (= ~__unbuffered_p0_EAX~0_Out-1748894179 ~x~0_In-1748894179)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1748894179, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1748894179, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1748894179, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1748894179, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1748894179, ~x~0=~x~0_In-1748894179} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1748894179, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1748894179, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1748894179, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1748894179, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1748894179, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1748894179, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1748894179, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1748894179, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1748894179, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1748894179, ~x~0=~x~0_In-1748894179} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:24:44,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t932~0.base_11|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t932~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t932~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t932~0.base_11|) |v_ULTIMATE.start_main_~#t932~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t932~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t932~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t932~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t932~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t932~0.base=|v_ULTIMATE.start_main_~#t932~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t932~0.offset=|v_ULTIMATE.start_main_~#t932~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t932~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t932~0.offset, #length] because there is no mapped edge [2019-12-26 22:24:44,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t933~0.base_11| 4) |v_#length_15|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t933~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t933~0.base_11|) |v_ULTIMATE.start_main_~#t933~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t933~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t933~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t933~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t933~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t933~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t933~0.base=|v_ULTIMATE.start_main_~#t933~0.base_11|, ULTIMATE.start_main_~#t933~0.offset=|v_ULTIMATE.start_main_~#t933~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t933~0.base, ULTIMATE.start_main_~#t933~0.offset, #length] because there is no mapped edge [2019-12-26 22:24:44,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In411079199 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In411079199 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out411079199| ~a$w_buff1~0_In411079199) (not .cse1)) (and (or .cse0 .cse1) (= ~a~0_In411079199 |P1Thread1of1ForFork2_#t~ite9_Out411079199|)))) InVars {~a~0=~a~0_In411079199, ~a$w_buff1~0=~a$w_buff1~0_In411079199, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In411079199, ~a$w_buff1_used~0=~a$w_buff1_used~0_In411079199} OutVars{~a~0=~a~0_In411079199, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out411079199|, ~a$w_buff1~0=~a$w_buff1~0_In411079199, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In411079199, ~a$w_buff1_used~0=~a$w_buff1_used~0_In411079199} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 22:24:44,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_30| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_30|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_29|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_43|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 22:24:44,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-1013211954 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1013211954 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1013211954| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1013211954| ~a$w_buff0_used~0_In-1013211954)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1013211954, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1013211954} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1013211954, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1013211954, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1013211954|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 22:24:44,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-1641752390 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-1641752390 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1641752390 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-1641752390 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1641752390| ~a$w_buff1_used~0_In-1641752390) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1641752390|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1641752390, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1641752390, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1641752390, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1641752390} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1641752390, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1641752390, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1641752390, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1641752390|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1641752390} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 22:24:44,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1210259548 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1210259548 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1210259548|) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In-1210259548 |P1Thread1of1ForFork2_#t~ite13_Out-1210259548|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1210259548, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1210259548} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1210259548, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1210259548, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1210259548|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 22:24:44,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd2~0_In-23100575 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-23100575 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-23100575 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-23100575 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-23100575| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-23100575| ~a$r_buff1_thd2~0_In-23100575) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-23100575, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-23100575, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-23100575, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-23100575} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-23100575, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-23100575, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-23100575, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-23100575, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-23100575|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 22:24:44,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 22:24:44,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In2140222563 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In2140222563 256)))) (or (and (= ~a$w_buff0_used~0_In2140222563 |P0Thread1of1ForFork1_#t~ite5_Out2140222563|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out2140222563|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2140222563, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2140222563} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out2140222563|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2140222563, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2140222563} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 22:24:44,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1194579931 256))) (.cse1 (= (mod ~a$r_buff1_thd1~0_In-1194579931 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1194579931 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-1194579931 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-1194579931| ~a$w_buff1_used~0_In-1194579931) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1194579931| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1194579931, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1194579931, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1194579931, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1194579931} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1194579931|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1194579931, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1194579931, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1194579931, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1194579931} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 22:24:44,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In604872486 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In604872486 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out604872486)) (and (= ~a$r_buff0_thd1~0_Out604872486 ~a$r_buff0_thd1~0_In604872486) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In604872486, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In604872486} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out604872486|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In604872486, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out604872486} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:24:44,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd1~0_In-272617107 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-272617107 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-272617107 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-272617107 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-272617107| 0)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-272617107| ~a$r_buff1_thd1~0_In-272617107) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-272617107, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-272617107, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-272617107, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-272617107} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-272617107|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-272617107, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-272617107, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-272617107, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-272617107} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 22:24:44,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_37|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 22:24:44,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1754692131 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1754692131 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-1754692131 256)) (and .cse0 (= (mod ~a$w_buff1_used~0_In-1754692131 256) 0)) (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-1754692131 256))))) .cse1 (= ~a$w_buff1_used~0_In-1754692131 |P2Thread1of1ForFork0_#t~ite29_Out-1754692131|) (= |P2Thread1of1ForFork0_#t~ite29_Out-1754692131| |P2Thread1of1ForFork0_#t~ite30_Out-1754692131|)) (and (= |P2Thread1of1ForFork0_#t~ite29_In-1754692131| |P2Thread1of1ForFork0_#t~ite29_Out-1754692131|) (not .cse1) (= ~a$w_buff1_used~0_In-1754692131 |P2Thread1of1ForFork0_#t~ite30_Out-1754692131|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1754692131, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1754692131, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1754692131, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1754692131, ~weak$$choice2~0=~weak$$choice2~0_In-1754692131, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1754692131|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1754692131, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1754692131, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1754692131, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1754692131, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1754692131|, ~weak$$choice2~0=~weak$$choice2~0_In-1754692131, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1754692131|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 22:24:44,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 22:24:44,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-26 22:24:44,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-815238874 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-815238874 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-815238874| ~a~0_In-815238874)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-815238874| ~a$w_buff1~0_In-815238874) (not .cse1)))) InVars {~a~0=~a~0_In-815238874, ~a$w_buff1~0=~a$w_buff1~0_In-815238874, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-815238874, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-815238874} OutVars{~a~0=~a~0_In-815238874, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-815238874|, ~a$w_buff1~0=~a$w_buff1~0_In-815238874, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-815238874, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-815238874} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 22:24:44,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 22:24:44,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1075898824 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1075898824 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1075898824|)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1075898824 |P2Thread1of1ForFork0_#t~ite40_Out1075898824|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1075898824, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1075898824} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1075898824|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1075898824, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1075898824} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 22:24:44,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In1934147036 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In1934147036 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1934147036 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1934147036 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1934147036|)) (and (= ~a$w_buff1_used~0_In1934147036 |P2Thread1of1ForFork0_#t~ite41_Out1934147036|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1934147036, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1934147036, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1934147036, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1934147036} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1934147036, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1934147036, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1934147036, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1934147036, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1934147036|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 22:24:44,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-892017656 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-892017656 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-892017656|)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-892017656| ~a$r_buff0_thd3~0_In-892017656) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-892017656, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-892017656} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-892017656, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-892017656, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-892017656|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 22:24:44,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-2055285420 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-2055285420 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-2055285420 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2055285420 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out-2055285420| ~a$r_buff1_thd3~0_In-2055285420)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite43_Out-2055285420| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2055285420, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2055285420, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2055285420, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2055285420} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-2055285420|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2055285420, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2055285420, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2055285420, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2055285420} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 22:24:44,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 22:24:44,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:24:44,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out860023093| |ULTIMATE.start_main_#t~ite47_Out860023093|)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In860023093 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In860023093 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out860023093| ~a$w_buff1~0_In860023093) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~a~0_In860023093 |ULTIMATE.start_main_#t~ite47_Out860023093|)))) InVars {~a~0=~a~0_In860023093, ~a$w_buff1~0=~a$w_buff1~0_In860023093, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In860023093, ~a$w_buff1_used~0=~a$w_buff1_used~0_In860023093} OutVars{~a~0=~a~0_In860023093, ~a$w_buff1~0=~a$w_buff1~0_In860023093, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out860023093|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In860023093, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out860023093|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In860023093} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 22:24:44,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1884851305 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1884851305 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1884851305| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out1884851305| ~a$w_buff0_used~0_In1884851305) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1884851305, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1884851305} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1884851305, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1884851305|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1884851305} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 22:24:44,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-938086588 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-938086588 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-938086588 256))) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-938086588 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-938086588| 0)) (and (= ~a$w_buff1_used~0_In-938086588 |ULTIMATE.start_main_#t~ite50_Out-938086588|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-938086588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-938086588, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-938086588, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-938086588} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-938086588|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-938086588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-938086588, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-938086588, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-938086588} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 22:24:44,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1172733633 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1172733633 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1172733633| 0) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In1172733633 |ULTIMATE.start_main_#t~ite51_Out1172733633|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1172733633, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1172733633} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1172733633|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1172733633, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1172733633} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:24:44,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd0~0_In-820506560 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-820506560 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-820506560 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-820506560 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-820506560| ~a$r_buff1_thd0~0_In-820506560) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-820506560| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-820506560, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-820506560, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-820506560, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-820506560} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-820506560|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-820506560, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-820506560, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-820506560, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-820506560} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 22:24:44,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~main$tmp_guard1~0_17 0) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= 0 v_~__unbuffered_p0_EAX~0_128)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:24:44,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:24:44 BasicIcfg [2019-12-26 22:24:44,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:24:44,777 INFO L168 Benchmark]: Toolchain (without parser) took 91570.96 ms. Allocated memory was 136.8 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 100.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-26 22:24:44,778 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 22:24:44,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.08 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 99.6 MB in the beginning and 154.8 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:24:44,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.62 ms. Allocated memory is still 201.3 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:24:44,779 INFO L168 Benchmark]: Boogie Preprocessor took 49.89 ms. Allocated memory is still 201.3 MB. Free memory was 152.1 MB in the beginning and 149.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:24:44,780 INFO L168 Benchmark]: RCFGBuilder took 923.92 ms. Allocated memory is still 201.3 MB. Free memory was 149.3 MB in the beginning and 98.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-26 22:24:44,780 INFO L168 Benchmark]: TraceAbstraction took 89769.81 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 98.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-26 22:24:44,784 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.18 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.08 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 99.6 MB in the beginning and 154.8 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.62 ms. Allocated memory is still 201.3 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.89 ms. Allocated memory is still 201.3 MB. Free memory was 152.1 MB in the beginning and 149.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 923.92 ms. Allocated memory is still 201.3 MB. Free memory was 149.3 MB in the beginning and 98.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89769.81 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 98.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 31 ChoiceCompositions, 7408 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 283 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 83880 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t931, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t932, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t933, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 89.4s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5671 SDtfs, 5277 SDslu, 14782 SDs, 0 SdLazy, 5250 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 37 SyntacticMatches, 18 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155174occurred 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: 40.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 202182 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1045 NumberOfCodeBlocks, 1045 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 952 ConstructedInterpolants, 0 QuantifiedInterpolants, 153592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...