/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/mix006_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:18:24,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:18:24,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:18:24,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:18:24,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:18:24,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:18:24,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:18:24,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:18:24,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:18:24,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:18:24,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:18:24,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:18:24,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:18:24,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:18:24,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:18:24,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:18:24,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:18:24,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:18:24,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:18:24,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:18:24,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:18:24,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:18:24,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:18:24,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:18:24,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:18:24,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:18:24,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:18:24,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:18:24,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:18:24,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:18:24,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:18:24,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:18:24,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:18:24,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:18:24,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:18:24,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:18:24,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:18:24,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:18:24,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:18:24,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:18:24,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:18:24,989 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 21:18:25,005 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:18:25,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:18:25,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:18:25,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:18:25,007 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:18:25,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:18:25,007 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:18:25,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:18:25,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:18:25,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:18:25,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:18:25,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:18:25,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:18:25,009 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:18:25,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:18:25,009 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:18:25,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:18:25,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:18:25,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:18:25,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:18:25,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:18:25,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:18:25,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:18:25,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:18:25,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:18:25,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:18:25,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:18:25,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:18:25,011 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:18:25,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:18:25,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:18:25,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:18:25,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:18:25,330 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:18:25,331 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:18:25,331 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_rmo.oepc.i [2019-12-26 21:18:25,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f723845ae/d39063720827463bbe1d66fdd7c77438/FLAGfc90f7074 [2019-12-26 21:18:26,018 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:18:26,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_rmo.oepc.i [2019-12-26 21:18:26,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f723845ae/d39063720827463bbe1d66fdd7c77438/FLAGfc90f7074 [2019-12-26 21:18:26,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f723845ae/d39063720827463bbe1d66fdd7c77438 [2019-12-26 21:18:26,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:18:26,253 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:18:26,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:18:26,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:18:26,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:18:26,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:18:26" (1/1) ... [2019-12-26 21:18:26,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@346c3085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:26, skipping insertion in model container [2019-12-26 21:18:26,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:18:26" (1/1) ... [2019-12-26 21:18:26,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:18:26,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:18:26,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:18:26,861 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:18:26,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:18:27,004 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:18:27,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:27 WrapperNode [2019-12-26 21:18:27,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:18:27,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:18:27,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:18:27,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:18:27,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:27" (1/1) ... [2019-12-26 21:18:27,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:27" (1/1) ... [2019-12-26 21:18:27,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:18:27,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:18:27,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:18:27,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:18:27,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:27" (1/1) ... [2019-12-26 21:18:27,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:27" (1/1) ... [2019-12-26 21:18:27,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:27" (1/1) ... [2019-12-26 21:18:27,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:27" (1/1) ... [2019-12-26 21:18:27,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:27" (1/1) ... [2019-12-26 21:18:27,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:27" (1/1) ... [2019-12-26 21:18:27,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:27" (1/1) ... [2019-12-26 21:18:27,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:18:27,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:18:27,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:18:27,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:18:27,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:27" (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 21:18:27,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:18:27,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:18:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:18:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:18:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:18:27,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:18:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:18:27,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:18:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:18:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:18:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:18:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:18:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:18:27,215 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 21:18:28,133 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:18:28,134 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:18:28,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:18:28 BoogieIcfgContainer [2019-12-26 21:18:28,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:18:28,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:18:28,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:18:28,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:18:28,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:18:26" (1/3) ... [2019-12-26 21:18:28,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5414ed43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:18:28, skipping insertion in model container [2019-12-26 21:18:28,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:18:27" (2/3) ... [2019-12-26 21:18:28,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5414ed43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:18:28, skipping insertion in model container [2019-12-26 21:18:28,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:18:28" (3/3) ... [2019-12-26 21:18:28,144 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_rmo.oepc.i [2019-12-26 21:18:28,155 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:18:28,155 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:18:28,164 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:18:28,165 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:18:28,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,210 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,211 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,211 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,212 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,212 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,240 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,241 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,248 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,248 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,276 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,278 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,287 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,287 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,287 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,295 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,295 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:18:28,313 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:18:28,335 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:18:28,335 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:18:28,335 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:18:28,335 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:18:28,335 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:18:28,336 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:18:28,336 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:18:28,336 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:18:28,355 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-26 21:18:28,357 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-26 21:18:28,467 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-26 21:18:28,467 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:18:28,488 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:18:28,517 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-26 21:18:28,574 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-26 21:18:28,575 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:18:28,583 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:18:28,606 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:18:28,607 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:18:34,085 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-26 21:18:34,225 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 21:18:34,245 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78628 [2019-12-26 21:18:34,246 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-26 21:18:34,250 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-26 21:18:52,067 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110182 states. [2019-12-26 21:18:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 110182 states. [2019-12-26 21:18:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:18:52,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:52,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:18:52,077 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 21:18:52,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:52,081 INFO L82 PathProgramCache]: Analyzing trace with hash 917838, now seen corresponding path program 1 times [2019-12-26 21:18:52,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:52,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561847396] [2019-12-26 21:18:52,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:52,353 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 21:18:52,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561847396] [2019-12-26 21:18:52,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:52,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:18:52,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220979915] [2019-12-26 21:18:52,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:18:52,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:52,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:18:52,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:18:52,378 INFO L87 Difference]: Start difference. First operand 110182 states. Second operand 3 states. [2019-12-26 21:18:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:53,570 INFO L93 Difference]: Finished difference Result 109312 states and 463550 transitions. [2019-12-26 21:18:53,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:18:53,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:18:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:54,205 INFO L225 Difference]: With dead ends: 109312 [2019-12-26 21:18:54,205 INFO L226 Difference]: Without dead ends: 102592 [2019-12-26 21:18:54,207 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 21:19:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102592 states. [2019-12-26 21:19:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102592 to 102592. [2019-12-26 21:19:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102592 states. [2019-12-26 21:19:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102592 states to 102592 states and 434430 transitions. [2019-12-26 21:19:07,360 INFO L78 Accepts]: Start accepts. Automaton has 102592 states and 434430 transitions. Word has length 3 [2019-12-26 21:19:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:07,360 INFO L462 AbstractCegarLoop]: Abstraction has 102592 states and 434430 transitions. [2019-12-26 21:19:07,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:19:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand 102592 states and 434430 transitions. [2019-12-26 21:19:07,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:19:07,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:07,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:19:07,364 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 21:19:07,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:07,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1857942485, now seen corresponding path program 1 times [2019-12-26 21:19:07,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:07,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745678348] [2019-12-26 21:19:07,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:07,506 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 21:19:07,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745678348] [2019-12-26 21:19:07,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:07,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:19:07,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612088215] [2019-12-26 21:19:07,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:19:07,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:07,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:19:07,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:19:07,510 INFO L87 Difference]: Start difference. First operand 102592 states and 434430 transitions. Second operand 4 states. [2019-12-26 21:19:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:12,867 INFO L93 Difference]: Finished difference Result 159508 states and 648686 transitions. [2019-12-26 21:19:12,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:19:12,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:19:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:13,589 INFO L225 Difference]: With dead ends: 159508 [2019-12-26 21:19:13,589 INFO L226 Difference]: Without dead ends: 159459 [2019-12-26 21:19:13,590 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 21:19:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159459 states. [2019-12-26 21:19:21,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159459 to 146095. [2019-12-26 21:19:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146095 states. [2019-12-26 21:19:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146095 states to 146095 states and 601450 transitions. [2019-12-26 21:19:28,507 INFO L78 Accepts]: Start accepts. Automaton has 146095 states and 601450 transitions. Word has length 11 [2019-12-26 21:19:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:28,507 INFO L462 AbstractCegarLoop]: Abstraction has 146095 states and 601450 transitions. [2019-12-26 21:19:28,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:19:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 146095 states and 601450 transitions. [2019-12-26 21:19:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:19:28,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:28,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:19:28,516 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 21:19:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:28,516 INFO L82 PathProgramCache]: Analyzing trace with hash 230844073, now seen corresponding path program 1 times [2019-12-26 21:19:28,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:28,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135128312] [2019-12-26 21:19:28,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:28,608 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 21:19:28,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135128312] [2019-12-26 21:19:28,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:28,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:19:28,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920281591] [2019-12-26 21:19:28,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:19:28,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:28,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:19:28,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:19:28,612 INFO L87 Difference]: Start difference. First operand 146095 states and 601450 transitions. Second operand 3 states. [2019-12-26 21:19:28,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:28,737 INFO L93 Difference]: Finished difference Result 32284 states and 104220 transitions. [2019-12-26 21:19:28,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:19:28,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:19:28,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:28,793 INFO L225 Difference]: With dead ends: 32284 [2019-12-26 21:19:28,793 INFO L226 Difference]: Without dead ends: 32284 [2019-12-26 21:19:28,794 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 21:19:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32284 states. [2019-12-26 21:19:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32284 to 32284. [2019-12-26 21:19:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32284 states. [2019-12-26 21:19:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32284 states to 32284 states and 104220 transitions. [2019-12-26 21:19:29,716 INFO L78 Accepts]: Start accepts. Automaton has 32284 states and 104220 transitions. Word has length 13 [2019-12-26 21:19:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:29,717 INFO L462 AbstractCegarLoop]: Abstraction has 32284 states and 104220 transitions. [2019-12-26 21:19:29,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:19:29,721 INFO L276 IsEmpty]: Start isEmpty. Operand 32284 states and 104220 transitions. [2019-12-26 21:19:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:19:29,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:29,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:19:29,727 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 21:19:29,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:29,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1069845708, now seen corresponding path program 1 times [2019-12-26 21:19:29,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:29,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224724564] [2019-12-26 21:19:29,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:29,873 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 21:19:29,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224724564] [2019-12-26 21:19:29,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:29,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:19:29,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881648749] [2019-12-26 21:19:29,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:19:29,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:29,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:19:29,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:19:29,878 INFO L87 Difference]: Start difference. First operand 32284 states and 104220 transitions. Second operand 4 states. [2019-12-26 21:19:30,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:30,220 INFO L93 Difference]: Finished difference Result 40215 states and 129418 transitions. [2019-12-26 21:19:30,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:19:30,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:19:30,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:30,312 INFO L225 Difference]: With dead ends: 40215 [2019-12-26 21:19:30,312 INFO L226 Difference]: Without dead ends: 40215 [2019-12-26 21:19:30,313 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 21:19:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40215 states. [2019-12-26 21:19:31,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40215 to 36090. [2019-12-26 21:19:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36090 states. [2019-12-26 21:19:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36090 states to 36090 states and 116495 transitions. [2019-12-26 21:19:32,034 INFO L78 Accepts]: Start accepts. Automaton has 36090 states and 116495 transitions. Word has length 16 [2019-12-26 21:19:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:32,035 INFO L462 AbstractCegarLoop]: Abstraction has 36090 states and 116495 transitions. [2019-12-26 21:19:32,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:19:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 36090 states and 116495 transitions. [2019-12-26 21:19:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:19:32,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:32,043 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 21:19:32,044 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 21:19:32,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:32,044 INFO L82 PathProgramCache]: Analyzing trace with hash 6986775, now seen corresponding path program 1 times [2019-12-26 21:19:32,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:32,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120961027] [2019-12-26 21:19:32,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:32,146 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 21:19:32,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120961027] [2019-12-26 21:19:32,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:32,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:19:32,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132660265] [2019-12-26 21:19:32,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:19:32,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:32,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:19:32,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:19:32,149 INFO L87 Difference]: Start difference. First operand 36090 states and 116495 transitions. Second operand 5 states. [2019-12-26 21:19:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:32,826 INFO L93 Difference]: Finished difference Result 46566 states and 147831 transitions. [2019-12-26 21:19:32,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:19:32,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:19:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:32,902 INFO L225 Difference]: With dead ends: 46566 [2019-12-26 21:19:32,902 INFO L226 Difference]: Without dead ends: 46559 [2019-12-26 21:19:32,903 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 21:19:33,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46559 states. [2019-12-26 21:19:34,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46559 to 35784. [2019-12-26 21:19:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2019-12-26 21:19:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 115349 transitions. [2019-12-26 21:19:34,342 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 115349 transitions. Word has length 22 [2019-12-26 21:19:34,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:34,343 INFO L462 AbstractCegarLoop]: Abstraction has 35784 states and 115349 transitions. [2019-12-26 21:19:34,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:19:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 115349 transitions. [2019-12-26 21:19:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:19:34,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:34,355 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 21:19:34,356 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 21:19:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:34,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1437372217, now seen corresponding path program 1 times [2019-12-26 21:19:34,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:34,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221492436] [2019-12-26 21:19:34,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:34,410 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 21:19:34,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221492436] [2019-12-26 21:19:34,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:34,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:19:34,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503182719] [2019-12-26 21:19:34,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:19:34,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:34,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:19:34,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:19:34,412 INFO L87 Difference]: Start difference. First operand 35784 states and 115349 transitions. Second operand 4 states. [2019-12-26 21:19:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:34,477 INFO L93 Difference]: Finished difference Result 14498 states and 44125 transitions. [2019-12-26 21:19:34,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:19:34,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:19:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:34,499 INFO L225 Difference]: With dead ends: 14498 [2019-12-26 21:19:34,500 INFO L226 Difference]: Without dead ends: 14498 [2019-12-26 21:19:34,500 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 21:19:34,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2019-12-26 21:19:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 14254. [2019-12-26 21:19:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14254 states. [2019-12-26 21:19:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14254 states to 14254 states and 43429 transitions. [2019-12-26 21:19:34,737 INFO L78 Accepts]: Start accepts. Automaton has 14254 states and 43429 transitions. Word has length 25 [2019-12-26 21:19:34,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:34,737 INFO L462 AbstractCegarLoop]: Abstraction has 14254 states and 43429 transitions. [2019-12-26 21:19:34,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:19:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states and 43429 transitions. [2019-12-26 21:19:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:19:34,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:34,749 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 21:19:34,749 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 21:19:34,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:34,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1947963172, now seen corresponding path program 1 times [2019-12-26 21:19:34,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:34,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090597925] [2019-12-26 21:19:34,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:34,860 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 21:19:34,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090597925] [2019-12-26 21:19:34,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:34,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:19:34,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917302220] [2019-12-26 21:19:34,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:19:34,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:34,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:19:34,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:19:34,863 INFO L87 Difference]: Start difference. First operand 14254 states and 43429 transitions. Second operand 6 states. [2019-12-26 21:19:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:36,209 INFO L93 Difference]: Finished difference Result 39008 states and 118911 transitions. [2019-12-26 21:19:36,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:19:36,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 21:19:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:36,268 INFO L225 Difference]: With dead ends: 39008 [2019-12-26 21:19:36,268 INFO L226 Difference]: Without dead ends: 39008 [2019-12-26 21:19:36,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:19:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39008 states. [2019-12-26 21:19:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39008 to 21620. [2019-12-26 21:19:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21620 states. [2019-12-26 21:19:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 66985 transitions. [2019-12-26 21:19:36,710 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 66985 transitions. Word has length 27 [2019-12-26 21:19:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:36,710 INFO L462 AbstractCegarLoop]: Abstraction has 21620 states and 66985 transitions. [2019-12-26 21:19:36,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:19:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 66985 transitions. [2019-12-26 21:19:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:19:36,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:36,733 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 21:19:36,733 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 21:19:36,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:36,733 INFO L82 PathProgramCache]: Analyzing trace with hash -89566793, now seen corresponding path program 1 times [2019-12-26 21:19:36,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:36,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297425941] [2019-12-26 21:19:36,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:36,832 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 21:19:36,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297425941] [2019-12-26 21:19:36,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:36,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:19:36,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018229636] [2019-12-26 21:19:36,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:19:36,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:36,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:19:36,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:19:36,834 INFO L87 Difference]: Start difference. First operand 21620 states and 66985 transitions. Second operand 6 states. [2019-12-26 21:19:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:37,587 INFO L93 Difference]: Finished difference Result 43584 states and 132186 transitions. [2019-12-26 21:19:37,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:19:37,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-26 21:19:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:37,654 INFO L225 Difference]: With dead ends: 43584 [2019-12-26 21:19:37,654 INFO L226 Difference]: Without dead ends: 43584 [2019-12-26 21:19:37,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:19:37,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43584 states. [2019-12-26 21:19:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43584 to 21360. [2019-12-26 21:19:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21360 states. [2019-12-26 21:19:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21360 states to 21360 states and 66500 transitions. [2019-12-26 21:19:38,772 INFO L78 Accepts]: Start accepts. Automaton has 21360 states and 66500 transitions. Word has length 28 [2019-12-26 21:19:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:38,772 INFO L462 AbstractCegarLoop]: Abstraction has 21360 states and 66500 transitions. [2019-12-26 21:19:38,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:19:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 21360 states and 66500 transitions. [2019-12-26 21:19:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:19:38,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:38,797 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 21:19:38,797 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 21:19:38,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:38,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1720610055, now seen corresponding path program 1 times [2019-12-26 21:19:38,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:38,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615340357] [2019-12-26 21:19:38,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:38,906 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 21:19:38,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615340357] [2019-12-26 21:19:38,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:38,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:19:38,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135514482] [2019-12-26 21:19:38,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:19:38,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:38,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:19:38,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:19:38,909 INFO L87 Difference]: Start difference. First operand 21360 states and 66500 transitions. Second operand 7 states. [2019-12-26 21:19:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:40,338 INFO L93 Difference]: Finished difference Result 51613 states and 157651 transitions. [2019-12-26 21:19:40,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:19:40,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 21:19:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:40,420 INFO L225 Difference]: With dead ends: 51613 [2019-12-26 21:19:40,421 INFO L226 Difference]: Without dead ends: 51613 [2019-12-26 21:19:40,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:19:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51613 states. [2019-12-26 21:19:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51613 to 23540. [2019-12-26 21:19:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23540 states. [2019-12-26 21:19:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23540 states to 23540 states and 73219 transitions. [2019-12-26 21:19:41,749 INFO L78 Accepts]: Start accepts. Automaton has 23540 states and 73219 transitions. Word has length 33 [2019-12-26 21:19:41,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:41,750 INFO L462 AbstractCegarLoop]: Abstraction has 23540 states and 73219 transitions. [2019-12-26 21:19:41,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:19:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 23540 states and 73219 transitions. [2019-12-26 21:19:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:19:41,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:41,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:19:41,778 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 21:19:41,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:41,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1518720007, now seen corresponding path program 2 times [2019-12-26 21:19:41,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:41,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914268298] [2019-12-26 21:19:41,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:41,882 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 21:19:41,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914268298] [2019-12-26 21:19:41,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:41,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:19:41,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389156050] [2019-12-26 21:19:41,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:19:41,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:41,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:19:41,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:19:41,884 INFO L87 Difference]: Start difference. First operand 23540 states and 73219 transitions. Second operand 8 states. [2019-12-26 21:19:44,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:44,058 INFO L93 Difference]: Finished difference Result 79921 states and 239364 transitions. [2019-12-26 21:19:44,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 21:19:44,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-26 21:19:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:44,191 INFO L225 Difference]: With dead ends: 79921 [2019-12-26 21:19:44,191 INFO L226 Difference]: Without dead ends: 79921 [2019-12-26 21:19:44,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2019-12-26 21:19:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79921 states. [2019-12-26 21:19:45,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79921 to 22493. [2019-12-26 21:19:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22493 states. [2019-12-26 21:19:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22493 states to 22493 states and 69836 transitions. [2019-12-26 21:19:45,691 INFO L78 Accepts]: Start accepts. Automaton has 22493 states and 69836 transitions. Word has length 33 [2019-12-26 21:19:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:45,691 INFO L462 AbstractCegarLoop]: Abstraction has 22493 states and 69836 transitions. [2019-12-26 21:19:45,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:19:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 22493 states and 69836 transitions. [2019-12-26 21:19:45,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:19:45,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:45,717 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 21:19:45,717 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 21:19:45,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:45,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2146187134, now seen corresponding path program 1 times [2019-12-26 21:19:45,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:45,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190793931] [2019-12-26 21:19:45,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:45,846 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 21:19:45,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190793931] [2019-12-26 21:19:45,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:45,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:19:45,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623190887] [2019-12-26 21:19:45,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:19:45,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:45,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:19:45,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:19:45,848 INFO L87 Difference]: Start difference. First operand 22493 states and 69836 transitions. Second operand 7 states. [2019-12-26 21:19:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:47,284 INFO L93 Difference]: Finished difference Result 45327 states and 136889 transitions. [2019-12-26 21:19:47,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:19:47,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-26 21:19:47,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:47,354 INFO L225 Difference]: With dead ends: 45327 [2019-12-26 21:19:47,354 INFO L226 Difference]: Without dead ends: 45327 [2019-12-26 21:19:47,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:19:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45327 states. [2019-12-26 21:19:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45327 to 20305. [2019-12-26 21:19:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20305 states. [2019-12-26 21:19:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20305 states to 20305 states and 63138 transitions. [2019-12-26 21:19:47,841 INFO L78 Accepts]: Start accepts. Automaton has 20305 states and 63138 transitions. Word has length 34 [2019-12-26 21:19:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:47,841 INFO L462 AbstractCegarLoop]: Abstraction has 20305 states and 63138 transitions. [2019-12-26 21:19:47,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:19:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 20305 states and 63138 transitions. [2019-12-26 21:19:47,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:19:47,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:47,861 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 21:19:47,861 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 21:19:47,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:47,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1401085166, now seen corresponding path program 2 times [2019-12-26 21:19:47,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:47,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303661973] [2019-12-26 21:19:47,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:47,982 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 21:19:47,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303661973] [2019-12-26 21:19:47,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:47,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:19:47,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257197066] [2019-12-26 21:19:47,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:19:47,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:47,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:19:47,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:19:47,985 INFO L87 Difference]: Start difference. First operand 20305 states and 63138 transitions. Second operand 8 states. [2019-12-26 21:19:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:50,487 INFO L93 Difference]: Finished difference Result 60447 states and 179980 transitions. [2019-12-26 21:19:50,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 21:19:50,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-26 21:19:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:50,583 INFO L225 Difference]: With dead ends: 60447 [2019-12-26 21:19:50,583 INFO L226 Difference]: Without dead ends: 60447 [2019-12-26 21:19:50,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2019-12-26 21:19:50,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60447 states. [2019-12-26 21:19:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60447 to 18462. [2019-12-26 21:19:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18462 states. [2019-12-26 21:19:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18462 states to 18462 states and 57434 transitions. [2019-12-26 21:19:51,147 INFO L78 Accepts]: Start accepts. Automaton has 18462 states and 57434 transitions. Word has length 34 [2019-12-26 21:19:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:51,148 INFO L462 AbstractCegarLoop]: Abstraction has 18462 states and 57434 transitions. [2019-12-26 21:19:51,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:19:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 18462 states and 57434 transitions. [2019-12-26 21:19:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:19:51,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:51,167 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 21:19:51,167 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 21:19:51,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash 342833665, now seen corresponding path program 1 times [2019-12-26 21:19:51,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:51,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700152163] [2019-12-26 21:19:51,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:51,229 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 21:19:51,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700152163] [2019-12-26 21:19:51,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:51,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:19:51,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616191995] [2019-12-26 21:19:51,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:19:51,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:51,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:19:51,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:19:51,232 INFO L87 Difference]: Start difference. First operand 18462 states and 57434 transitions. Second operand 3 states. [2019-12-26 21:19:51,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:51,320 INFO L93 Difference]: Finished difference Result 18461 states and 57432 transitions. [2019-12-26 21:19:51,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:19:51,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:19:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:51,356 INFO L225 Difference]: With dead ends: 18461 [2019-12-26 21:19:51,357 INFO L226 Difference]: Without dead ends: 18461 [2019-12-26 21:19:51,357 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 21:19:51,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18461 states. [2019-12-26 21:19:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18461 to 18461. [2019-12-26 21:19:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18461 states. [2019-12-26 21:19:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18461 states to 18461 states and 57432 transitions. [2019-12-26 21:19:52,355 INFO L78 Accepts]: Start accepts. Automaton has 18461 states and 57432 transitions. Word has length 39 [2019-12-26 21:19:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:52,356 INFO L462 AbstractCegarLoop]: Abstraction has 18461 states and 57432 transitions. [2019-12-26 21:19:52,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:19:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 18461 states and 57432 transitions. [2019-12-26 21:19:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:19:52,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:52,378 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 21:19:52,379 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 21:19:52,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:52,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1054064562, now seen corresponding path program 1 times [2019-12-26 21:19:52,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:52,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165894395] [2019-12-26 21:19:52,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:52,420 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 21:19:52,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165894395] [2019-12-26 21:19:52,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:52,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:19:52,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865199598] [2019-12-26 21:19:52,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:19:52,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:52,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:19:52,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:19:52,422 INFO L87 Difference]: Start difference. First operand 18461 states and 57432 transitions. Second operand 3 states. [2019-12-26 21:19:52,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:52,556 INFO L93 Difference]: Finished difference Result 32125 states and 100306 transitions. [2019-12-26 21:19:52,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:19:52,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 21:19:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:52,592 INFO L225 Difference]: With dead ends: 32125 [2019-12-26 21:19:52,592 INFO L226 Difference]: Without dead ends: 16527 [2019-12-26 21:19:52,593 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 21:19:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16527 states. [2019-12-26 21:19:52,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16527 to 16461. [2019-12-26 21:19:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16461 states. [2019-12-26 21:19:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16461 states to 16461 states and 50424 transitions. [2019-12-26 21:19:52,877 INFO L78 Accepts]: Start accepts. Automaton has 16461 states and 50424 transitions. Word has length 40 [2019-12-26 21:19:52,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:52,877 INFO L462 AbstractCegarLoop]: Abstraction has 16461 states and 50424 transitions. [2019-12-26 21:19:52,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:19:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 16461 states and 50424 transitions. [2019-12-26 21:19:52,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:19:52,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:52,898 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 21:19:52,898 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 21:19:52,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:52,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1620503104, now seen corresponding path program 2 times [2019-12-26 21:19:52,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:52,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689413693] [2019-12-26 21:19:52,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:52,966 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 21:19:52,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689413693] [2019-12-26 21:19:52,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:52,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:19:52,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908514817] [2019-12-26 21:19:52,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:19:52,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:52,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:19:52,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:19:52,968 INFO L87 Difference]: Start difference. First operand 16461 states and 50424 transitions. Second operand 5 states. [2019-12-26 21:19:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:53,548 INFO L93 Difference]: Finished difference Result 27952 states and 83792 transitions. [2019-12-26 21:19:53,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:19:53,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:19:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:53,602 INFO L225 Difference]: With dead ends: 27952 [2019-12-26 21:19:53,602 INFO L226 Difference]: Without dead ends: 27952 [2019-12-26 21:19:53,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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 21:19:53,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27952 states. [2019-12-26 21:19:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27952 to 22733. [2019-12-26 21:19:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22733 states. [2019-12-26 21:19:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22733 states to 22733 states and 69291 transitions. [2019-12-26 21:19:53,965 INFO L78 Accepts]: Start accepts. Automaton has 22733 states and 69291 transitions. Word has length 40 [2019-12-26 21:19:53,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:53,966 INFO L462 AbstractCegarLoop]: Abstraction has 22733 states and 69291 transitions. [2019-12-26 21:19:53,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:19:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 22733 states and 69291 transitions. [2019-12-26 21:19:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:19:53,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:53,987 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 21:19:53,987 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 21:19:53,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:53,988 INFO L82 PathProgramCache]: Analyzing trace with hash 2071452234, now seen corresponding path program 3 times [2019-12-26 21:19:53,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:53,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689294257] [2019-12-26 21:19:53,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:54,054 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 21:19:54,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689294257] [2019-12-26 21:19:54,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:54,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:19:54,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492433307] [2019-12-26 21:19:54,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:19:54,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:54,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:19:54,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:19:54,056 INFO L87 Difference]: Start difference. First operand 22733 states and 69291 transitions. Second operand 6 states. [2019-12-26 21:19:54,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:54,870 INFO L93 Difference]: Finished difference Result 38413 states and 116262 transitions. [2019-12-26 21:19:54,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 21:19:54,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 21:19:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:55,539 INFO L225 Difference]: With dead ends: 38413 [2019-12-26 21:19:55,539 INFO L226 Difference]: Without dead ends: 38413 [2019-12-26 21:19:55,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:19:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38413 states. [2019-12-26 21:19:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38413 to 26717. [2019-12-26 21:19:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26717 states. [2019-12-26 21:19:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26717 states to 26717 states and 81414 transitions. [2019-12-26 21:19:56,010 INFO L78 Accepts]: Start accepts. Automaton has 26717 states and 81414 transitions. Word has length 40 [2019-12-26 21:19:56,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:56,011 INFO L462 AbstractCegarLoop]: Abstraction has 26717 states and 81414 transitions. [2019-12-26 21:19:56,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:19:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 26717 states and 81414 transitions. [2019-12-26 21:19:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:19:56,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:56,041 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 21:19:56,041 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 21:19:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1944149328, now seen corresponding path program 4 times [2019-12-26 21:19:56,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:56,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327627208] [2019-12-26 21:19:56,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:56,102 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 21:19:56,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327627208] [2019-12-26 21:19:56,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:56,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:19:56,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447784751] [2019-12-26 21:19:56,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:19:56,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:56,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:19:56,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:19:56,104 INFO L87 Difference]: Start difference. First operand 26717 states and 81414 transitions. Second operand 5 states. [2019-12-26 21:19:56,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:56,231 INFO L93 Difference]: Finished difference Result 25359 states and 78201 transitions. [2019-12-26 21:19:56,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:19:56,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:19:56,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:56,265 INFO L225 Difference]: With dead ends: 25359 [2019-12-26 21:19:56,265 INFO L226 Difference]: Without dead ends: 23331 [2019-12-26 21:19:56,265 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 21:19:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23331 states. [2019-12-26 21:19:56,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23331 to 22246. [2019-12-26 21:19:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22246 states. [2019-12-26 21:19:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22246 states to 22246 states and 70322 transitions. [2019-12-26 21:19:56,633 INFO L78 Accepts]: Start accepts. Automaton has 22246 states and 70322 transitions. Word has length 40 [2019-12-26 21:19:56,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:56,634 INFO L462 AbstractCegarLoop]: Abstraction has 22246 states and 70322 transitions. [2019-12-26 21:19:56,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:19:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 22246 states and 70322 transitions. [2019-12-26 21:19:56,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:19:56,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:56,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:19:56,662 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 21:19:56,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:56,662 INFO L82 PathProgramCache]: Analyzing trace with hash 275512574, now seen corresponding path program 1 times [2019-12-26 21:19:56,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:56,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595133880] [2019-12-26 21:19:56,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:56,751 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 21:19:56,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595133880] [2019-12-26 21:19:56,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:56,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:19:56,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449294750] [2019-12-26 21:19:56,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:19:56,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:56,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:19:56,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:19:56,755 INFO L87 Difference]: Start difference. First operand 22246 states and 70322 transitions. Second operand 7 states. [2019-12-26 21:19:57,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:57,298 INFO L93 Difference]: Finished difference Result 72025 states and 224764 transitions. [2019-12-26 21:19:57,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:19:57,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:19:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:58,085 INFO L225 Difference]: With dead ends: 72025 [2019-12-26 21:19:58,085 INFO L226 Difference]: Without dead ends: 50174 [2019-12-26 21:19:58,086 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 21:19:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50174 states. [2019-12-26 21:19:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50174 to 25630. [2019-12-26 21:19:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25630 states. [2019-12-26 21:19:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25630 states to 25630 states and 81003 transitions. [2019-12-26 21:19:58,663 INFO L78 Accepts]: Start accepts. Automaton has 25630 states and 81003 transitions. Word has length 64 [2019-12-26 21:19:58,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:58,663 INFO L462 AbstractCegarLoop]: Abstraction has 25630 states and 81003 transitions. [2019-12-26 21:19:58,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:19:58,663 INFO L276 IsEmpty]: Start isEmpty. Operand 25630 states and 81003 transitions. [2019-12-26 21:19:58,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:19:58,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:58,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:19:58,696 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 21:19:58,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:58,696 INFO L82 PathProgramCache]: Analyzing trace with hash 474826606, now seen corresponding path program 2 times [2019-12-26 21:19:58,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:58,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157175443] [2019-12-26 21:19:58,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:58,802 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 21:19:58,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157175443] [2019-12-26 21:19:58,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:58,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:19:58,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230413532] [2019-12-26 21:19:58,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:19:58,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:58,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:19:58,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:19:58,805 INFO L87 Difference]: Start difference. First operand 25630 states and 81003 transitions. Second operand 8 states. [2019-12-26 21:20:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:00,636 INFO L93 Difference]: Finished difference Result 121805 states and 379916 transitions. [2019-12-26 21:20:00,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:20:00,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-26 21:20:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:00,857 INFO L225 Difference]: With dead ends: 121805 [2019-12-26 21:20:00,857 INFO L226 Difference]: Without dead ends: 83754 [2019-12-26 21:20:00,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-26 21:20:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83754 states. [2019-12-26 21:20:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83754 to 29901. [2019-12-26 21:20:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29901 states. [2019-12-26 21:20:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29901 states to 29901 states and 94342 transitions. [2019-12-26 21:20:02,624 INFO L78 Accepts]: Start accepts. Automaton has 29901 states and 94342 transitions. Word has length 64 [2019-12-26 21:20:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:02,624 INFO L462 AbstractCegarLoop]: Abstraction has 29901 states and 94342 transitions. [2019-12-26 21:20:02,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:20:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 29901 states and 94342 transitions. [2019-12-26 21:20:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:20:02,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:02,659 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:20:02,660 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 21:20:02,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:02,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1554423936, now seen corresponding path program 3 times [2019-12-26 21:20:02,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:02,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934623058] [2019-12-26 21:20:02,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:20:02,774 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 21:20:02,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934623058] [2019-12-26 21:20:02,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:20:02,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:20:02,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091720258] [2019-12-26 21:20:02,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:20:02,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:20:02,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:20:02,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:20:02,776 INFO L87 Difference]: Start difference. First operand 29901 states and 94342 transitions. Second operand 9 states. [2019-12-26 21:20:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:05,027 INFO L93 Difference]: Finished difference Result 183880 states and 570924 transitions. [2019-12-26 21:20:05,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-26 21:20:05,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:20:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:05,280 INFO L225 Difference]: With dead ends: 183880 [2019-12-26 21:20:05,280 INFO L226 Difference]: Without dead ends: 147650 [2019-12-26 21:20:05,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=363, Invalid=1043, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 21:20:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147650 states. [2019-12-26 21:20:07,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147650 to 36955. [2019-12-26 21:20:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36955 states. [2019-12-26 21:20:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36955 states to 36955 states and 116388 transitions. [2019-12-26 21:20:07,665 INFO L78 Accepts]: Start accepts. Automaton has 36955 states and 116388 transitions. Word has length 64 [2019-12-26 21:20:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:07,665 INFO L462 AbstractCegarLoop]: Abstraction has 36955 states and 116388 transitions. [2019-12-26 21:20:07,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:20:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 36955 states and 116388 transitions. [2019-12-26 21:20:07,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:20:07,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:07,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:20:07,711 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 21:20:07,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:07,711 INFO L82 PathProgramCache]: Analyzing trace with hash 85476954, now seen corresponding path program 4 times [2019-12-26 21:20:07,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:07,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641713100] [2019-12-26 21:20:07,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:20:07,810 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 21:20:07,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641713100] [2019-12-26 21:20:07,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:20:07,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:20:07,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423743678] [2019-12-26 21:20:07,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:20:07,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:20:07,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:20:07,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:20:07,812 INFO L87 Difference]: Start difference. First operand 36955 states and 116388 transitions. Second operand 9 states. [2019-12-26 21:20:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:10,352 INFO L93 Difference]: Finished difference Result 152885 states and 470048 transitions. [2019-12-26 21:20:10,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 21:20:10,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:20:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:10,578 INFO L225 Difference]: With dead ends: 152885 [2019-12-26 21:20:10,578 INFO L226 Difference]: Without dead ends: 136778 [2019-12-26 21:20:10,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 21:20:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136778 states. [2019-12-26 21:20:11,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136778 to 36142. [2019-12-26 21:20:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36142 states. [2019-12-26 21:20:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36142 states to 36142 states and 113529 transitions. [2019-12-26 21:20:13,057 INFO L78 Accepts]: Start accepts. Automaton has 36142 states and 113529 transitions. Word has length 64 [2019-12-26 21:20:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:13,057 INFO L462 AbstractCegarLoop]: Abstraction has 36142 states and 113529 transitions. [2019-12-26 21:20:13,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:20:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 36142 states and 113529 transitions. [2019-12-26 21:20:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:20:13,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:13,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:20:13,103 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 21:20:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:13,103 INFO L82 PathProgramCache]: Analyzing trace with hash 812479892, now seen corresponding path program 5 times [2019-12-26 21:20:13,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:13,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427963545] [2019-12-26 21:20:13,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:20:13,201 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 21:20:13,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427963545] [2019-12-26 21:20:13,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:20:13,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:20:13,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345928791] [2019-12-26 21:20:13,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:20:13,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:20:13,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:20:13,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:20:13,205 INFO L87 Difference]: Start difference. First operand 36142 states and 113529 transitions. Second operand 7 states. [2019-12-26 21:20:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:13,898 INFO L93 Difference]: Finished difference Result 78673 states and 242006 transitions. [2019-12-26 21:20:13,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:20:13,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:20:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:14,007 INFO L225 Difference]: With dead ends: 78673 [2019-12-26 21:20:14,007 INFO L226 Difference]: Without dead ends: 67651 [2019-12-26 21:20:14,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:20:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67651 states. [2019-12-26 21:20:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67651 to 36206. [2019-12-26 21:20:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36206 states. [2019-12-26 21:20:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36206 states to 36206 states and 113658 transitions. [2019-12-26 21:20:14,853 INFO L78 Accepts]: Start accepts. Automaton has 36206 states and 113658 transitions. Word has length 64 [2019-12-26 21:20:14,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:14,853 INFO L462 AbstractCegarLoop]: Abstraction has 36206 states and 113658 transitions. [2019-12-26 21:20:14,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:20:14,853 INFO L276 IsEmpty]: Start isEmpty. Operand 36206 states and 113658 transitions. [2019-12-26 21:20:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:20:14,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:14,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:20:14,899 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 21:20:14,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:14,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1442601312, now seen corresponding path program 6 times [2019-12-26 21:20:14,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:14,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835504281] [2019-12-26 21:20:14,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:20:14,962 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 21:20:14,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835504281] [2019-12-26 21:20:14,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:20:14,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:20:14,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55222266] [2019-12-26 21:20:14,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:20:14,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:20:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:20:14,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:20:14,964 INFO L87 Difference]: Start difference. First operand 36206 states and 113658 transitions. Second operand 3 states. [2019-12-26 21:20:15,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:15,197 INFO L93 Difference]: Finished difference Result 43673 states and 135917 transitions. [2019-12-26 21:20:15,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:20:15,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:20:15,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:15,263 INFO L225 Difference]: With dead ends: 43673 [2019-12-26 21:20:15,263 INFO L226 Difference]: Without dead ends: 43673 [2019-12-26 21:20:15,264 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 21:20:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43673 states. [2019-12-26 21:20:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43673 to 37805. [2019-12-26 21:20:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37805 states. [2019-12-26 21:20:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37805 states to 37805 states and 118379 transitions. [2019-12-26 21:20:16,508 INFO L78 Accepts]: Start accepts. Automaton has 37805 states and 118379 transitions. Word has length 64 [2019-12-26 21:20:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:16,508 INFO L462 AbstractCegarLoop]: Abstraction has 37805 states and 118379 transitions. [2019-12-26 21:20:16,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:20:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 37805 states and 118379 transitions. [2019-12-26 21:20:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:20:16,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:16,555 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 21:20:16,555 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 21:20:16,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:16,555 INFO L82 PathProgramCache]: Analyzing trace with hash 318332456, now seen corresponding path program 1 times [2019-12-26 21:20:16,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:16,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213687061] [2019-12-26 21:20:16,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:20:16,674 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 21:20:16,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213687061] [2019-12-26 21:20:16,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:20:16,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:20:16,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029631609] [2019-12-26 21:20:16,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:20:16,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:20:16,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:20:16,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:20:16,677 INFO L87 Difference]: Start difference. First operand 37805 states and 118379 transitions. Second operand 8 states. [2019-12-26 21:20:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:17,895 INFO L93 Difference]: Finished difference Result 110886 states and 342679 transitions. [2019-12-26 21:20:17,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:20:17,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 21:20:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:18,069 INFO L225 Difference]: With dead ends: 110886 [2019-12-26 21:20:18,069 INFO L226 Difference]: Without dead ends: 104510 [2019-12-26 21:20:18,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:20:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104510 states. [2019-12-26 21:20:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104510 to 38340. [2019-12-26 21:20:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38340 states. [2019-12-26 21:20:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38340 states to 38340 states and 120322 transitions. [2019-12-26 21:20:19,656 INFO L78 Accepts]: Start accepts. Automaton has 38340 states and 120322 transitions. Word has length 65 [2019-12-26 21:20:19,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:19,657 INFO L462 AbstractCegarLoop]: Abstraction has 38340 states and 120322 transitions. [2019-12-26 21:20:19,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:20:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 38340 states and 120322 transitions. [2019-12-26 21:20:19,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:20:19,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:19,704 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 21:20:19,704 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 21:20:19,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:19,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1590918528, now seen corresponding path program 2 times [2019-12-26 21:20:19,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:19,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163677993] [2019-12-26 21:20:19,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:20:19,814 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 21:20:19,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163677993] [2019-12-26 21:20:19,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:20:19,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:20:19,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885298234] [2019-12-26 21:20:19,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:20:19,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:20:19,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:20:19,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:20:19,815 INFO L87 Difference]: Start difference. First operand 38340 states and 120322 transitions. Second operand 9 states. [2019-12-26 21:20:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:21,830 INFO L93 Difference]: Finished difference Result 163120 states and 501153 transitions. [2019-12-26 21:20:21,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 21:20:21,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:20:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:22,059 INFO L225 Difference]: With dead ends: 163120 [2019-12-26 21:20:22,059 INFO L226 Difference]: Without dead ends: 134485 [2019-12-26 21:20:22,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 21:20:22,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134485 states. [2019-12-26 21:20:23,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134485 to 40212. [2019-12-26 21:20:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40212 states. [2019-12-26 21:20:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40212 states to 40212 states and 125303 transitions. [2019-12-26 21:20:23,838 INFO L78 Accepts]: Start accepts. Automaton has 40212 states and 125303 transitions. Word has length 65 [2019-12-26 21:20:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:23,838 INFO L462 AbstractCegarLoop]: Abstraction has 40212 states and 125303 transitions. [2019-12-26 21:20:23,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:20:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 40212 states and 125303 transitions. [2019-12-26 21:20:23,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:20:23,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:23,886 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 21:20:23,886 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 21:20:23,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:23,886 INFO L82 PathProgramCache]: Analyzing trace with hash 704301340, now seen corresponding path program 3 times [2019-12-26 21:20:23,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:23,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430490611] [2019-12-26 21:20:23,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:20:23,996 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 21:20:23,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430490611] [2019-12-26 21:20:23,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:20:23,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:20:23,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008145761] [2019-12-26 21:20:23,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:20:23,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:20:23,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:20:23,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:20:23,999 INFO L87 Difference]: Start difference. First operand 40212 states and 125303 transitions. Second operand 9 states. [2019-12-26 21:20:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:25,908 INFO L93 Difference]: Finished difference Result 132812 states and 405190 transitions. [2019-12-26 21:20:25,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 21:20:25,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:20:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:26,104 INFO L225 Difference]: With dead ends: 132812 [2019-12-26 21:20:26,105 INFO L226 Difference]: Without dead ends: 124029 [2019-12-26 21:20:26,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-26 21:20:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124029 states. [2019-12-26 21:20:27,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124029 to 38469. [2019-12-26 21:20:27,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38469 states. [2019-12-26 21:20:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38469 states to 38469 states and 120398 transitions. [2019-12-26 21:20:27,472 INFO L78 Accepts]: Start accepts. Automaton has 38469 states and 120398 transitions. Word has length 65 [2019-12-26 21:20:27,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:27,473 INFO L462 AbstractCegarLoop]: Abstraction has 38469 states and 120398 transitions. [2019-12-26 21:20:27,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:20:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 38469 states and 120398 transitions. [2019-12-26 21:20:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:20:27,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:27,517 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 21:20:27,517 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 21:20:27,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:27,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1422061222, now seen corresponding path program 1 times [2019-12-26 21:20:27,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:27,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100949125] [2019-12-26 21:20:27,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:20:27,633 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 21:20:27,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100949125] [2019-12-26 21:20:27,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:20:27,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:20:27,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504281580] [2019-12-26 21:20:27,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:20:27,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:20:27,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:20:27,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:20:27,635 INFO L87 Difference]: Start difference. First operand 38469 states and 120398 transitions. Second operand 7 states. [2019-12-26 21:20:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:29,483 INFO L93 Difference]: Finished difference Result 72617 states and 222939 transitions. [2019-12-26 21:20:29,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:20:29,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:20:29,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:29,601 INFO L225 Difference]: With dead ends: 72617 [2019-12-26 21:20:29,601 INFO L226 Difference]: Without dead ends: 72617 [2019-12-26 21:20:29,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:20:29,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72617 states. [2019-12-26 21:20:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72617 to 39272. [2019-12-26 21:20:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39272 states. [2019-12-26 21:20:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39272 states to 39272 states and 122780 transitions. [2019-12-26 21:20:30,485 INFO L78 Accepts]: Start accepts. Automaton has 39272 states and 122780 transitions. Word has length 65 [2019-12-26 21:20:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:30,485 INFO L462 AbstractCegarLoop]: Abstraction has 39272 states and 122780 transitions. [2019-12-26 21:20:30,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:20:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 39272 states and 122780 transitions. [2019-12-26 21:20:30,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:20:30,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:30,530 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 21:20:30,531 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:20:30,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:30,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1551355630, now seen corresponding path program 4 times [2019-12-26 21:20:30,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:30,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151406208] [2019-12-26 21:20:30,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:20:30,624 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 21:20:30,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151406208] [2019-12-26 21:20:30,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:20:30,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:20:30,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769087574] [2019-12-26 21:20:30,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:20:30,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:20:30,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:20:30,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:20:30,626 INFO L87 Difference]: Start difference. First operand 39272 states and 122780 transitions. Second operand 7 states. [2019-12-26 21:20:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:32,472 INFO L93 Difference]: Finished difference Result 71507 states and 217949 transitions. [2019-12-26 21:20:32,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:20:32,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:20:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:32,585 INFO L225 Difference]: With dead ends: 71507 [2019-12-26 21:20:32,585 INFO L226 Difference]: Without dead ends: 71507 [2019-12-26 21:20:32,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:20:32,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71507 states. [2019-12-26 21:20:33,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71507 to 40699. [2019-12-26 21:20:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40699 states. [2019-12-26 21:20:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40699 states to 40699 states and 126651 transitions. [2019-12-26 21:20:33,506 INFO L78 Accepts]: Start accepts. Automaton has 40699 states and 126651 transitions. Word has length 65 [2019-12-26 21:20:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:33,506 INFO L462 AbstractCegarLoop]: Abstraction has 40699 states and 126651 transitions. [2019-12-26 21:20:33,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:20:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 40699 states and 126651 transitions. [2019-12-26 21:20:33,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:20:33,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:33,554 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 21:20:33,554 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:20:33,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:33,555 INFO L82 PathProgramCache]: Analyzing trace with hash 372067404, now seen corresponding path program 2 times [2019-12-26 21:20:33,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:33,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375039889] [2019-12-26 21:20:33,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:20:33,680 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 21:20:33,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375039889] [2019-12-26 21:20:33,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:20:33,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:20:33,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140786418] [2019-12-26 21:20:33,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:20:33,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:20:33,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:20:33,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:20:33,682 INFO L87 Difference]: Start difference. First operand 40699 states and 126651 transitions. Second operand 8 states. [2019-12-26 21:20:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:35,570 INFO L93 Difference]: Finished difference Result 83238 states and 255936 transitions. [2019-12-26 21:20:35,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:20:35,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 21:20:35,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:36,046 INFO L225 Difference]: With dead ends: 83238 [2019-12-26 21:20:36,046 INFO L226 Difference]: Without dead ends: 83238 [2019-12-26 21:20:36,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:20:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83238 states. [2019-12-26 21:20:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83238 to 43093. [2019-12-26 21:20:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43093 states. [2019-12-26 21:20:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43093 states to 43093 states and 135136 transitions. [2019-12-26 21:20:36,992 INFO L78 Accepts]: Start accepts. Automaton has 43093 states and 135136 transitions. Word has length 65 [2019-12-26 21:20:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:36,992 INFO L462 AbstractCegarLoop]: Abstraction has 43093 states and 135136 transitions. [2019-12-26 21:20:36,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:20:36,992 INFO L276 IsEmpty]: Start isEmpty. Operand 43093 states and 135136 transitions. [2019-12-26 21:20:37,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:20:37,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:37,045 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 21:20:37,045 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:20:37,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:37,045 INFO L82 PathProgramCache]: Analyzing trace with hash 140793632, now seen corresponding path program 3 times [2019-12-26 21:20:37,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:37,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672085101] [2019-12-26 21:20:37,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:20:37,402 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 21:20:37,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672085101] [2019-12-26 21:20:37,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:20:37,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 21:20:37,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061551489] [2019-12-26 21:20:37,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 21:20:37,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:20:37,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 21:20:37,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:20:37,409 INFO L87 Difference]: Start difference. First operand 43093 states and 135136 transitions. Second operand 13 states. [2019-12-26 21:20:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:41,995 INFO L93 Difference]: Finished difference Result 84732 states and 259723 transitions. [2019-12-26 21:20:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-26 21:20:41,995 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-26 21:20:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:42,127 INFO L225 Difference]: With dead ends: 84732 [2019-12-26 21:20:42,127 INFO L226 Difference]: Without dead ends: 84480 [2019-12-26 21:20:42,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=455, Invalid=1897, Unknown=0, NotChecked=0, Total=2352 [2019-12-26 21:20:42,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84480 states. [2019-12-26 21:20:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84480 to 48487. [2019-12-26 21:20:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48487 states. [2019-12-26 21:20:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48487 states to 48487 states and 151822 transitions. [2019-12-26 21:20:43,256 INFO L78 Accepts]: Start accepts. Automaton has 48487 states and 151822 transitions. Word has length 65 [2019-12-26 21:20:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:43,256 INFO L462 AbstractCegarLoop]: Abstraction has 48487 states and 151822 transitions. [2019-12-26 21:20:43,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 21:20:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 48487 states and 151822 transitions. [2019-12-26 21:20:43,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:20:43,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:43,314 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 21:20:43,314 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:20:43,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:43,315 INFO L82 PathProgramCache]: Analyzing trace with hash 25454022, now seen corresponding path program 4 times [2019-12-26 21:20:43,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:43,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076213532] [2019-12-26 21:20:43,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:20:43,474 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 21:20:43,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076213532] [2019-12-26 21:20:43,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:20:43,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:20:43,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622064968] [2019-12-26 21:20:43,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:20:43,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:20:43,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:20:43,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:20:43,476 INFO L87 Difference]: Start difference. First operand 48487 states and 151822 transitions. Second operand 8 states. [2019-12-26 21:20:46,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:46,016 INFO L93 Difference]: Finished difference Result 82192 states and 251837 transitions. [2019-12-26 21:20:46,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 21:20:46,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 21:20:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:46,162 INFO L225 Difference]: With dead ends: 82192 [2019-12-26 21:20:46,162 INFO L226 Difference]: Without dead ends: 82192 [2019-12-26 21:20:46,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2019-12-26 21:20:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82192 states. [2019-12-26 21:20:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82192 to 48732. [2019-12-26 21:20:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48732 states. [2019-12-26 21:20:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48732 states to 48732 states and 152796 transitions. [2019-12-26 21:20:47,295 INFO L78 Accepts]: Start accepts. Automaton has 48732 states and 152796 transitions. Word has length 65 [2019-12-26 21:20:47,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:47,295 INFO L462 AbstractCegarLoop]: Abstraction has 48732 states and 152796 transitions. [2019-12-26 21:20:47,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:20:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 48732 states and 152796 transitions. [2019-12-26 21:20:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:20:47,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:47,355 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 21:20:47,355 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:20:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:47,355 INFO L82 PathProgramCache]: Analyzing trace with hash 428269476, now seen corresponding path program 5 times [2019-12-26 21:20:47,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:47,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528840586] [2019-12-26 21:20:47,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:20:47,410 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 21:20:47,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528840586] [2019-12-26 21:20:47,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:20:47,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:20:47,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26403969] [2019-12-26 21:20:47,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:20:47,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:20:47,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:20:47,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:20:47,412 INFO L87 Difference]: Start difference. First operand 48732 states and 152796 transitions. Second operand 3 states. [2019-12-26 21:20:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:47,543 INFO L93 Difference]: Finished difference Result 34985 states and 109285 transitions. [2019-12-26 21:20:47,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:20:47,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:20:47,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:47,595 INFO L225 Difference]: With dead ends: 34985 [2019-12-26 21:20:47,595 INFO L226 Difference]: Without dead ends: 34985 [2019-12-26 21:20:47,597 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 21:20:47,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34985 states. [2019-12-26 21:20:48,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34985 to 32932. [2019-12-26 21:20:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32932 states. [2019-12-26 21:20:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32932 states to 32932 states and 102559 transitions. [2019-12-26 21:20:48,394 INFO L78 Accepts]: Start accepts. Automaton has 32932 states and 102559 transitions. Word has length 65 [2019-12-26 21:20:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:48,395 INFO L462 AbstractCegarLoop]: Abstraction has 32932 states and 102559 transitions. [2019-12-26 21:20:48,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:20:48,395 INFO L276 IsEmpty]: Start isEmpty. Operand 32932 states and 102559 transitions. [2019-12-26 21:20:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:20:48,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:48,436 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 21:20:48,436 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:20:48,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:48,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1442275055, now seen corresponding path program 1 times [2019-12-26 21:20:48,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:48,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354837176] [2019-12-26 21:20:48,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:20:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:20:48,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354837176] [2019-12-26 21:20:48,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:20:48,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:20:48,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120882265] [2019-12-26 21:20:48,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:20:48,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:20:48,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:20:48,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:20:48,511 INFO L87 Difference]: Start difference. First operand 32932 states and 102559 transitions. Second operand 3 states. [2019-12-26 21:20:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:20:48,624 INFO L93 Difference]: Finished difference Result 32932 states and 102558 transitions. [2019-12-26 21:20:48,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:20:48,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 21:20:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:20:48,673 INFO L225 Difference]: With dead ends: 32932 [2019-12-26 21:20:48,673 INFO L226 Difference]: Without dead ends: 32932 [2019-12-26 21:20:48,674 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 21:20:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32932 states. [2019-12-26 21:20:49,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32932 to 21902. [2019-12-26 21:20:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21902 states. [2019-12-26 21:20:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21902 states to 21902 states and 68711 transitions. [2019-12-26 21:20:49,105 INFO L78 Accepts]: Start accepts. Automaton has 21902 states and 68711 transitions. Word has length 66 [2019-12-26 21:20:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:20:49,106 INFO L462 AbstractCegarLoop]: Abstraction has 21902 states and 68711 transitions. [2019-12-26 21:20:49,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:20:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand 21902 states and 68711 transitions. [2019-12-26 21:20:49,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:20:49,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:20:49,130 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 21:20:49,130 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:20:49,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:20:49,131 INFO L82 PathProgramCache]: Analyzing trace with hash 763340387, now seen corresponding path program 1 times [2019-12-26 21:20:49,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:20:49,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204013790] [2019-12-26 21:20:49,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:20:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:20:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:20:49,244 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:20:49,245 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:20:49,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~z$r_buff0_thd3~0_367) (= v_~z$r_buff0_thd0~0_147 0) (= v_~z$w_buff0_used~0_850 0) (= v_~z$w_buff0~0_393 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_322) (= v_~weak$$choice2~0_147 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t165~0.base_27|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd1~0_158 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t165~0.base_27| 4)) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_168 0) (= v_~z$w_buff1_used~0_568 0) (= v_~main$tmp_guard1~0_41 0) (= |v_ULTIMATE.start_main_~#t165~0.offset_17| 0) (= 0 v_~__unbuffered_p2_EAX~0_41) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_26) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~z$r_buff0_thd1~0_210 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t165~0.base_27| 1)) (= 0 v_~x~0_154) (= v_~z$r_buff0_thd2~0_129 0) (= 0 v_~__unbuffered_cnt~0_88) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t165~0.base_27| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t165~0.base_27|) |v_ULTIMATE.start_main_~#t165~0.offset_17| 0)) |v_#memory_int_19|) (= v_~z~0_181 0) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t165~0.base_27|)) (= v_~y~0_31 0) (= v_~z$r_buff1_thd0~0_191 0) (= v_~z$w_buff1~0_253 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_168, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_61|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_191|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ULTIMATE.start_main_~#t167~0.offset=|v_ULTIMATE.start_main_~#t167~0.offset_17|, ULTIMATE.start_main_~#t166~0.offset=|v_ULTIMATE.start_main_~#t166~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_568, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ULTIMATE.start_main_~#t165~0.base=|v_ULTIMATE.start_main_~#t165~0.base_27|, ~weak$$choice0~0=v_~weak$$choice0~0_13, ULTIMATE.start_main_~#t165~0.offset=|v_ULTIMATE.start_main_~#t165~0.offset_17|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t166~0.base=|v_ULTIMATE.start_main_~#t166~0.base_22|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_158, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_367, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~x~0=v_~x~0_154, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_253, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_39|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_191, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_129, ULTIMATE.start_main_~#t167~0.base=|v_ULTIMATE.start_main_~#t167~0.base_23|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_850, ~z$w_buff0~0=v_~z$w_buff0~0_393, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_322, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t167~0.offset, ULTIMATE.start_main_~#t166~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t165~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t165~0.offset, ULTIMATE.start_main_~#t166~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t167~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:20:49,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L830-1-->L832: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t166~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t166~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t166~0.base_11|) |v_ULTIMATE.start_main_~#t166~0.offset_9| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t166~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t166~0.base_11|) (= |v_ULTIMATE.start_main_~#t166~0.offset_9| 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t166~0.base_11| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t166~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t166~0.offset=|v_ULTIMATE.start_main_~#t166~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t166~0.base=|v_ULTIMATE.start_main_~#t166~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t166~0.offset, ULTIMATE.start_main_~#t166~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 21:20:49,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_13) (= 1 v_~x~0_6) (= v_~z$r_buff0_thd1~0_21 1) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_31) (= v_~z$r_buff0_thd1~0_22 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_31, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_13, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_21, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-26 21:20:49,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1364787640 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1364787640 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1364787640| ~z~0_In1364787640)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1364787640| ~z$w_buff1~0_In1364787640) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1364787640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1364787640, ~z$w_buff1~0=~z$w_buff1~0_In1364787640, ~z~0=~z~0_In1364787640} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1364787640|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1364787640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1364787640, ~z$w_buff1~0=~z$w_buff1~0_In1364787640, ~z~0=~z~0_In1364787640} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 21:20:49,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~z~0_27) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_17|, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-26 21:20:49,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1047831524 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1047831524 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1047831524|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1047831524 |P1Thread1of1ForFork2_#t~ite11_Out-1047831524|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1047831524, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1047831524} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1047831524, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1047831524|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1047831524} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:20:49,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In435440121 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In435440121 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In435440121 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In435440121 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out435440121| 0)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out435440121| ~z$w_buff1_used~0_In435440121) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In435440121, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In435440121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In435440121, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In435440121} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In435440121, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In435440121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In435440121, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out435440121|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In435440121} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 21:20:49,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t167~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t167~0.base_9| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t167~0.offset_8| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t167~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t167~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t167~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t167~0.base_9|) |v_ULTIMATE.start_main_~#t167~0.offset_8| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t167~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t167~0.offset=|v_ULTIMATE.start_main_~#t167~0.offset_8|, ULTIMATE.start_main_~#t167~0.base=|v_ULTIMATE.start_main_~#t167~0.base_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t167~0.offset, ULTIMATE.start_main_~#t167~0.base] because there is no mapped edge [2019-12-26 21:20:49,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2035653268 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out-2035653268| |P2Thread1of1ForFork0_#t~ite20_Out-2035653268|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-2035653268 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-2035653268 256) 0) .cse0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-2035653268 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-2035653268 256)))) .cse1 (= ~z$w_buff0~0_In-2035653268 |P2Thread1of1ForFork0_#t~ite20_Out-2035653268|)) (and (= |P2Thread1of1ForFork0_#t~ite20_In-2035653268| |P2Thread1of1ForFork0_#t~ite20_Out-2035653268|) (= ~z$w_buff0~0_In-2035653268 |P2Thread1of1ForFork0_#t~ite21_Out-2035653268|) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-2035653268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2035653268, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2035653268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2035653268, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2035653268, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-2035653268|, ~weak$$choice2~0=~weak$$choice2~0_In-2035653268} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-2035653268|, ~z$w_buff0~0=~z$w_buff0~0_In-2035653268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2035653268, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2035653268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2035653268, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2035653268, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-2035653268|, ~weak$$choice2~0=~weak$$choice2~0_In-2035653268} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-26 21:20:49,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-419523137 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-419523137 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-419523137| ~z$r_buff0_thd2~0_In-419523137) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-419523137| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-419523137, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-419523137} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-419523137, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-419523137|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-419523137} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 21:20:49,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1504945856 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-1504945856 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1504945856 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1504945856 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1504945856|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-1504945856 |P1Thread1of1ForFork2_#t~ite14_Out-1504945856|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1504945856, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1504945856, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1504945856, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1504945856} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1504945856, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1504945856, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1504945856, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1504945856|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1504945856} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:20:49,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L775-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P1Thread1of1ForFork2_#t~ite14_32| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:20:49,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1949103328 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out-1949103328| ~z$w_buff1~0_In-1949103328) (= |P2Thread1of1ForFork0_#t~ite23_Out-1949103328| |P2Thread1of1ForFork0_#t~ite24_Out-1949103328|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1949103328 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1949103328 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-1949103328 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-1949103328 256)) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In-1949103328| |P2Thread1of1ForFork0_#t~ite23_Out-1949103328|) (= ~z$w_buff1~0_In-1949103328 |P2Thread1of1ForFork0_#t~ite24_Out-1949103328|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1949103328, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1949103328, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1949103328|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1949103328, ~z$w_buff1~0=~z$w_buff1~0_In-1949103328, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1949103328, ~weak$$choice2~0=~weak$$choice2~0_In-1949103328} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1949103328, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1949103328|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1949103328, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1949103328|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1949103328, ~z$w_buff1~0=~z$w_buff1~0_In-1949103328, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1949103328, ~weak$$choice2~0=~weak$$choice2~0_In-1949103328} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-26 21:20:49,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In602505607 256)))) (or (and (not .cse0) (= ~z$w_buff0_used~0_In602505607 |P2Thread1of1ForFork0_#t~ite27_Out602505607|) (= |P2Thread1of1ForFork0_#t~ite26_In602505607| |P2Thread1of1ForFork0_#t~ite26_Out602505607|)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out602505607| |P2Thread1of1ForFork0_#t~ite26_Out602505607|) (= ~z$w_buff0_used~0_In602505607 |P2Thread1of1ForFork0_#t~ite26_Out602505607|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In602505607 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In602505607 256)) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In602505607 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In602505607 256))))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In602505607|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In602505607, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In602505607, ~z$w_buff1_used~0=~z$w_buff1_used~0_In602505607, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In602505607, ~weak$$choice2~0=~weak$$choice2~0_In602505607} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out602505607|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out602505607|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In602505607, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In602505607, ~z$w_buff1_used~0=~z$w_buff1_used~0_In602505607, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In602505607, ~weak$$choice2~0=~weak$$choice2~0_In602505607} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 21:20:49,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff0_thd3~0_66)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 21:20:49,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= v_~z~0_50 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 21:20:49,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1109477617 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1109477617 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out1109477617| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1109477617 |P0Thread1of1ForFork1_#t~ite5_Out1109477617|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1109477617, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1109477617} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1109477617|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1109477617, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1109477617} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 21:20:49,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1379770585 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1379770585 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1379770585| ~z~0_In-1379770585)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1379770585| ~z$w_buff1~0_In-1379770585)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1379770585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1379770585, ~z$w_buff1~0=~z$w_buff1~0_In-1379770585, ~z~0=~z~0_In-1379770585} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1379770585|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1379770585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1379770585, ~z$w_buff1~0=~z$w_buff1~0_In-1379770585, ~z~0=~z~0_In-1379770585} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:20:49,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1165329021 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-1165329021 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1165329021 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1165329021 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1165329021| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-1165329021| ~z$w_buff1_used~0_In-1165329021)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1165329021, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1165329021, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1165329021, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1165329021} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1165329021, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1165329021|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1165329021, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1165329021, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1165329021} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:20:49,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2095361101 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In2095361101 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out2095361101 0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out2095361101 ~z$r_buff0_thd1~0_In2095361101) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2095361101, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2095361101} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2095361101, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2095361101|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2095361101} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:20:49,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1753219574 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1753219574 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1753219574 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1753219574 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1753219574| ~z$r_buff1_thd1~0_In1753219574) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1753219574|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1753219574, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1753219574, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1753219574, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1753219574} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1753219574|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1753219574, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1753219574, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1753219574, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1753219574} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 21:20:49,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_31|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:20:49,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-26 21:20:49,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-84258984 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-84258984 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-84258984| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-84258984| ~z$w_buff0_used~0_In-84258984) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-84258984, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-84258984} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-84258984, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-84258984|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-84258984} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 21:20:49,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In2059304919 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2059304919 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In2059304919 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In2059304919 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out2059304919| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out2059304919| ~z$w_buff1_used~0_In2059304919)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2059304919, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2059304919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2059304919, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2059304919} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2059304919, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2059304919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2059304919, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2059304919, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out2059304919|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 21:20:49,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1757553567 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1757553567 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1757553567| ~z$r_buff0_thd3~0_In-1757553567) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1757553567|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1757553567, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1757553567} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1757553567, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1757553567, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1757553567|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:20:49,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1762619022 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1762619022 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1762619022 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1762619022 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1762619022|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In1762619022 |P2Thread1of1ForFork0_#t~ite43_Out1762619022|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1762619022, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1762619022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1762619022, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1762619022} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1762619022|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1762619022, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1762619022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1762619022, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1762619022} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 21:20:49,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_121 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_121, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:20:49,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:20:49,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In447338207 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In447338207 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite48_Out447338207| |ULTIMATE.start_main_#t~ite47_Out447338207|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite47_Out447338207| ~z$w_buff1~0_In447338207) (not .cse2)) (and (or .cse2 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out447338207| ~z~0_In447338207) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In447338207, ~z$w_buff1_used~0=~z$w_buff1_used~0_In447338207, ~z$w_buff1~0=~z$w_buff1~0_In447338207, ~z~0=~z~0_In447338207} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In447338207, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out447338207|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In447338207, ~z$w_buff1~0=~z$w_buff1~0_In447338207, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out447338207|, ~z~0=~z~0_In447338207} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 21:20:49,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2020110681 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2020110681 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out2020110681| ~z$w_buff0_used~0_In2020110681)) (and (= |ULTIMATE.start_main_#t~ite49_Out2020110681| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2020110681, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2020110681} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2020110681, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2020110681, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out2020110681|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:20:49,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-1699504903 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1699504903 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1699504903 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1699504903 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1699504903 |ULTIMATE.start_main_#t~ite50_Out-1699504903|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1699504903|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1699504903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1699504903, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1699504903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1699504903} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1699504903|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1699504903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1699504903, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1699504903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1699504903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:20:49,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1081346379 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1081346379 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1081346379|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In1081346379 |ULTIMATE.start_main_#t~ite51_Out1081346379|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1081346379, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1081346379} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1081346379, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1081346379|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1081346379} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:20:49,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In15692218 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In15692218 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In15692218 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In15692218 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out15692218|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite52_Out15692218| ~z$r_buff1_thd0~0_In15692218)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In15692218, ~z$w_buff0_used~0=~z$w_buff0_used~0_In15692218, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In15692218, ~z$w_buff1_used~0=~z$w_buff1_used~0_In15692218} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out15692218|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In15692218, ~z$w_buff0_used~0=~z$w_buff0_used~0_In15692218, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In15692218, ~z$w_buff1_used~0=~z$w_buff1_used~0_In15692218} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:20:49,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 2 v_~__unbuffered_p1_EAX~0_22) (= v_~x~0_65 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= v_~z$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~__unbuffered_p1_EBX~0_23 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:20:49,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:20:49 BasicIcfg [2019-12-26 21:20:49,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:20:49,359 INFO L168 Benchmark]: Toolchain (without parser) took 143106.50 ms. Allocated memory was 145.2 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 101.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-26 21:20:49,359 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 21:20:49,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.73 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.1 MB in the beginning and 155.5 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:20:49,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.20 ms. Allocated memory is still 201.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:20:49,361 INFO L168 Benchmark]: Boogie Preprocessor took 61.73 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:20:49,361 INFO L168 Benchmark]: RCFGBuilder took 1001.63 ms. Allocated memory is still 201.9 MB. Free memory was 150.3 MB in the beginning and 99.5 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:20:49,362 INFO L168 Benchmark]: TraceAbstraction took 141220.36 ms. Allocated memory was 201.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-26 21:20:49,364 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 750.73 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.1 MB in the beginning and 155.5 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.20 ms. Allocated memory is still 201.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.73 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1001.63 ms. Allocated memory is still 201.9 MB. Free memory was 150.3 MB in the beginning and 99.5 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 141220.36 ms. Allocated memory was 201.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7398 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 270 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 78628 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L773] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L774] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L807] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 140.9s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 51.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8939 SDtfs, 15293 SDslu, 26812 SDs, 0 SdLazy, 18807 SolverSat, 1072 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 570 GetRequests, 83 SyntacticMatches, 25 SemanticMatches, 462 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2853 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146095occurred 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: 60.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 998572 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1580 NumberOfCodeBlocks, 1580 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1480 ConstructedInterpolants, 0 QuantifiedInterpolants, 292347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...