/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:30:39,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:30:39,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:30:39,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:30:39,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:30:39,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:30:39,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:30:39,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:30:39,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:30:39,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:30:40,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:30:40,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:30:40,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:30:40,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:30:40,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:30:40,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:30:40,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:30:40,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:30:40,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:30:40,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:30:40,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:30:40,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:30:40,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:30:40,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:30:40,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:30:40,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:30:40,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:30:40,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:30:40,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:30:40,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:30:40,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:30:40,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:30:40,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:30:40,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:30:40,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:30:40,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:30:40,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:30:40,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:30:40,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:30:40,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:30:40,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:30:40,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:30:40,072 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:30:40,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:30:40,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:30:40,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:30:40,081 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:30:40,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:30:40,082 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:30:40,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:30:40,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:30:40,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:30:40,083 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:30:40,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:30:40,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:30:40,083 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:30:40,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:30:40,089 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:30:40,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:30:40,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:30:40,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:30:40,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:30:40,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:30:40,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:30:40,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:30:40,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:30:40,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:30:40,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:30:40,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:30:40,091 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:30:40,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:30:40,092 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:30:40,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:30:40,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:30:40,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:30:40,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:30:40,395 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:30:40,396 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:30:40,397 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i [2019-12-27 18:30:40,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe23203d6/842b5caff64e46b4ba99e3b264dec82c/FLAG64d428ba9 [2019-12-27 18:30:41,038 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:30:41,039 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i [2019-12-27 18:30:41,052 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe23203d6/842b5caff64e46b4ba99e3b264dec82c/FLAG64d428ba9 [2019-12-27 18:30:41,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe23203d6/842b5caff64e46b4ba99e3b264dec82c [2019-12-27 18:30:41,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:30:41,328 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:30:41,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:30:41,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:30:41,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:30:41,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:30:41" (1/1) ... [2019-12-27 18:30:41,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:41, skipping insertion in model container [2019-12-27 18:30:41,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:30:41" (1/1) ... [2019-12-27 18:30:41,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:30:41,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:30:41,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:30:41,905 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:30:41,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:30:42,074 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:30:42,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:42 WrapperNode [2019-12-27 18:30:42,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:30:42,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:30:42,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:30:42,076 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:30:42,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:42" (1/1) ... [2019-12-27 18:30:42,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:42" (1/1) ... [2019-12-27 18:30:42,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:30:42,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:30:42,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:30:42,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:30:42,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:42" (1/1) ... [2019-12-27 18:30:42,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:42" (1/1) ... [2019-12-27 18:30:42,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:42" (1/1) ... [2019-12-27 18:30:42,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:42" (1/1) ... [2019-12-27 18:30:42,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:42" (1/1) ... [2019-12-27 18:30:42,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:42" (1/1) ... [2019-12-27 18:30:42,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:42" (1/1) ... [2019-12-27 18:30:42,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:30:42,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:30:42,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:30:42,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:30:42,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:30:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:30:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:30:42,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:30:42,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:30:42,259 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:30:42,259 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:30:42,259 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:30:42,259 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:30:42,259 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:30:42,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:30:42,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:30:42,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:30:42,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:30:42,262 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:30:42,990 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:30:42,990 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:30:42,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:30:42 BoogieIcfgContainer [2019-12-27 18:30:42,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:30:42,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:30:42,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:30:43,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:30:43,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:30:41" (1/3) ... [2019-12-27 18:30:43,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fbb40f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:30:43, skipping insertion in model container [2019-12-27 18:30:43,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:42" (2/3) ... [2019-12-27 18:30:43,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fbb40f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:30:43, skipping insertion in model container [2019-12-27 18:30:43,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:30:42" (3/3) ... [2019-12-27 18:30:43,006 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_rmo.opt.i [2019-12-27 18:30:43,018 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:30:43,018 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:30:43,030 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:30:43,032 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:30:43,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,094 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,096 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,121 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,121 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,129 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,129 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,157 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,157 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,157 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,160 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,161 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,165 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:30:43,186 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:30:43,207 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:30:43,208 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:30:43,208 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:30:43,208 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:30:43,208 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:30:43,208 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:30:43,208 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:30:43,209 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:30:43,225 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 18:30:43,228 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 18:30:43,339 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 18:30:43,340 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:30:43,357 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:30:43,385 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 18:30:43,442 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 18:30:43,443 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:30:43,451 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:30:43,471 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 18:30:43,473 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:30:48,954 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 18:30:49,078 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:30:49,534 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-27 18:30:49,534 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 18:30:49,537 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-27 18:31:06,578 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-27 18:31:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-27 18:31:06,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:31:06,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:06,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:31:06,586 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:06,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:06,591 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-27 18:31:06,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:06,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958293853] [2019-12-27 18:31:06,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:06,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958293853] [2019-12-27 18:31:06,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:06,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:31:06,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1260542185] [2019-12-27 18:31:06,812 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:06,816 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:06,829 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:31:06,830 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:06,833 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:06,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:06,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:06,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:06,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:06,851 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-27 18:31:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:08,074 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-27 18:31:08,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:08,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:31:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:08,772 INFO L225 Difference]: With dead ends: 110910 [2019-12-27 18:31:08,773 INFO L226 Difference]: Without dead ends: 98066 [2019-12-27 18:31:08,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-27 18:31:17,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-27 18:31:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-27 18:31:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-27 18:31:21,839 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-27 18:31:21,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:21,839 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-27 18:31:21,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-27 18:31:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:31:21,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:21,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:21,849 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:21,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:21,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-27 18:31:21,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:21,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362529719] [2019-12-27 18:31:21,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:21,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362529719] [2019-12-27 18:31:21,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:21,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:31:21,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [67981332] [2019-12-27 18:31:21,956 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:21,957 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:21,961 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:31:21,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:21,961 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:21,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:31:21,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:21,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:31:21,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:31:21,963 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-27 18:31:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:23,038 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-27 18:31:23,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:31:23,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:31:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:28,161 INFO L225 Difference]: With dead ends: 156656 [2019-12-27 18:31:28,161 INFO L226 Difference]: Without dead ends: 156558 [2019-12-27 18:31:28,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:31:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-27 18:31:34,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-27 18:31:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-27 18:31:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-27 18:31:35,326 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-27 18:31:35,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:35,326 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-27 18:31:35,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:31:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-27 18:31:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:31:35,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:35,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:35,330 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:35,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:35,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-27 18:31:35,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:35,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588629338] [2019-12-27 18:31:35,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:35,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588629338] [2019-12-27 18:31:35,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:35,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:31:35,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1567806229] [2019-12-27 18:31:35,410 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:35,411 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:35,413 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:31:35,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:35,413 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:35,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:35,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:35,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:35,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:35,415 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-27 18:31:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:35,556 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-27 18:31:35,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:35,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:31:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:39,806 INFO L225 Difference]: With dead ends: 31386 [2019-12-27 18:31:39,807 INFO L226 Difference]: Without dead ends: 31386 [2019-12-27 18:31:39,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:40,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-27 18:31:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-27 18:31:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-27 18:31:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-27 18:31:40,434 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-27 18:31:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:40,434 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-27 18:31:40,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-27 18:31:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 18:31:40,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:40,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:40,439 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:40,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:40,439 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-27 18:31:40,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:40,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414229216] [2019-12-27 18:31:40,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:40,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414229216] [2019-12-27 18:31:40,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:40,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:31:40,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1584412953] [2019-12-27 18:31:40,543 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:40,546 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:40,548 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 18:31:40,549 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:40,549 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:40,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:31:40,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:40,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:31:40,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:31:40,550 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-27 18:31:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:40,958 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-27 18:31:40,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:31:40,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 18:31:40,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:41,052 INFO L225 Difference]: With dead ends: 43205 [2019-12-27 18:31:41,052 INFO L226 Difference]: Without dead ends: 43205 [2019-12-27 18:31:41,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:31:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-27 18:31:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-27 18:31:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-27 18:31:42,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-27 18:31:42,116 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-27 18:31:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:42,117 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-27 18:31:42,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:31:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-27 18:31:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:31:42,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:42,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:42,127 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:42,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:42,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-27 18:31:42,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:42,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066251968] [2019-12-27 18:31:42,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:42,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:42,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066251968] [2019-12-27 18:31:42,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:42,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:31:42,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [125212371] [2019-12-27 18:31:42,235 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:42,239 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:42,246 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 18:31:42,246 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:42,248 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:42,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:31:42,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:42,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:31:42,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:31:42,249 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-27 18:31:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:43,076 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-27 18:31:43,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:31:43,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:31:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:43,166 INFO L225 Difference]: With dead ends: 56051 [2019-12-27 18:31:43,166 INFO L226 Difference]: Without dead ends: 56037 [2019-12-27 18:31:43,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:31:43,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-27 18:31:43,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-27 18:31:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-27 18:31:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-27 18:31:43,877 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-27 18:31:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:43,877 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-27 18:31:43,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:31:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-27 18:31:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:31:43,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:43,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:43,892 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:43,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:43,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-27 18:31:43,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:43,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002641266] [2019-12-27 18:31:43,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:43,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002641266] [2019-12-27 18:31:43,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:43,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:31:43,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [294978078] [2019-12-27 18:31:43,957 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:43,960 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:43,970 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 18:31:43,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:44,012 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:31:44,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:31:44,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:44,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:31:44,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:31:44,014 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 5 states. [2019-12-27 18:31:44,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:44,098 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-27 18:31:44,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:31:44,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 18:31:44,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:44,119 INFO L225 Difference]: With dead ends: 15281 [2019-12-27 18:31:44,119 INFO L226 Difference]: Without dead ends: 15281 [2019-12-27 18:31:44,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:31:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-27 18:31:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-27 18:31:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-27 18:31:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-27 18:31:44,543 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-27 18:31:44,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:44,543 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-27 18:31:44,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:31:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-27 18:31:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 18:31:44,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:44,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:44,553 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:44,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:44,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-27 18:31:44,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:44,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199597900] [2019-12-27 18:31:44,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:44,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199597900] [2019-12-27 18:31:44,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:44,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:31:44,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1057618745] [2019-12-27 18:31:44,690 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:44,695 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:44,702 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 18:31:44,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:44,703 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:44,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:31:44,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:44,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:31:44,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:31:44,704 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-27 18:31:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:45,251 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-27 18:31:45,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:31:45,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 18:31:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:45,280 INFO L225 Difference]: With dead ends: 21679 [2019-12-27 18:31:45,281 INFO L226 Difference]: Without dead ends: 21679 [2019-12-27 18:31:45,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:31:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-27 18:31:45,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-27 18:31:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-27 18:31:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-27 18:31:45,547 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-27 18:31:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:45,547 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-27 18:31:45,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:31:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-27 18:31:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 18:31:45,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:45,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:45,565 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:45,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-27 18:31:45,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:45,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149290205] [2019-12-27 18:31:45,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:45,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149290205] [2019-12-27 18:31:45,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:45,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:31:45,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2090266570] [2019-12-27 18:31:45,669 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:45,675 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:45,690 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 71 transitions. [2019-12-27 18:31:45,690 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:45,690 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:45,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:31:45,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:45,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:31:45,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:31:45,691 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-27 18:31:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:46,824 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-27 18:31:46,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:31:46,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 18:31:46,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:46,868 INFO L225 Difference]: With dead ends: 24589 [2019-12-27 18:31:46,869 INFO L226 Difference]: Without dead ends: 24589 [2019-12-27 18:31:46,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:31:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-27 18:31:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-27 18:31:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-27 18:31:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-27 18:31:47,159 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-27 18:31:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:47,160 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-27 18:31:47,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:31:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-27 18:31:47,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 18:31:47,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:47,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:47,181 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:47,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:47,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-27 18:31:47,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:47,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221165703] [2019-12-27 18:31:47,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:47,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221165703] [2019-12-27 18:31:47,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:47,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:31:47,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [101298818] [2019-12-27 18:31:47,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:47,256 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:47,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 424 transitions. [2019-12-27 18:31:47,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:47,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:47,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:47,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:47,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:47,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:47,309 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 3 states. [2019-12-27 18:31:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:47,368 INFO L93 Difference]: Finished difference Result 16665 states and 50148 transitions. [2019-12-27 18:31:47,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:47,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 18:31:47,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:47,391 INFO L225 Difference]: With dead ends: 16665 [2019-12-27 18:31:47,391 INFO L226 Difference]: Without dead ends: 16665 [2019-12-27 18:31:47,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16665 states. [2019-12-27 18:31:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16665 to 16665. [2019-12-27 18:31:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16665 states. [2019-12-27 18:31:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16665 states to 16665 states and 50148 transitions. [2019-12-27 18:31:47,711 INFO L78 Accepts]: Start accepts. Automaton has 16665 states and 50148 transitions. Word has length 39 [2019-12-27 18:31:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:47,711 INFO L462 AbstractCegarLoop]: Abstraction has 16665 states and 50148 transitions. [2019-12-27 18:31:47,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 16665 states and 50148 transitions. [2019-12-27 18:31:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:31:47,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:47,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:47,731 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:47,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:47,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1450973103, now seen corresponding path program 1 times [2019-12-27 18:31:47,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:47,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193403975] [2019-12-27 18:31:47,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:47,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193403975] [2019-12-27 18:31:47,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:47,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:31:47,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1790503078] [2019-12-27 18:31:47,796 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:47,805 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:47,847 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 198 transitions. [2019-12-27 18:31:47,847 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:47,870 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:31:47,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:31:47,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:47,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:31:47,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:31:47,872 INFO L87 Difference]: Start difference. First operand 16665 states and 50148 transitions. Second operand 4 states. [2019-12-27 18:31:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:48,022 INFO L93 Difference]: Finished difference Result 31503 states and 94864 transitions. [2019-12-27 18:31:48,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:31:48,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 18:31:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:48,058 INFO L225 Difference]: With dead ends: 31503 [2019-12-27 18:31:48,058 INFO L226 Difference]: Without dead ends: 16332 [2019-12-27 18:31:48,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:31:48,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16332 states. [2019-12-27 18:31:48,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16332 to 16328. [2019-12-27 18:31:48,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16328 states. [2019-12-27 18:31:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 48458 transitions. [2019-12-27 18:31:48,386 INFO L78 Accepts]: Start accepts. Automaton has 16328 states and 48458 transitions. Word has length 40 [2019-12-27 18:31:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:48,386 INFO L462 AbstractCegarLoop]: Abstraction has 16328 states and 48458 transitions. [2019-12-27 18:31:48,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:31:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 16328 states and 48458 transitions. [2019-12-27 18:31:48,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:31:48,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:48,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:48,404 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:48,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:48,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1753570543, now seen corresponding path program 2 times [2019-12-27 18:31:48,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:48,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594881204] [2019-12-27 18:31:48,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:48,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594881204] [2019-12-27 18:31:48,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:48,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:31:48,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1465464367] [2019-12-27 18:31:48,486 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:48,494 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:48,555 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 324 transitions. [2019-12-27 18:31:48,556 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:48,719 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 18:31:48,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:31:48,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:48,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:31:48,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:31:48,720 INFO L87 Difference]: Start difference. First operand 16328 states and 48458 transitions. Second operand 11 states. [2019-12-27 18:31:50,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:50,025 INFO L93 Difference]: Finished difference Result 22499 states and 66522 transitions. [2019-12-27 18:31:50,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:31:50,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-12-27 18:31:50,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:50,057 INFO L225 Difference]: With dead ends: 22499 [2019-12-27 18:31:50,057 INFO L226 Difference]: Without dead ends: 22499 [2019-12-27 18:31:50,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:31:50,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22499 states. [2019-12-27 18:31:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22499 to 21006. [2019-12-27 18:31:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21006 states. [2019-12-27 18:31:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21006 states to 21006 states and 62454 transitions. [2019-12-27 18:31:50,371 INFO L78 Accepts]: Start accepts. Automaton has 21006 states and 62454 transitions. Word has length 40 [2019-12-27 18:31:50,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:50,371 INFO L462 AbstractCegarLoop]: Abstraction has 21006 states and 62454 transitions. [2019-12-27 18:31:50,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:31:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 21006 states and 62454 transitions. [2019-12-27 18:31:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:31:50,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:50,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:50,391 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:50,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:50,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1960596885, now seen corresponding path program 3 times [2019-12-27 18:31:50,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:50,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769121603] [2019-12-27 18:31:50,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:50,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769121603] [2019-12-27 18:31:50,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:50,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:31:50,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [591565313] [2019-12-27 18:31:50,467 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:50,477 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:50,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 365 transitions. [2019-12-27 18:31:50,558 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:50,716 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-27 18:31:50,732 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:31:50,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:31:50,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:50,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:31:50,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:31:50,733 INFO L87 Difference]: Start difference. First operand 21006 states and 62454 transitions. Second operand 7 states. [2019-12-27 18:31:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:50,843 INFO L93 Difference]: Finished difference Result 19781 states and 59627 transitions. [2019-12-27 18:31:50,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:31:50,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 18:31:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:50,879 INFO L225 Difference]: With dead ends: 19781 [2019-12-27 18:31:50,879 INFO L226 Difference]: Without dead ends: 19287 [2019-12-27 18:31:50,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:31:50,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19287 states. [2019-12-27 18:31:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19287 to 18447. [2019-12-27 18:31:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18447 states. [2019-12-27 18:31:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 56396 transitions. [2019-12-27 18:31:51,168 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 56396 transitions. Word has length 40 [2019-12-27 18:31:51,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:51,168 INFO L462 AbstractCegarLoop]: Abstraction has 18447 states and 56396 transitions. [2019-12-27 18:31:51,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:31:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 56396 transitions. [2019-12-27 18:31:51,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 18:31:51,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:51,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:51,190 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:51,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:51,191 INFO L82 PathProgramCache]: Analyzing trace with hash -48564843, now seen corresponding path program 1 times [2019-12-27 18:31:51,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:51,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695609191] [2019-12-27 18:31:51,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:51,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695609191] [2019-12-27 18:31:51,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:51,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:31:51,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [556574223] [2019-12-27 18:31:51,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:51,264 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:51,519 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 440 transitions. [2019-12-27 18:31:51,520 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:51,539 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:31:51,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:51,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:51,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:51,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:51,540 INFO L87 Difference]: Start difference. First operand 18447 states and 56396 transitions. Second operand 3 states. [2019-12-27 18:31:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:51,658 INFO L93 Difference]: Finished difference Result 27408 states and 83933 transitions. [2019-12-27 18:31:51,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:51,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 18:31:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:51,698 INFO L225 Difference]: With dead ends: 27408 [2019-12-27 18:31:51,698 INFO L226 Difference]: Without dead ends: 27408 [2019-12-27 18:31:51,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:51,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27408 states. [2019-12-27 18:31:52,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27408 to 20833. [2019-12-27 18:31:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2019-12-27 18:31:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 64483 transitions. [2019-12-27 18:31:52,071 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 64483 transitions. Word has length 64 [2019-12-27 18:31:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:52,071 INFO L462 AbstractCegarLoop]: Abstraction has 20833 states and 64483 transitions. [2019-12-27 18:31:52,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 64483 transitions. [2019-12-27 18:31:52,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 18:31:52,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:52,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:52,100 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:52,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:52,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 1 times [2019-12-27 18:31:52,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:52,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518044225] [2019-12-27 18:31:52,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:52,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518044225] [2019-12-27 18:31:52,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:52,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:31:52,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2140274262] [2019-12-27 18:31:52,209 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:52,230 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:52,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 440 transitions. [2019-12-27 18:31:52,633 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:52,784 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:31:52,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:31:52,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:52,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:31:52,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:31:52,785 INFO L87 Difference]: Start difference. First operand 20833 states and 64483 transitions. Second operand 11 states. [2019-12-27 18:31:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:53,505 INFO L93 Difference]: Finished difference Result 61323 states and 187457 transitions. [2019-12-27 18:31:53,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:31:53,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 18:31:53,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:53,564 INFO L225 Difference]: With dead ends: 61323 [2019-12-27 18:31:53,564 INFO L226 Difference]: Without dead ends: 42147 [2019-12-27 18:31:53,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:31:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42147 states. [2019-12-27 18:31:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42147 to 23713. [2019-12-27 18:31:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23713 states. [2019-12-27 18:31:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23713 states to 23713 states and 73274 transitions. [2019-12-27 18:31:54,049 INFO L78 Accepts]: Start accepts. Automaton has 23713 states and 73274 transitions. Word has length 64 [2019-12-27 18:31:54,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:54,049 INFO L462 AbstractCegarLoop]: Abstraction has 23713 states and 73274 transitions. [2019-12-27 18:31:54,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:31:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 23713 states and 73274 transitions. [2019-12-27 18:31:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 18:31:54,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:54,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:54,076 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:54,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 2 times [2019-12-27 18:31:54,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:54,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301714359] [2019-12-27 18:31:54,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:54,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301714359] [2019-12-27 18:31:54,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:54,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:31:54,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [775735940] [2019-12-27 18:31:54,176 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:54,225 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:54,445 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 467 transitions. [2019-12-27 18:31:54,446 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:54,562 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 18:31:54,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:31:54,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:54,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:31:54,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:31:54,563 INFO L87 Difference]: Start difference. First operand 23713 states and 73274 transitions. Second operand 10 states. [2019-12-27 18:31:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:56,180 INFO L93 Difference]: Finished difference Result 128757 states and 391175 transitions. [2019-12-27 18:31:56,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 18:31:56,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 18:31:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:56,336 INFO L225 Difference]: With dead ends: 128757 [2019-12-27 18:31:56,336 INFO L226 Difference]: Without dead ends: 99708 [2019-12-27 18:31:56,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:31:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99708 states. [2019-12-27 18:31:57,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99708 to 27716. [2019-12-27 18:31:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27716 states. [2019-12-27 18:31:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27716 states to 27716 states and 86140 transitions. [2019-12-27 18:31:57,233 INFO L78 Accepts]: Start accepts. Automaton has 27716 states and 86140 transitions. Word has length 64 [2019-12-27 18:31:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:57,234 INFO L462 AbstractCegarLoop]: Abstraction has 27716 states and 86140 transitions. [2019-12-27 18:31:57,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:31:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 27716 states and 86140 transitions. [2019-12-27 18:31:57,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 18:31:57,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:57,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:57,262 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:57,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:57,263 INFO L82 PathProgramCache]: Analyzing trace with hash -317627445, now seen corresponding path program 3 times [2019-12-27 18:31:57,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:57,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354077194] [2019-12-27 18:31:57,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:57,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354077194] [2019-12-27 18:31:57,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:57,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:31:57,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1225679992] [2019-12-27 18:31:57,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:57,371 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:57,741 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 242 states and 444 transitions. [2019-12-27 18:31:57,741 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:57,878 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:31:57,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:31:57,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:57,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:31:57,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:31:57,880 INFO L87 Difference]: Start difference. First operand 27716 states and 86140 transitions. Second operand 11 states. [2019-12-27 18:31:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:59,886 INFO L93 Difference]: Finished difference Result 79547 states and 242842 transitions. [2019-12-27 18:31:59,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:31:59,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 18:31:59,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:00,065 INFO L225 Difference]: With dead ends: 79547 [2019-12-27 18:32:00,065 INFO L226 Difference]: Without dead ends: 70269 [2019-12-27 18:32:00,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:32:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70269 states. [2019-12-27 18:32:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70269 to 28024. [2019-12-27 18:32:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28024 states. [2019-12-27 18:32:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 87091 transitions. [2019-12-27 18:32:01,178 INFO L78 Accepts]: Start accepts. Automaton has 28024 states and 87091 transitions. Word has length 64 [2019-12-27 18:32:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:01,178 INFO L462 AbstractCegarLoop]: Abstraction has 28024 states and 87091 transitions. [2019-12-27 18:32:01,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:32:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 28024 states and 87091 transitions. [2019-12-27 18:32:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 18:32:01,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:01,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:01,207 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:01,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:01,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 4 times [2019-12-27 18:32:01,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:01,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961415552] [2019-12-27 18:32:01,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:01,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961415552] [2019-12-27 18:32:01,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:01,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:32:01,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1415077527] [2019-12-27 18:32:01,278 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:01,296 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:01,773 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 307 transitions. [2019-12-27 18:32:01,774 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:01,774 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:32:01,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:32:01,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:01,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:32:01,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:32:01,776 INFO L87 Difference]: Start difference. First operand 28024 states and 87091 transitions. Second operand 3 states. [2019-12-27 18:32:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:02,025 INFO L93 Difference]: Finished difference Result 33789 states and 104171 transitions. [2019-12-27 18:32:02,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:32:02,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 18:32:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:02,093 INFO L225 Difference]: With dead ends: 33789 [2019-12-27 18:32:02,094 INFO L226 Difference]: Without dead ends: 33789 [2019-12-27 18:32:02,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:32:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33789 states. [2019-12-27 18:32:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33789 to 29603. [2019-12-27 18:32:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29603 states. [2019-12-27 18:32:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29603 states to 29603 states and 91943 transitions. [2019-12-27 18:32:02,626 INFO L78 Accepts]: Start accepts. Automaton has 29603 states and 91943 transitions. Word has length 64 [2019-12-27 18:32:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:02,626 INFO L462 AbstractCegarLoop]: Abstraction has 29603 states and 91943 transitions. [2019-12-27 18:32:02,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:32:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 29603 states and 91943 transitions. [2019-12-27 18:32:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:32:02,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32: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, 1] [2019-12-27 18:32:02,659 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:02,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:02,659 INFO L82 PathProgramCache]: Analyzing trace with hash -181535548, now seen corresponding path program 1 times [2019-12-27 18:32:02,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:02,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366779705] [2019-12-27 18:32:02,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:02,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366779705] [2019-12-27 18:32:02,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:02,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:32:02,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [69337038] [2019-12-27 18:32:02,709 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:02,729 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:03,084 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 592 transitions. [2019-12-27 18:32:03,085 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:03,092 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:32:03,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:32:03,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:03,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:32:03,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:32:03,093 INFO L87 Difference]: Start difference. First operand 29603 states and 91943 transitions. Second operand 4 states. [2019-12-27 18:32:03,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:03,434 INFO L93 Difference]: Finished difference Result 45817 states and 143094 transitions. [2019-12-27 18:32:03,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:32:03,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 18:32:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:03,501 INFO L225 Difference]: With dead ends: 45817 [2019-12-27 18:32:03,501 INFO L226 Difference]: Without dead ends: 45817 [2019-12-27 18:32:03,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:32:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45817 states. [2019-12-27 18:32:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45817 to 31959. [2019-12-27 18:32:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31959 states. [2019-12-27 18:32:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31959 states to 31959 states and 100397 transitions. [2019-12-27 18:32:04,285 INFO L78 Accepts]: Start accepts. Automaton has 31959 states and 100397 transitions. Word has length 65 [2019-12-27 18:32:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:04,285 INFO L462 AbstractCegarLoop]: Abstraction has 31959 states and 100397 transitions. [2019-12-27 18:32:04,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:32:04,285 INFO L276 IsEmpty]: Start isEmpty. Operand 31959 states and 100397 transitions. [2019-12-27 18:32:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:32:04,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:04,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:04,319 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:04,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:04,319 INFO L82 PathProgramCache]: Analyzing trace with hash -701292531, now seen corresponding path program 1 times [2019-12-27 18:32:04,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:04,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037750037] [2019-12-27 18:32:04,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:04,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037750037] [2019-12-27 18:32:04,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:04,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:32:04,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1744927799] [2019-12-27 18:32:04,388 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:04,408 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:04,599 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 470 transitions. [2019-12-27 18:32:04,599 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:04,798 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 18:32:04,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:32:04,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:04,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:32:04,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:32:04,799 INFO L87 Difference]: Start difference. First operand 31959 states and 100397 transitions. Second operand 12 states. [2019-12-27 18:32:07,040 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-12-27 18:32:07,733 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-12-27 18:32:08,787 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-27 18:32:09,097 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-27 18:32:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:10,445 INFO L93 Difference]: Finished difference Result 176351 states and 542548 transitions. [2019-12-27 18:32:10,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 18:32:10,446 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 18:32:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:10,664 INFO L225 Difference]: With dead ends: 176351 [2019-12-27 18:32:10,664 INFO L226 Difference]: Without dead ends: 135201 [2019-12-27 18:32:10,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=583, Invalid=2173, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 18:32:10,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135201 states. [2019-12-27 18:32:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135201 to 36528. [2019-12-27 18:32:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36528 states. [2019-12-27 18:32:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36528 states to 36528 states and 115782 transitions. [2019-12-27 18:32:11,870 INFO L78 Accepts]: Start accepts. Automaton has 36528 states and 115782 transitions. Word has length 65 [2019-12-27 18:32:11,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:11,870 INFO L462 AbstractCegarLoop]: Abstraction has 36528 states and 115782 transitions. [2019-12-27 18:32:11,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:32:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 36528 states and 115782 transitions. [2019-12-27 18:32:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:32:11,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:11,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:11,909 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:11,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:11,910 INFO L82 PathProgramCache]: Analyzing trace with hash -152741241, now seen corresponding path program 1 times [2019-12-27 18:32:11,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:11,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84405962] [2019-12-27 18:32:11,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:11,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84405962] [2019-12-27 18:32:11,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:11,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:32:11,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [752618266] [2019-12-27 18:32:11,956 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:11,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:12,377 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 309 transitions. [2019-12-27 18:32:12,377 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:12,378 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:32:12,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:32:12,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:12,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:32:12,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:32:12,379 INFO L87 Difference]: Start difference. First operand 36528 states and 115782 transitions. Second operand 3 states. [2019-12-27 18:32:12,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:12,638 INFO L93 Difference]: Finished difference Result 48794 states and 153716 transitions. [2019-12-27 18:32:12,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:32:12,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:32:12,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:12,711 INFO L225 Difference]: With dead ends: 48794 [2019-12-27 18:32:12,712 INFO L226 Difference]: Without dead ends: 48794 [2019-12-27 18:32:12,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:32:12,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48794 states. [2019-12-27 18:32:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48794 to 36605. [2019-12-27 18:32:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36605 states. [2019-12-27 18:32:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36605 states to 36605 states and 116125 transitions. [2019-12-27 18:32:13,330 INFO L78 Accepts]: Start accepts. Automaton has 36605 states and 116125 transitions. Word has length 65 [2019-12-27 18:32:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:13,330 INFO L462 AbstractCegarLoop]: Abstraction has 36605 states and 116125 transitions. [2019-12-27 18:32:13,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:32:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 36605 states and 116125 transitions. [2019-12-27 18:32:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:32:13,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:13,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:13,369 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:13,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:13,370 INFO L82 PathProgramCache]: Analyzing trace with hash -422803263, now seen corresponding path program 2 times [2019-12-27 18:32:13,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:13,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448760889] [2019-12-27 18:32:13,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:13,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448760889] [2019-12-27 18:32:13,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:13,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:32:13,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [396138394] [2019-12-27 18:32:13,472 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:13,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:13,691 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 332 transitions. [2019-12-27 18:32:13,691 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:13,825 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:32:13,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:32:13,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:13,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:32:13,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:32:13,826 INFO L87 Difference]: Start difference. First operand 36605 states and 116125 transitions. Second operand 12 states. [2019-12-27 18:32:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:16,649 INFO L93 Difference]: Finished difference Result 93704 states and 292312 transitions. [2019-12-27 18:32:16,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 18:32:16,649 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 18:32:16,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:16,796 INFO L225 Difference]: With dead ends: 93704 [2019-12-27 18:32:16,796 INFO L226 Difference]: Without dead ends: 93704 [2019-12-27 18:32:16,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 18:32:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93704 states. [2019-12-27 18:32:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93704 to 39400. [2019-12-27 18:32:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39400 states. [2019-12-27 18:32:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39400 states to 39400 states and 124815 transitions. [2019-12-27 18:32:17,809 INFO L78 Accepts]: Start accepts. Automaton has 39400 states and 124815 transitions. Word has length 65 [2019-12-27 18:32:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:17,810 INFO L462 AbstractCegarLoop]: Abstraction has 39400 states and 124815 transitions. [2019-12-27 18:32:17,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:32:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 39400 states and 124815 transitions. [2019-12-27 18:32:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:32:17,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:17,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:17,857 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:17,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash 148182117, now seen corresponding path program 1 times [2019-12-27 18:32:17,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:17,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457707791] [2019-12-27 18:32:17,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:17,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457707791] [2019-12-27 18:32:17,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:17,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:32:17,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1425339613] [2019-12-27 18:32:17,929 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:17,948 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:18,148 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 273 transitions. [2019-12-27 18:32:18,148 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:18,199 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:32:18,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:32:18,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:18,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:32:18,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:32:18,200 INFO L87 Difference]: Start difference. First operand 39400 states and 124815 transitions. Second operand 5 states. [2019-12-27 18:32:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:19,192 INFO L93 Difference]: Finished difference Result 58405 states and 180549 transitions. [2019-12-27 18:32:19,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:32:19,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 18:32:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:19,712 INFO L225 Difference]: With dead ends: 58405 [2019-12-27 18:32:19,713 INFO L226 Difference]: Without dead ends: 58185 [2019-12-27 18:32:19,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:32:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58185 states. [2019-12-27 18:32:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58185 to 45891. [2019-12-27 18:32:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45891 states. [2019-12-27 18:32:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45891 states to 45891 states and 144960 transitions. [2019-12-27 18:32:20,448 INFO L78 Accepts]: Start accepts. Automaton has 45891 states and 144960 transitions. Word has length 65 [2019-12-27 18:32:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:20,448 INFO L462 AbstractCegarLoop]: Abstraction has 45891 states and 144960 transitions. [2019-12-27 18:32:20,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:32:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 45891 states and 144960 transitions. [2019-12-27 18:32:20,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:32:20,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:20,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:20,505 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:20,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:20,506 INFO L82 PathProgramCache]: Analyzing trace with hash -272998531, now seen corresponding path program 2 times [2019-12-27 18:32:20,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:20,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726071290] [2019-12-27 18:32:20,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:20,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726071290] [2019-12-27 18:32:20,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:20,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:32:20,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [254061135] [2019-12-27 18:32:20,651 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:20,671 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:20,883 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 304 transitions. [2019-12-27 18:32:20,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:20,984 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:32:20,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:32:20,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:20,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:32:20,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:32:20,985 INFO L87 Difference]: Start difference. First operand 45891 states and 144960 transitions. Second operand 12 states. [2019-12-27 18:32:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:23,602 INFO L93 Difference]: Finished difference Result 79225 states and 243636 transitions. [2019-12-27 18:32:23,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 18:32:23,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 18:32:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:23,726 INFO L225 Difference]: With dead ends: 79225 [2019-12-27 18:32:23,726 INFO L226 Difference]: Without dead ends: 79106 [2019-12-27 18:32:23,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:32:23,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79106 states. [2019-12-27 18:32:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79106 to 45742. [2019-12-27 18:32:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45742 states. [2019-12-27 18:32:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45742 states to 45742 states and 143343 transitions. [2019-12-27 18:32:24,990 INFO L78 Accepts]: Start accepts. Automaton has 45742 states and 143343 transitions. Word has length 65 [2019-12-27 18:32:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:24,991 INFO L462 AbstractCegarLoop]: Abstraction has 45742 states and 143343 transitions. [2019-12-27 18:32:24,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:32:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 45742 states and 143343 transitions. [2019-12-27 18:32:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:32:25,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:25,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:25,040 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:25,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:25,041 INFO L82 PathProgramCache]: Analyzing trace with hash 312846933, now seen corresponding path program 3 times [2019-12-27 18:32:25,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:25,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209432349] [2019-12-27 18:32:25,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:25,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209432349] [2019-12-27 18:32:25,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:25,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:32:25,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [655632261] [2019-12-27 18:32:25,222 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:25,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:25,405 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 232 transitions. [2019-12-27 18:32:25,405 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:25,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:32:25,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:32:25,638 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 18:32:25,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:32:25,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:25,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:32:25,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:32:25,640 INFO L87 Difference]: Start difference. First operand 45742 states and 143343 transitions. Second operand 17 states. [2019-12-27 18:32:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:37,250 INFO L93 Difference]: Finished difference Result 85074 states and 260501 transitions. [2019-12-27 18:32:37,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-12-27 18:32:37,251 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2019-12-27 18:32:37,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:37,388 INFO L225 Difference]: With dead ends: 85074 [2019-12-27 18:32:37,388 INFO L226 Difference]: Without dead ends: 84750 [2019-12-27 18:32:37,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4378 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1687, Invalid=9869, Unknown=0, NotChecked=0, Total=11556 [2019-12-27 18:32:37,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84750 states. [2019-12-27 18:32:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84750 to 47712. [2019-12-27 18:32:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47712 states. [2019-12-27 18:32:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47712 states to 47712 states and 149332 transitions. [2019-12-27 18:32:38,903 INFO L78 Accepts]: Start accepts. Automaton has 47712 states and 149332 transitions. Word has length 65 [2019-12-27 18:32:38,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:38,903 INFO L462 AbstractCegarLoop]: Abstraction has 47712 states and 149332 transitions. [2019-12-27 18:32:38,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:32:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 47712 states and 149332 transitions. [2019-12-27 18:32:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:32:38,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:38,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:38,957 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:38,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:38,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1178106421, now seen corresponding path program 4 times [2019-12-27 18:32:38,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:38,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139297294] [2019-12-27 18:32:38,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:39,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139297294] [2019-12-27 18:32:39,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:39,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:32:39,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1690139557] [2019-12-27 18:32:39,026 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:39,040 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:39,203 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 253 transitions. [2019-12-27 18:32:39,203 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:39,204 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:32:39,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:32:39,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:39,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:32:39,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:32:39,205 INFO L87 Difference]: Start difference. First operand 47712 states and 149332 transitions. Second operand 3 states. [2019-12-27 18:32:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:39,351 INFO L93 Difference]: Finished difference Result 47712 states and 149331 transitions. [2019-12-27 18:32:39,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:32:39,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:32:39,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:39,425 INFO L225 Difference]: With dead ends: 47712 [2019-12-27 18:32:39,425 INFO L226 Difference]: Without dead ends: 47712 [2019-12-27 18:32:39,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:32:39,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47712 states. [2019-12-27 18:32:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47712 to 40507. [2019-12-27 18:32:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40507 states. [2019-12-27 18:32:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40507 states to 40507 states and 129097 transitions. [2019-12-27 18:32:40,118 INFO L78 Accepts]: Start accepts. Automaton has 40507 states and 129097 transitions. Word has length 65 [2019-12-27 18:32:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:40,118 INFO L462 AbstractCegarLoop]: Abstraction has 40507 states and 129097 transitions. [2019-12-27 18:32:40,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:32:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 40507 states and 129097 transitions. [2019-12-27 18:32:40,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:32:40,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:40,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:40,164 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:40,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:40,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1560089001, now seen corresponding path program 1 times [2019-12-27 18:32:40,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:40,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503195689] [2019-12-27 18:32:40,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:40,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503195689] [2019-12-27 18:32:40,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:40,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:32:40,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [871636131] [2019-12-27 18:32:40,325 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:40,338 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:40,524 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 274 transitions. [2019-12-27 18:32:40,524 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:40,749 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 18:32:40,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:32:40,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:40,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:32:40,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:32:40,750 INFO L87 Difference]: Start difference. First operand 40507 states and 129097 transitions. Second operand 14 states. [2019-12-27 18:32:43,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:43,932 INFO L93 Difference]: Finished difference Result 64937 states and 202487 transitions. [2019-12-27 18:32:43,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 18:32:43,932 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 18:32:43,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:44,035 INFO L225 Difference]: With dead ends: 64937 [2019-12-27 18:32:44,035 INFO L226 Difference]: Without dead ends: 64937 [2019-12-27 18:32:44,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:32:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64937 states. [2019-12-27 18:32:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64937 to 40761. [2019-12-27 18:32:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40761 states. [2019-12-27 18:32:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40761 states to 40761 states and 130040 transitions. [2019-12-27 18:32:44,880 INFO L78 Accepts]: Start accepts. Automaton has 40761 states and 130040 transitions. Word has length 66 [2019-12-27 18:32:44,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:44,880 INFO L462 AbstractCegarLoop]: Abstraction has 40761 states and 130040 transitions. [2019-12-27 18:32:44,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:32:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 40761 states and 130040 transitions. [2019-12-27 18:32:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:32:44,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:44,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:44,925 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:44,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:44,925 INFO L82 PathProgramCache]: Analyzing trace with hash -353775189, now seen corresponding path program 2 times [2019-12-27 18:32:44,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:44,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280372193] [2019-12-27 18:32:44,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:44,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280372193] [2019-12-27 18:32:44,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:44,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:32:44,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2065279332] [2019-12-27 18:32:44,986 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:44,999 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:45,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 266 transitions. [2019-12-27 18:32:45,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:45,182 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:32:45,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:32:45,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:45,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:32:45,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:32:45,183 INFO L87 Difference]: Start difference. First operand 40761 states and 130040 transitions. Second operand 3 states. [2019-12-27 18:32:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:45,295 INFO L93 Difference]: Finished difference Result 34116 states and 106368 transitions. [2019-12-27 18:32:45,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:32:45,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 18:32:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:45,344 INFO L225 Difference]: With dead ends: 34116 [2019-12-27 18:32:45,344 INFO L226 Difference]: Without dead ends: 34116 [2019-12-27 18:32:45,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:32:45,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34116 states. [2019-12-27 18:32:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34116 to 32565. [2019-12-27 18:32:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32565 states. [2019-12-27 18:32:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32565 states to 32565 states and 101402 transitions. [2019-12-27 18:32:46,104 INFO L78 Accepts]: Start accepts. Automaton has 32565 states and 101402 transitions. Word has length 66 [2019-12-27 18:32:46,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:46,104 INFO L462 AbstractCegarLoop]: Abstraction has 32565 states and 101402 transitions. [2019-12-27 18:32:46,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:32:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 32565 states and 101402 transitions. [2019-12-27 18:32:46,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:32:46,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:46,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:46,138 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:46,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:46,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2087745019, now seen corresponding path program 1 times [2019-12-27 18:32:46,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:46,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078315557] [2019-12-27 18:32:46,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:46,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078315557] [2019-12-27 18:32:46,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:46,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:32:46,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [928799576] [2019-12-27 18:32:46,195 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:46,209 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:46,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 315 states and 643 transitions. [2019-12-27 18:32:46,619 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:46,629 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:32:46,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:32:46,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:46,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:32:46,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:32:46,630 INFO L87 Difference]: Start difference. First operand 32565 states and 101402 transitions. Second operand 4 states. [2019-12-27 18:32:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:46,834 INFO L93 Difference]: Finished difference Result 32565 states and 101150 transitions. [2019-12-27 18:32:46,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:32:46,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 18:32:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:46,897 INFO L225 Difference]: With dead ends: 32565 [2019-12-27 18:32:46,897 INFO L226 Difference]: Without dead ends: 32565 [2019-12-27 18:32:46,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:32:46,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32565 states. [2019-12-27 18:32:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32565 to 26896. [2019-12-27 18:32:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26896 states. [2019-12-27 18:32:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26896 states to 26896 states and 83523 transitions. [2019-12-27 18:32:47,375 INFO L78 Accepts]: Start accepts. Automaton has 26896 states and 83523 transitions. Word has length 67 [2019-12-27 18:32:47,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:47,375 INFO L462 AbstractCegarLoop]: Abstraction has 26896 states and 83523 transitions. [2019-12-27 18:32:47,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:32:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 26896 states and 83523 transitions. [2019-12-27 18:32:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:32:47,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:47,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:47,405 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:47,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:47,405 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 1 times [2019-12-27 18:32:47,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:47,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700417760] [2019-12-27 18:32:47,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:47,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700417760] [2019-12-27 18:32:47,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:47,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:32:47,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [154625902] [2019-12-27 18:32:47,576 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:47,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:47,839 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 335 states and 690 transitions. [2019-12-27 18:32:47,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:48,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:32:48,299 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 18:32:48,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 18:32:48,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:48,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 18:32:48,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:32:48,301 INFO L87 Difference]: Start difference. First operand 26896 states and 83523 transitions. Second operand 20 states. [2019-12-27 18:32:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:56,716 INFO L93 Difference]: Finished difference Result 101484 states and 310446 transitions. [2019-12-27 18:32:56,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-12-27 18:32:56,717 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-27 18:32:56,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:56,837 INFO L225 Difference]: With dead ends: 101484 [2019-12-27 18:32:56,837 INFO L226 Difference]: Without dead ends: 76044 [2019-12-27 18:32:56,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5125 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2343, Invalid=12177, Unknown=0, NotChecked=0, Total=14520 [2019-12-27 18:32:57,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76044 states. [2019-12-27 18:32:57,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76044 to 28557. [2019-12-27 18:32:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28557 states. [2019-12-27 18:32:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28557 states to 28557 states and 87822 transitions. [2019-12-27 18:32:57,591 INFO L78 Accepts]: Start accepts. Automaton has 28557 states and 87822 transitions. Word has length 67 [2019-12-27 18:32:57,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:57,591 INFO L462 AbstractCegarLoop]: Abstraction has 28557 states and 87822 transitions. [2019-12-27 18:32:57,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 18:32:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 28557 states and 87822 transitions. [2019-12-27 18:32:57,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:32:57,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:57,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:57,620 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:57,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:57,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 2 times [2019-12-27 18:32:57,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:57,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942925788] [2019-12-27 18:32:57,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:32:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:32:57,845 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:32:57,846 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:32:57,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2296~0.base_26| 1) |v_#valid_69|) (= 0 v_~__unbuffered_p2_EAX~0_45) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd0~0_141 0) (= 0 |v_ULTIMATE.start_main_~#t2296~0.offset_19|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2296~0.base_26|) 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2296~0.base_26| 4)) (= v_~z$r_buff1_thd0~0_133 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2296~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2296~0.base_26|) |v_ULTIMATE.start_main_~#t2296~0.offset_19| 0))) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2296~0.base_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, 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_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ULTIMATE.start_main_~#t2298~0.base=|v_ULTIMATE.start_main_~#t2298~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ULTIMATE.start_main_~#t2297~0.base=|v_ULTIMATE.start_main_~#t2297~0.base_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ULTIMATE.start_main_~#t2298~0.offset=|v_ULTIMATE.start_main_~#t2298~0.offset_12|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_~#t2296~0.base=|v_ULTIMATE.start_main_~#t2296~0.base_26|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ULTIMATE.start_main_~#t2297~0.offset=|v_ULTIMATE.start_main_~#t2297~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2296~0.offset=|v_ULTIMATE.start_main_~#t2296~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t2297~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t2298~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2298~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t2296~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t2297~0.offset, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2296~0.offset, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 18:32:57,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2297~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2297~0.base_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2297~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2297~0.base_9|) |v_ULTIMATE.start_main_~#t2297~0.offset_8| 1)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t2297~0.offset_8|) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2297~0.base_9| 1) |v_#valid_33|) (not (= 0 |v_ULTIMATE.start_main_~#t2297~0.base_9|)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2297~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2297~0.base=|v_ULTIMATE.start_main_~#t2297~0.base_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2297~0.offset=|v_ULTIMATE.start_main_~#t2297~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2297~0.base, #length, ULTIMATE.start_main_~#t2297~0.offset] because there is no mapped edge [2019-12-27 18:32:57,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0_#in~arg.offset_In-301799338| P0Thread1of1ForFork0_~arg.offset_Out-301799338) (= ~z$w_buff1_used~0_Out-301799338 ~z$w_buff0_used~0_In-301799338) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-301799338| 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-301799338| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-301799338) (= ~z$w_buff0~0_Out-301799338 1) (= P0Thread1of1ForFork0_~arg.base_Out-301799338 |P0Thread1of1ForFork0_#in~arg.base_In-301799338|) (= ~z$w_buff0_used~0_Out-301799338 1) (= ~z$w_buff1~0_Out-301799338 ~z$w_buff0~0_In-301799338) (= 0 (mod ~z$w_buff1_used~0_Out-301799338 256))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-301799338|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-301799338, ~z$w_buff0~0=~z$w_buff0~0_In-301799338, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-301799338|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-301799338|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-301799338, ~z$w_buff0~0=~z$w_buff0~0_Out-301799338, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-301799338, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-301799338, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-301799338|, ~z$w_buff1~0=~z$w_buff1~0_Out-301799338, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-301799338, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-301799338|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-301799338} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 18:32:57,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2298~0.offset_9|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2298~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2298~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t2298~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2298~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2298~0.base_11|) |v_ULTIMATE.start_main_~#t2298~0.offset_9| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2298~0.base_11|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2298~0.base_11| 1) |v_#valid_40|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2298~0.offset=|v_ULTIMATE.start_main_~#t2298~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2298~0.base=|v_ULTIMATE.start_main_~#t2298~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2298~0.offset, #length, ULTIMATE.start_main_~#t2298~0.base] because there is no mapped edge [2019-12-27 18:32:57,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out1952750091| |P1Thread1of1ForFork1_#t~ite10_Out1952750091|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1952750091 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1952750091 256) 0))) (or (and .cse0 (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out1952750091| ~z$w_buff1~0_In1952750091) (not .cse2)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out1952750091| ~z~0_In1952750091) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1952750091, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1952750091, ~z$w_buff1~0=~z$w_buff1~0_In1952750091, ~z~0=~z~0_In1952750091} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1952750091|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1952750091, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1952750091, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1952750091|, ~z$w_buff1~0=~z$w_buff1~0_In1952750091, ~z~0=~z~0_In1952750091} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 18:32:57,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1376675690 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1376675690 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1376675690|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1376675690| ~z$w_buff0_used~0_In-1376675690)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1376675690, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1376675690} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1376675690, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1376675690|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1376675690} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:32:57,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1366824203 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-1366824203 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1366824203 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1366824203 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1366824203| ~z$w_buff1_used~0_In-1366824203) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1366824203| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1366824203, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1366824203, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1366824203, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1366824203} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1366824203, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1366824203, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1366824203, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1366824203|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1366824203} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:32:57,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-752363902 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-752363902 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-752363902| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-752363902| ~z$r_buff0_thd2~0_In-752363902) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-752363902, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-752363902} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-752363902, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-752363902|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-752363902} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 18:32:57,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1204884978 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1204884978 256) 0))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1204884978 256))) (= 0 (mod ~z$w_buff0_used~0_In1204884978 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In1204884978 256)) .cse0))) .cse1 (= ~z$w_buff1~0_In1204884978 |P2Thread1of1ForFork2_#t~ite23_Out1204884978|) (= |P2Thread1of1ForFork2_#t~ite23_Out1204884978| |P2Thread1of1ForFork2_#t~ite24_Out1204884978|)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite23_In1204884978| |P2Thread1of1ForFork2_#t~ite23_Out1204884978|) (= ~z$w_buff1~0_In1204884978 |P2Thread1of1ForFork2_#t~ite24_Out1204884978|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In1204884978|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1204884978, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1204884978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1204884978, ~z$w_buff1~0=~z$w_buff1~0_In1204884978, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1204884978, ~weak$$choice2~0=~weak$$choice2~0_In1204884978} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out1204884978|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out1204884978|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1204884978, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1204884978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1204884978, ~z$w_buff1~0=~z$w_buff1~0_In1204884978, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1204884978, ~weak$$choice2~0=~weak$$choice2~0_In1204884978} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 18:32:57,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1402677670 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1402677670 256)))) (or (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1402677670 256))) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1402677670 256))) (= (mod ~z$w_buff0_used~0_In1402677670 256) 0))) (= |P2Thread1of1ForFork2_#t~ite26_Out1402677670| |P2Thread1of1ForFork2_#t~ite27_Out1402677670|) (= |P2Thread1of1ForFork2_#t~ite26_Out1402677670| ~z$w_buff0_used~0_In1402677670) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite26_In1402677670| |P2Thread1of1ForFork2_#t~ite26_Out1402677670|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite27_Out1402677670| ~z$w_buff0_used~0_In1402677670)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1402677670|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1402677670, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1402677670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1402677670, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1402677670, ~weak$$choice2~0=~weak$$choice2~0_In1402677670} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1402677670|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1402677670, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1402677670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1402677670, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1402677670, ~weak$$choice2~0=~weak$$choice2~0_In1402677670, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1402677670|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 18:32:57,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1569763019 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1569763019 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1569763019 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In1569763019 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In1569763019 |P1Thread1of1ForFork1_#t~ite14_Out1569763019|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1569763019|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1569763019, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1569763019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1569763019, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1569763019} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1569763019, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1569763019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1569763019, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1569763019|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1569763019} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:32:57,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:32:57,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In830038687 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite30_Out830038687| |P2Thread1of1ForFork2_#t~ite29_Out830038687|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In830038687 256) 0))) (or (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In830038687 256))) (and (= 0 (mod ~z$w_buff1_used~0_In830038687 256)) .cse0) (= (mod ~z$w_buff0_used~0_In830038687 256) 0))) (= |P2Thread1of1ForFork2_#t~ite29_Out830038687| ~z$w_buff1_used~0_In830038687) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite29_In830038687| |P2Thread1of1ForFork2_#t~ite29_Out830038687|) (= |P2Thread1of1ForFork2_#t~ite30_Out830038687| ~z$w_buff1_used~0_In830038687) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In830038687, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In830038687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In830038687, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In830038687, ~weak$$choice2~0=~weak$$choice2~0_In830038687, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In830038687|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out830038687|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In830038687, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In830038687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In830038687, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In830038687, ~weak$$choice2~0=~weak$$choice2~0_In830038687, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out830038687|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 18:32:57,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 18:32:57,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 18:32:57,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-2050112792 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2050112792 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-2050112792| ~z$w_buff0_used~0_In-2050112792)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-2050112792| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2050112792, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2050112792} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2050112792|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2050112792, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2050112792} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:32:57,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In25784600 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In25784600 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In25784600 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In25784600 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out25784600|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In25784600 |P0Thread1of1ForFork0_#t~ite6_Out25784600|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In25784600, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In25784600, ~z$w_buff1_used~0=~z$w_buff1_used~0_In25784600, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In25784600} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out25784600|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In25784600, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In25784600, ~z$w_buff1_used~0=~z$w_buff1_used~0_In25784600, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In25784600} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:32:57,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1168462088 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1168462088 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out1168462088 ~z$r_buff0_thd1~0_In1168462088)) (and (not .cse0) (= ~z$r_buff0_thd1~0_Out1168462088 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1168462088, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1168462088} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1168462088, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1168462088|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1168462088} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:32:57,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1679555998 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1679555998 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1679555998 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1679555998 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1679555998| ~z$r_buff1_thd1~0_In-1679555998)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1679555998| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1679555998, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1679555998, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1679555998, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1679555998} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1679555998, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1679555998|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1679555998, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1679555998, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1679555998} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:32:57,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 18:32:57,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-688157047| |P2Thread1of1ForFork2_#t~ite39_Out-688157047|)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-688157047 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-688157047 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out-688157047| ~z~0_In-688157047)) (and .cse0 (not .cse2) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out-688157047| ~z$w_buff1~0_In-688157047)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-688157047, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-688157047, ~z$w_buff1~0=~z$w_buff1~0_In-688157047, ~z~0=~z~0_In-688157047} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-688157047, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-688157047, ~z$w_buff1~0=~z$w_buff1~0_In-688157047, ~z~0=~z~0_In-688157047, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-688157047|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-688157047|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 18:32:57,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-306469403 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-306469403 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite40_Out-306469403| ~z$w_buff0_used~0_In-306469403) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out-306469403| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-306469403, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-306469403} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-306469403, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-306469403, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-306469403|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 18:32:57,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In321962896 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In321962896 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In321962896 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In321962896 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out321962896| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite41_Out321962896| ~z$w_buff1_used~0_In321962896) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In321962896, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In321962896, ~z$w_buff1_used~0=~z$w_buff1_used~0_In321962896, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In321962896} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out321962896|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In321962896, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In321962896, ~z$w_buff1_used~0=~z$w_buff1_used~0_In321962896, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In321962896} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 18:32:57,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1503056342 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1503056342 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-1503056342|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-1503056342| ~z$r_buff0_thd3~0_In-1503056342)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1503056342, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1503056342} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1503056342|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1503056342, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1503056342} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 18:32:57,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1269261863 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1269261863 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-1269261863 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1269261863 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-1269261863 |P2Thread1of1ForFork2_#t~ite43_Out-1269261863|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-1269261863| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1269261863, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1269261863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1269261863, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1269261863} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1269261863, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1269261863, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1269261863|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1269261863, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1269261863} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 18:32:57,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 18:32:57,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:32:57,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1864284740| |ULTIMATE.start_main_#t~ite48_Out1864284740|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1864284740 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1864284740 256) 0))) (or (and .cse0 (not .cse1) (= ~z$w_buff1~0_In1864284740 |ULTIMATE.start_main_#t~ite47_Out1864284740|) (not .cse2)) (and .cse0 (= ~z~0_In1864284740 |ULTIMATE.start_main_#t~ite47_Out1864284740|) (or .cse1 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1864284740, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1864284740, ~z$w_buff1~0=~z$w_buff1~0_In1864284740, ~z~0=~z~0_In1864284740} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1864284740, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1864284740|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1864284740, ~z$w_buff1~0=~z$w_buff1~0_In1864284740, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1864284740|, ~z~0=~z~0_In1864284740} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 18:32:57,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In953900473 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In953900473 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out953900473| 0)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In953900473 |ULTIMATE.start_main_#t~ite49_Out953900473|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In953900473, ~z$w_buff0_used~0=~z$w_buff0_used~0_In953900473} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In953900473, ~z$w_buff0_used~0=~z$w_buff0_used~0_In953900473, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out953900473|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 18:32:57,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1759495903 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1759495903 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1759495903 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1759495903 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1759495903|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1759495903 |ULTIMATE.start_main_#t~ite50_Out1759495903|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1759495903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1759495903, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1759495903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1759495903} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1759495903|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1759495903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1759495903, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1759495903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1759495903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 18:32:57,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-478660939 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-478660939 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-478660939 |ULTIMATE.start_main_#t~ite51_Out-478660939|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out-478660939| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-478660939, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-478660939} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-478660939, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-478660939|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-478660939} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 18:32:57,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1925349412 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1925349412 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1925349412 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1925349412 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1925349412|)) (and (= ~z$r_buff1_thd0~0_In1925349412 |ULTIMATE.start_main_#t~ite52_Out1925349412|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1925349412, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1925349412, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1925349412, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1925349412} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1925349412|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1925349412, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1925349412, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1925349412, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1925349412} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 18:32:57,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_~x~0_49 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:32:57,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:32:57 BasicIcfg [2019-12-27 18:32:57,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:32:57,995 INFO L168 Benchmark]: Toolchain (without parser) took 136667.27 ms. Allocated memory was 146.8 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 103.5 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 18:32:57,998 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 18:32:57,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.28 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 103.1 MB in the beginning and 157.6 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:32:57,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.65 ms. Allocated memory is still 204.5 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:32:57,999 INFO L168 Benchmark]: Boogie Preprocessor took 39.86 ms. Allocated memory is still 204.5 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:32:58,000 INFO L168 Benchmark]: RCFGBuilder took 810.36 ms. Allocated memory is still 204.5 MB. Free memory was 152.3 MB in the beginning and 103.0 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:32:58,000 INFO L168 Benchmark]: TraceAbstraction took 134996.71 ms. Allocated memory was 204.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 18:32:58,005 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 746.28 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 103.1 MB in the beginning and 157.6 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.65 ms. Allocated memory is still 204.5 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.86 ms. Allocated memory is still 204.5 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 810.36 ms. Allocated memory is still 204.5 MB. Free memory was 152.3 MB in the beginning and 103.0 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 134996.71 ms. Allocated memory was 204.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 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: 6.3s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7185 VarBasedMoverChecksPositive, 382 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 288 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2296, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t2297, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t2298, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=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=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] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_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=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] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 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 [L786] 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)) [L787] 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)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 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)) [L789] 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)) [L791] 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_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 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)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 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) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 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 [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 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 [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] 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_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 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) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 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 [L833] 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, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 134.6s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 60.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6942 SDtfs, 12876 SDslu, 28037 SDs, 0 SdLazy, 25628 SolverSat, 856 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 819 GetRequests, 219 SyntacticMatches, 90 SemanticMatches, 510 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11327 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred 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: 38.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 545062 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1482 NumberOfCodeBlocks, 1482 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1386 ConstructedInterpolants, 0 QuantifiedInterpolants, 257350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...