/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:58:45,999 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:58:46,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:58:46,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:58:46,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:58:46,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:58:46,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:58:46,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:58:46,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:58:46,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:58:46,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:58:46,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:58:46,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:58:46,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:58:46,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:58:46,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:58:46,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:58:46,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:58:46,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:58:46,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:58:46,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:58:46,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:58:46,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:58:46,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:58:46,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:58:46,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:58:46,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:58:46,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:58:46,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:58:46,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:58:46,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:58:46,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:58:46,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:58:46,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:58:46,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:58:46,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:58:46,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:58:46,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:58:46,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:58:46,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:58:46,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:58:46,086 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.epf [2019-12-27 03:58:46,100 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:58:46,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:58:46,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:58:46,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:58:46,102 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:58:46,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:58:46,102 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:58:46,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:58:46,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:58:46,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:58:46,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:58:46,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:58:46,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:58:46,103 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:58:46,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:58:46,104 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:58:46,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:58:46,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:58:46,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:58:46,105 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:58:46,105 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:58:46,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:58:46,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:58:46,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:58:46,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:58:46,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:58:46,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:58:46,106 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:58:46,106 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:58:46,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:58:46,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:58:46,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:58:46,422 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:58:46,422 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:58:46,423 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.opt.i [2019-12-27 03:58:46,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee48a998b/8c4ccfe64555472fa79ad8affa576d24/FLAGff02bb925 [2019-12-27 03:58:47,011 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:58:47,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_pso.opt.i [2019-12-27 03:58:47,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee48a998b/8c4ccfe64555472fa79ad8affa576d24/FLAGff02bb925 [2019-12-27 03:58:47,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee48a998b/8c4ccfe64555472fa79ad8affa576d24 [2019-12-27 03:58:47,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:58:47,328 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:58:47,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:58:47,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:58:47,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:58:47,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:58:47" (1/1) ... [2019-12-27 03:58:47,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746c584f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:47, skipping insertion in model container [2019-12-27 03:58:47,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:58:47" (1/1) ... [2019-12-27 03:58:47,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:58:47,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:58:47,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:58:47,905 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:58:48,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:58:48,103 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:58:48,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:48 WrapperNode [2019-12-27 03:58:48,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:58:48,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:58:48,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:58:48,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:58:48,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:48" (1/1) ... [2019-12-27 03:58:48,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:48" (1/1) ... [2019-12-27 03:58:48,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:58:48,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:58:48,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:58:48,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:58:48,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:48" (1/1) ... [2019-12-27 03:58:48,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:48" (1/1) ... [2019-12-27 03:58:48,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:48" (1/1) ... [2019-12-27 03:58:48,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:48" (1/1) ... [2019-12-27 03:58:48,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:48" (1/1) ... [2019-12-27 03:58:48,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:48" (1/1) ... [2019-12-27 03:58:48,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:48" (1/1) ... [2019-12-27 03:58:48,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:58:48,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:58:48,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:58:48,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:58:48,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:48" (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 03:58:48,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:58:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:58:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:58:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:58:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:58:48,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:58:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:58:48,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:58:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:58:48,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:58:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:58:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:58:48,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:58:48,285 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 03:58:49,030 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:58:49,030 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:58:49,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:58:49 BoogieIcfgContainer [2019-12-27 03:58:49,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:58:49,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:58:49,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:58:49,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:58:49,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:58:47" (1/3) ... [2019-12-27 03:58:49,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d21a836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:58:49, skipping insertion in model container [2019-12-27 03:58:49,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:58:48" (2/3) ... [2019-12-27 03:58:49,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d21a836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:58:49, skipping insertion in model container [2019-12-27 03:58:49,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:58:49" (3/3) ... [2019-12-27 03:58:49,043 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_pso.opt.i [2019-12-27 03:58:49,054 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:58:49,054 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:58:49,062 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:58:49,063 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:58:49,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,104 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,105 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,131 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,133 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,177 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,177 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,177 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,183 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,185 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,190 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:58:49,208 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:58:49,233 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:58:49,234 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:58:49,234 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:58:49,234 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:58:49,234 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:58:49,234 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:58:49,234 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:58:49,235 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:58:49,260 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 03:58:49,262 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 03:58:49,392 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 03:58:49,393 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:58:49,408 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:58:49,431 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 03:58:49,500 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 03:58:49,500 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:58:49,510 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:58:49,532 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 03:58:49,533 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:58:55,347 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 03:58:55,473 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 03:58:55,507 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-27 03:58:55,508 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 03:58:55,512 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-27 03:59:07,757 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-27 03:59:07,759 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-27 03:59:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:59:07,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:07,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:59:07,766 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:07,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:07,772 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-27 03:59:07,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:07,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570173251] [2019-12-27 03:59:07,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:08,040 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 03:59:08,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570173251] [2019-12-27 03:59:08,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:08,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:59:08,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422641078] [2019-12-27 03:59:08,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:59:08,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:08,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:59:08,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:59:08,064 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-27 03:59:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:11,023 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-27 03:59:11,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:59:11,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:59:11,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:11,572 INFO L225 Difference]: With dead ends: 87834 [2019-12-27 03:59:11,573 INFO L226 Difference]: Without dead ends: 82738 [2019-12-27 03:59:11,574 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 03:59:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-27 03:59:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-27 03:59:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-27 03:59:19,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-27 03:59:19,394 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-27 03:59:19,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:19,394 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-27 03:59:19,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:59:19,394 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-27 03:59:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:59:19,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:19,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:19,408 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:19,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:19,408 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-27 03:59:19,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:19,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131652721] [2019-12-27 03:59:19,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:19,559 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 03:59:19,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131652721] [2019-12-27 03:59:19,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:19,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:59:19,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473508346] [2019-12-27 03:59:19,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:59:19,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:19,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:59:19,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:59:19,565 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-27 03:59:23,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:23,199 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-27 03:59:23,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:59:23,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:59:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:23,744 INFO L225 Difference]: With dead ends: 127286 [2019-12-27 03:59:23,744 INFO L226 Difference]: Without dead ends: 127202 [2019-12-27 03:59:23,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:59:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-27 03:59:30,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-27 03:59:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-27 03:59:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-27 03:59:36,636 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-27 03:59:36,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:36,637 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-27 03:59:36,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:59:36,637 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-27 03:59:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:59:36,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:36,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:36,642 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:36,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:36,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-27 03:59:36,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:36,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558924256] [2019-12-27 03:59:36,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:36,703 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 03:59:36,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558924256] [2019-12-27 03:59:36,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:36,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:59:36,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024532815] [2019-12-27 03:59:36,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:59:36,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:36,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:59:36,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:59:36,705 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-27 03:59:36,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:36,823 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-27 03:59:36,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:59:36,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:59:36,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:36,885 INFO L225 Difference]: With dead ends: 28492 [2019-12-27 03:59:36,885 INFO L226 Difference]: Without dead ends: 28492 [2019-12-27 03:59:36,886 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 03:59:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-27 03:59:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-27 03:59:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-27 03:59:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-27 03:59:37,477 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-27 03:59:37,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:37,478 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-27 03:59:37,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:59:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-27 03:59:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:59:37,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:37,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:37,480 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:37,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:37,480 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-27 03:59:37,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:37,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756136601] [2019-12-27 03:59:37,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:59:37,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756136601] [2019-12-27 03:59:37,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:37,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:59:37,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612365899] [2019-12-27 03:59:37,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:59:37,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:37,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:59:37,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:59:37,595 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-27 03:59:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:38,116 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-27 03:59:38,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:59:38,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 03:59:38,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:38,220 INFO L225 Difference]: With dead ends: 41156 [2019-12-27 03:59:38,220 INFO L226 Difference]: Without dead ends: 41141 [2019-12-27 03:59:38,220 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 03:59:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-27 03:59:39,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-27 03:59:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-27 03:59:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-27 03:59:40,024 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-27 03:59:40,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:40,024 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-27 03:59:40,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:59:40,024 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-27 03:59:40,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:59:40,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:40,036 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 03:59:40,036 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:40,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:40,036 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-27 03:59:40,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:40,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599271555] [2019-12-27 03:59:40,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:40,184 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 03:59:40,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599271555] [2019-12-27 03:59:40,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:40,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:59:40,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408936247] [2019-12-27 03:59:40,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:59:40,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:40,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:59:40,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:59:40,189 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-27 03:59:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:41,147 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-27 03:59:41,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:59:41,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 03:59:41,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:41,234 INFO L225 Difference]: With dead ends: 48363 [2019-12-27 03:59:41,234 INFO L226 Difference]: Without dead ends: 48336 [2019-12-27 03:59:41,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:59:41,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-27 03:59:41,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-27 03:59:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-27 03:59:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-27 03:59:44,387 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-27 03:59:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:44,387 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-27 03:59:44,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:59:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-27 03:59:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:59:44,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:44,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] [2019-12-27 03:59:44,405 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:44,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:44,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-27 03:59:44,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:44,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675728768] [2019-12-27 03:59:44,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:44,460 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 03:59:44,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675728768] [2019-12-27 03:59:44,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:44,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:59:44,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311402201] [2019-12-27 03:59:44,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:59:44,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:44,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:59:44,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:59:44,462 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-27 03:59:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:44,538 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-27 03:59:44,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:59:44,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:59:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:44,562 INFO L225 Difference]: With dead ends: 12861 [2019-12-27 03:59:44,563 INFO L226 Difference]: Without dead ends: 12861 [2019-12-27 03:59:44,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:59:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-27 03:59:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-27 03:59:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-27 03:59:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-27 03:59:44,756 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-27 03:59:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:44,756 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-27 03:59:44,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:59:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-27 03:59:44,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 03:59:44,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:44,775 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 03:59:44,776 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:44,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:44,776 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-27 03:59:44,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:44,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489556323] [2019-12-27 03:59:44,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:44,845 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 03:59:44,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489556323] [2019-12-27 03:59:44,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:44,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:59:44,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413198917] [2019-12-27 03:59:44,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:59:44,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:44,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:59:44,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:59:44,848 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-27 03:59:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:44,918 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-27 03:59:44,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:59:44,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 03:59:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:44,934 INFO L225 Difference]: With dead ends: 11425 [2019-12-27 03:59:44,934 INFO L226 Difference]: Without dead ends: 11425 [2019-12-27 03:59:44,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:59:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-27 03:59:45,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-27 03:59:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-27 03:59:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-27 03:59:45,111 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-27 03:59:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:45,111 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-27 03:59:45,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:59:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-27 03:59:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:45,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:45,128 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] [2019-12-27 03:59:45,129 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:45,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:45,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-27 03:59:45,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:45,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742937032] [2019-12-27 03:59:45,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:45,209 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 03:59:45,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742937032] [2019-12-27 03:59:45,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:45,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:59:45,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446649208] [2019-12-27 03:59:45,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:59:45,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:45,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:59:45,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:59:45,212 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 4 states. [2019-12-27 03:59:45,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:45,286 INFO L93 Difference]: Finished difference Result 20009 states and 62260 transitions. [2019-12-27 03:59:45,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:59:45,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 03:59:45,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:45,303 INFO L225 Difference]: With dead ends: 20009 [2019-12-27 03:59:45,303 INFO L226 Difference]: Without dead ends: 9365 [2019-12-27 03:59:45,303 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 03:59:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2019-12-27 03:59:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 9365. [2019-12-27 03:59:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-12-27 03:59:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 29013 transitions. [2019-12-27 03:59:45,445 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 29013 transitions. Word has length 53 [2019-12-27 03:59:45,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:45,445 INFO L462 AbstractCegarLoop]: Abstraction has 9365 states and 29013 transitions. [2019-12-27 03:59:45,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:59:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 29013 transitions. [2019-12-27 03:59:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:45,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:45,459 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] [2019-12-27 03:59:45,459 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:45,460 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-27 03:59:45,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:45,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258376460] [2019-12-27 03:59:45,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:45,579 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 03:59:45,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258376460] [2019-12-27 03:59:45,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:45,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:59:45,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679131003] [2019-12-27 03:59:45,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:59:45,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:45,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:59:45,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:59:45,582 INFO L87 Difference]: Start difference. First operand 9365 states and 29013 transitions. Second operand 7 states. [2019-12-27 03:59:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:45,961 INFO L93 Difference]: Finished difference Result 23182 states and 71788 transitions. [2019-12-27 03:59:45,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:59:45,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:59:45,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:45,988 INFO L225 Difference]: With dead ends: 23182 [2019-12-27 03:59:45,988 INFO L226 Difference]: Without dead ends: 18276 [2019-12-27 03:59:45,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:59:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-27 03:59:46,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11162. [2019-12-27 03:59:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-27 03:59:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 34879 transitions. [2019-12-27 03:59:46,216 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 34879 transitions. Word has length 53 [2019-12-27 03:59:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:46,216 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 34879 transitions. [2019-12-27 03:59:46,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:59:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 34879 transitions. [2019-12-27 03:59:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:46,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:46,232 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] [2019-12-27 03:59:46,232 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:46,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-27 03:59:46,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:46,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149003270] [2019-12-27 03:59:46,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:59:46,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149003270] [2019-12-27 03:59:46,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:46,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:59:46,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842699906] [2019-12-27 03:59:46,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:59:46,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:46,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:59:46,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:59:46,508 INFO L87 Difference]: Start difference. First operand 11162 states and 34879 transitions. Second operand 7 states. [2019-12-27 03:59:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:46,959 INFO L93 Difference]: Finished difference Result 27840 states and 85084 transitions. [2019-12-27 03:59:46,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:59:46,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:59:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:47,000 INFO L225 Difference]: With dead ends: 27840 [2019-12-27 03:59:47,000 INFO L226 Difference]: Without dead ends: 19924 [2019-12-27 03:59:47,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:59:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19924 states. [2019-12-27 03:59:47,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19924 to 13020. [2019-12-27 03:59:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-12-27 03:59:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 40574 transitions. [2019-12-27 03:59:47,273 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 40574 transitions. Word has length 53 [2019-12-27 03:59:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:47,273 INFO L462 AbstractCegarLoop]: Abstraction has 13020 states and 40574 transitions. [2019-12-27 03:59:47,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:59:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 40574 transitions. [2019-12-27 03:59:47,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:47,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:47,293 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] [2019-12-27 03:59:47,293 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:47,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:47,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-27 03:59:47,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:47,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651338837] [2019-12-27 03:59:47,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:47,372 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 03:59:47,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651338837] [2019-12-27 03:59:47,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:47,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:59:47,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663467699] [2019-12-27 03:59:47,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:59:47,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:47,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:59:47,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:59:47,374 INFO L87 Difference]: Start difference. First operand 13020 states and 40574 transitions. Second operand 7 states. [2019-12-27 03:59:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:47,765 INFO L93 Difference]: Finished difference Result 25803 states and 80188 transitions. [2019-12-27 03:59:47,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:59:47,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:59:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:47,809 INFO L225 Difference]: With dead ends: 25803 [2019-12-27 03:59:47,809 INFO L226 Difference]: Without dead ends: 23832 [2019-12-27 03:59:47,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:59:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23832 states. [2019-12-27 03:59:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23832 to 13086. [2019-12-27 03:59:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13086 states. [2019-12-27 03:59:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13086 states to 13086 states and 40859 transitions. [2019-12-27 03:59:48,089 INFO L78 Accepts]: Start accepts. Automaton has 13086 states and 40859 transitions. Word has length 53 [2019-12-27 03:59:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:48,089 INFO L462 AbstractCegarLoop]: Abstraction has 13086 states and 40859 transitions. [2019-12-27 03:59:48,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:59:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 13086 states and 40859 transitions. [2019-12-27 03:59:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:48,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:48,105 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] [2019-12-27 03:59:48,105 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:48,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:48,105 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-27 03:59:48,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:48,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360791416] [2019-12-27 03:59:48,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:48,153 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 03:59:48,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360791416] [2019-12-27 03:59:48,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:48,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:59:48,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152343788] [2019-12-27 03:59:48,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:59:48,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:48,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:59:48,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:59:48,156 INFO L87 Difference]: Start difference. First operand 13086 states and 40859 transitions. Second operand 3 states. [2019-12-27 03:59:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:48,267 INFO L93 Difference]: Finished difference Result 18737 states and 58738 transitions. [2019-12-27 03:59:48,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:59:48,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 03:59:48,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:48,305 INFO L225 Difference]: With dead ends: 18737 [2019-12-27 03:59:48,305 INFO L226 Difference]: Without dead ends: 18737 [2019-12-27 03:59:48,305 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 03:59:48,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18737 states. [2019-12-27 03:59:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18737 to 16909. [2019-12-27 03:59:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16909 states. [2019-12-27 03:59:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16909 states to 16909 states and 53533 transitions. [2019-12-27 03:59:48,608 INFO L78 Accepts]: Start accepts. Automaton has 16909 states and 53533 transitions. Word has length 53 [2019-12-27 03:59:48,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:48,609 INFO L462 AbstractCegarLoop]: Abstraction has 16909 states and 53533 transitions. [2019-12-27 03:59:48,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:59:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 16909 states and 53533 transitions. [2019-12-27 03:59:48,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:48,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:48,629 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] [2019-12-27 03:59:48,629 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-27 03:59:48,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:48,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468162213] [2019-12-27 03:59:48,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:48,721 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 03:59:48,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468162213] [2019-12-27 03:59:48,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:48,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:59:48,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777624711] [2019-12-27 03:59:48,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:59:48,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:48,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:59:48,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:59:48,724 INFO L87 Difference]: Start difference. First operand 16909 states and 53533 transitions. Second operand 6 states. [2019-12-27 03:59:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:49,626 INFO L93 Difference]: Finished difference Result 31543 states and 97867 transitions. [2019-12-27 03:59:49,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:59:49,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 03:59:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:49,673 INFO L225 Difference]: With dead ends: 31543 [2019-12-27 03:59:49,673 INFO L226 Difference]: Without dead ends: 31459 [2019-12-27 03:59:49,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:59:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31459 states. [2019-12-27 03:59:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31459 to 19853. [2019-12-27 03:59:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19853 states. [2019-12-27 03:59:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19853 states to 19853 states and 62091 transitions. [2019-12-27 03:59:50,058 INFO L78 Accepts]: Start accepts. Automaton has 19853 states and 62091 transitions. Word has length 53 [2019-12-27 03:59:50,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:50,059 INFO L462 AbstractCegarLoop]: Abstraction has 19853 states and 62091 transitions. [2019-12-27 03:59:50,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:59:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 19853 states and 62091 transitions. [2019-12-27 03:59:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:50,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:50,092 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] [2019-12-27 03:59:50,092 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:50,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:50,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-27 03:59:50,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:50,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786169686] [2019-12-27 03:59:50,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:50,204 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 03:59:50,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786169686] [2019-12-27 03:59:50,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:50,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:59:50,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980412774] [2019-12-27 03:59:50,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:59:50,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:50,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:59:50,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:59:50,207 INFO L87 Difference]: Start difference. First operand 19853 states and 62091 transitions. Second operand 7 states. [2019-12-27 03:59:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:51,171 INFO L93 Difference]: Finished difference Result 31464 states and 95079 transitions. [2019-12-27 03:59:51,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 03:59:51,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:59:51,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:51,218 INFO L225 Difference]: With dead ends: 31464 [2019-12-27 03:59:51,219 INFO L226 Difference]: Without dead ends: 31342 [2019-12-27 03:59:51,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:59:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31342 states. [2019-12-27 03:59:51,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31342 to 25003. [2019-12-27 03:59:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25003 states. [2019-12-27 03:59:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25003 states to 25003 states and 77213 transitions. [2019-12-27 03:59:51,670 INFO L78 Accepts]: Start accepts. Automaton has 25003 states and 77213 transitions. Word has length 53 [2019-12-27 03:59:51,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:51,670 INFO L462 AbstractCegarLoop]: Abstraction has 25003 states and 77213 transitions. [2019-12-27 03:59:51,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:59:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 25003 states and 77213 transitions. [2019-12-27 03:59:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:51,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:51,713 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] [2019-12-27 03:59:51,713 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:51,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-27 03:59:51,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:51,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143823763] [2019-12-27 03:59:51,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:59:51,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143823763] [2019-12-27 03:59:51,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:51,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:59:51,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439384240] [2019-12-27 03:59:51,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:59:51,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:51,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:59:51,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:59:51,848 INFO L87 Difference]: Start difference. First operand 25003 states and 77213 transitions. Second operand 9 states. [2019-12-27 03:59:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:53,777 INFO L93 Difference]: Finished difference Result 41056 states and 124508 transitions. [2019-12-27 03:59:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 03:59:53,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 03:59:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:53,840 INFO L225 Difference]: With dead ends: 41056 [2019-12-27 03:59:53,840 INFO L226 Difference]: Without dead ends: 41056 [2019-12-27 03:59:53,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:59:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41056 states. [2019-12-27 03:59:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41056 to 23556. [2019-12-27 03:59:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23556 states. [2019-12-27 03:59:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23556 states to 23556 states and 73044 transitions. [2019-12-27 03:59:54,328 INFO L78 Accepts]: Start accepts. Automaton has 23556 states and 73044 transitions. Word has length 53 [2019-12-27 03:59:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:54,329 INFO L462 AbstractCegarLoop]: Abstraction has 23556 states and 73044 transitions. [2019-12-27 03:59:54,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:59:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 23556 states and 73044 transitions. [2019-12-27 03:59:54,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:59:54,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:54,354 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] [2019-12-27 03:59:54,354 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:54,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:54,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-27 03:59:54,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:54,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225909876] [2019-12-27 03:59:54,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:54,405 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 03:59:54,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225909876] [2019-12-27 03:59:54,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:54,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:59:54,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576267139] [2019-12-27 03:59:54,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:59:54,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:54,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:59:54,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:59:54,407 INFO L87 Difference]: Start difference. First operand 23556 states and 73044 transitions. Second operand 3 states. [2019-12-27 03:59:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:54,490 INFO L93 Difference]: Finished difference Result 17418 states and 53184 transitions. [2019-12-27 03:59:54,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:59:54,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 03:59:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:54,523 INFO L225 Difference]: With dead ends: 17418 [2019-12-27 03:59:54,523 INFO L226 Difference]: Without dead ends: 17418 [2019-12-27 03:59:54,524 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 03:59:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17418 states. [2019-12-27 03:59:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17418 to 16845. [2019-12-27 03:59:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16845 states. [2019-12-27 03:59:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16845 states to 16845 states and 51304 transitions. [2019-12-27 03:59:54,778 INFO L78 Accepts]: Start accepts. Automaton has 16845 states and 51304 transitions. Word has length 53 [2019-12-27 03:59:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:54,779 INFO L462 AbstractCegarLoop]: Abstraction has 16845 states and 51304 transitions. [2019-12-27 03:59:54,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:59:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 16845 states and 51304 transitions. [2019-12-27 03:59:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:59:54,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:54,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:59:54,797 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:54,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:54,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2130494140, now seen corresponding path program 1 times [2019-12-27 03:59:54,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:54,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996826651] [2019-12-27 03:59:54,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:54,925 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 03:59:54,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996826651] [2019-12-27 03:59:54,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:54,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:59:54,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721529735] [2019-12-27 03:59:54,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:59:54,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:54,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:59:54,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:59:54,927 INFO L87 Difference]: Start difference. First operand 16845 states and 51304 transitions. Second operand 7 states. [2019-12-27 03:59:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:59:55,831 INFO L93 Difference]: Finished difference Result 23352 states and 69676 transitions. [2019-12-27 03:59:55,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:59:55,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 03:59:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:59:55,864 INFO L225 Difference]: With dead ends: 23352 [2019-12-27 03:59:55,864 INFO L226 Difference]: Without dead ends: 23216 [2019-12-27 03:59:55,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:59:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23216 states. [2019-12-27 03:59:56,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23216 to 18293. [2019-12-27 03:59:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18293 states. [2019-12-27 03:59:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18293 states to 18293 states and 55408 transitions. [2019-12-27 03:59:56,165 INFO L78 Accepts]: Start accepts. Automaton has 18293 states and 55408 transitions. Word has length 54 [2019-12-27 03:59:56,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:59:56,165 INFO L462 AbstractCegarLoop]: Abstraction has 18293 states and 55408 transitions. [2019-12-27 03:59:56,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:59:56,165 INFO L276 IsEmpty]: Start isEmpty. Operand 18293 states and 55408 transitions. [2019-12-27 03:59:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:59:56,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:59:56,185 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] [2019-12-27 03:59:56,185 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:59:56,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:59:56,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1027069858, now seen corresponding path program 2 times [2019-12-27 03:59:56,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:59:56,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089629725] [2019-12-27 03:59:56,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:59:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:59:56,754 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 03:59:56,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089629725] [2019-12-27 03:59:56,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:59:56,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 03:59:56,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699139070] [2019-12-27 03:59:56,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 03:59:56,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:59:56,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 03:59:56,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:59:56,757 INFO L87 Difference]: Start difference. First operand 18293 states and 55408 transitions. Second operand 15 states. [2019-12-27 04:00:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:00:01,170 INFO L93 Difference]: Finished difference Result 39787 states and 118911 transitions. [2019-12-27 04:00:01,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 04:00:01,171 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-27 04:00:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:00:01,220 INFO L225 Difference]: With dead ends: 39787 [2019-12-27 04:00:01,220 INFO L226 Difference]: Without dead ends: 33383 [2019-12-27 04:00:01,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=519, Invalid=2787, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 04:00:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33383 states. [2019-12-27 04:00:01,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33383 to 18933. [2019-12-27 04:00:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18933 states. [2019-12-27 04:00:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18933 states to 18933 states and 57023 transitions. [2019-12-27 04:00:01,598 INFO L78 Accepts]: Start accepts. Automaton has 18933 states and 57023 transitions. Word has length 54 [2019-12-27 04:00:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:00:01,598 INFO L462 AbstractCegarLoop]: Abstraction has 18933 states and 57023 transitions. [2019-12-27 04:00:01,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:00:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 18933 states and 57023 transitions. [2019-12-27 04:00:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:00:01,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:00:01,618 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] [2019-12-27 04:00:01,618 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:00:01,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:00:01,618 INFO L82 PathProgramCache]: Analyzing trace with hash 414061482, now seen corresponding path program 3 times [2019-12-27 04:00:01,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:00:01,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900049262] [2019-12-27 04:00:01,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:00:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:00:02,018 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 04:00:02,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900049262] [2019-12-27 04:00:02,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:00:02,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:00:02,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579762662] [2019-12-27 04:00:02,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:00:02,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:00:02,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:00:02,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:00:02,021 INFO L87 Difference]: Start difference. First operand 18933 states and 57023 transitions. Second operand 15 states. [2019-12-27 04:00:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:00:05,914 INFO L93 Difference]: Finished difference Result 35536 states and 105965 transitions. [2019-12-27 04:00:05,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 04:00:05,915 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-27 04:00:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:00:05,962 INFO L225 Difference]: With dead ends: 35536 [2019-12-27 04:00:05,963 INFO L226 Difference]: Without dead ends: 33368 [2019-12-27 04:00:05,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=514, Invalid=2566, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 04:00:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33368 states. [2019-12-27 04:00:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33368 to 19029. [2019-12-27 04:00:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19029 states. [2019-12-27 04:00:06,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19029 states to 19029 states and 57259 transitions. [2019-12-27 04:00:06,367 INFO L78 Accepts]: Start accepts. Automaton has 19029 states and 57259 transitions. Word has length 54 [2019-12-27 04:00:06,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:00:06,367 INFO L462 AbstractCegarLoop]: Abstraction has 19029 states and 57259 transitions. [2019-12-27 04:00:06,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:00:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 19029 states and 57259 transitions. [2019-12-27 04:00:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:00:06,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:00:06,386 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] [2019-12-27 04:00:06,386 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:00:06,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:00:06,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1398179606, now seen corresponding path program 4 times [2019-12-27 04:00:06,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:00:06,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086173854] [2019-12-27 04:00:06,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:00:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:00:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:00:06,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086173854] [2019-12-27 04:00:06,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:00:06,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:00:06,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344442723] [2019-12-27 04:00:06,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:00:06,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:00:06,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:00:06,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:00:06,777 INFO L87 Difference]: Start difference. First operand 19029 states and 57259 transitions. Second operand 15 states. [2019-12-27 04:00:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:00:10,491 INFO L93 Difference]: Finished difference Result 33362 states and 99518 transitions. [2019-12-27 04:00:10,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 04:00:10,491 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-27 04:00:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:00:10,538 INFO L225 Difference]: With dead ends: 33362 [2019-12-27 04:00:10,539 INFO L226 Difference]: Without dead ends: 32948 [2019-12-27 04:00:10,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=497, Invalid=2473, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 04:00:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32948 states. [2019-12-27 04:00:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32948 to 18885. [2019-12-27 04:00:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18885 states. [2019-12-27 04:00:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18885 states to 18885 states and 56887 transitions. [2019-12-27 04:00:11,046 INFO L78 Accepts]: Start accepts. Automaton has 18885 states and 56887 transitions. Word has length 54 [2019-12-27 04:00:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:00:11,046 INFO L462 AbstractCegarLoop]: Abstraction has 18885 states and 56887 transitions. [2019-12-27 04:00:11,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:00:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 18885 states and 56887 transitions. [2019-12-27 04:00:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:00:11,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:00:11,065 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] [2019-12-27 04:00:11,065 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:00:11,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:00:11,065 INFO L82 PathProgramCache]: Analyzing trace with hash 792697694, now seen corresponding path program 5 times [2019-12-27 04:00:11,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:00:11,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577883863] [2019-12-27 04:00:11,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:00:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:00:11,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 04:00:11,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577883863] [2019-12-27 04:00:11,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:00:11,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:00:11,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891789131] [2019-12-27 04:00:11,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:00:11,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:00:11,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:00:11,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:00:11,470 INFO L87 Difference]: Start difference. First operand 18885 states and 56887 transitions. Second operand 15 states. [2019-12-27 04:00:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:00:15,807 INFO L93 Difference]: Finished difference Result 45720 states and 137146 transitions. [2019-12-27 04:00:15,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 04:00:15,807 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-27 04:00:15,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:00:15,881 INFO L225 Difference]: With dead ends: 45720 [2019-12-27 04:00:15,881 INFO L226 Difference]: Without dead ends: 44426 [2019-12-27 04:00:15,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=576, Invalid=3456, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 04:00:15,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44426 states. [2019-12-27 04:00:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44426 to 24692. [2019-12-27 04:00:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24692 states. [2019-12-27 04:00:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24692 states to 24692 states and 74487 transitions. [2019-12-27 04:00:16,443 INFO L78 Accepts]: Start accepts. Automaton has 24692 states and 74487 transitions. Word has length 54 [2019-12-27 04:00:16,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:00:16,444 INFO L462 AbstractCegarLoop]: Abstraction has 24692 states and 74487 transitions. [2019-12-27 04:00:16,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:00:16,444 INFO L276 IsEmpty]: Start isEmpty. Operand 24692 states and 74487 transitions. [2019-12-27 04:00:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:00:16,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:00:16,656 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] [2019-12-27 04:00:16,656 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:00:16,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:00:16,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1159977158, now seen corresponding path program 6 times [2019-12-27 04:00:16,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:00:16,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727903366] [2019-12-27 04:00:16,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:00:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:00:16,993 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 04:00:16,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727903366] [2019-12-27 04:00:16,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:00:16,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:00:16,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079361174] [2019-12-27 04:00:16,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:00:16,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:00:16,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:00:16,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:00:16,995 INFO L87 Difference]: Start difference. First operand 24692 states and 74487 transitions. Second operand 15 states. [2019-12-27 04:00:20,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:00:20,711 INFO L93 Difference]: Finished difference Result 45267 states and 134915 transitions. [2019-12-27 04:00:20,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 04:00:20,711 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-27 04:00:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:00:20,760 INFO L225 Difference]: With dead ends: 45267 [2019-12-27 04:00:20,760 INFO L226 Difference]: Without dead ends: 32915 [2019-12-27 04:00:20,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=490, Invalid=2372, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 04:00:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32915 states. [2019-12-27 04:00:21,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32915 to 18840. [2019-12-27 04:00:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18840 states. [2019-12-27 04:00:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18840 states to 18840 states and 56518 transitions. [2019-12-27 04:00:21,148 INFO L78 Accepts]: Start accepts. Automaton has 18840 states and 56518 transitions. Word has length 54 [2019-12-27 04:00:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:00:21,149 INFO L462 AbstractCegarLoop]: Abstraction has 18840 states and 56518 transitions. [2019-12-27 04:00:21,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:00:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 18840 states and 56518 transitions. [2019-12-27 04:00:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:00:21,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:00:21,169 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] [2019-12-27 04:00:21,169 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:00:21,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:00:21,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1760218510, now seen corresponding path program 7 times [2019-12-27 04:00:21,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:00:21,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389191842] [2019-12-27 04:00:21,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:00:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:00:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:00:21,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389191842] [2019-12-27 04:00:21,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:00:21,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:00:21,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806896650] [2019-12-27 04:00:21,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:00:21,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:00:21,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:00:21,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:00:21,647 INFO L87 Difference]: Start difference. First operand 18840 states and 56518 transitions. Second operand 16 states. [2019-12-27 04:00:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:00:25,873 INFO L93 Difference]: Finished difference Result 35049 states and 104553 transitions. [2019-12-27 04:00:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 04:00:25,873 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-12-27 04:00:25,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:00:25,925 INFO L225 Difference]: With dead ends: 35049 [2019-12-27 04:00:25,925 INFO L226 Difference]: Without dead ends: 34615 [2019-12-27 04:00:25,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=434, Invalid=2428, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 04:00:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34615 states. [2019-12-27 04:00:26,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34615 to 20730. [2019-12-27 04:00:26,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20730 states. [2019-12-27 04:00:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20730 states to 20730 states and 61975 transitions. [2019-12-27 04:00:26,339 INFO L78 Accepts]: Start accepts. Automaton has 20730 states and 61975 transitions. Word has length 54 [2019-12-27 04:00:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:00:26,339 INFO L462 AbstractCegarLoop]: Abstraction has 20730 states and 61975 transitions. [2019-12-27 04:00:26,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:00:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 20730 states and 61975 transitions. [2019-12-27 04:00:26,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:00:26,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:00:26,360 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] [2019-12-27 04:00:26,360 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:00:26,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:00:26,360 INFO L82 PathProgramCache]: Analyzing trace with hash 582073934, now seen corresponding path program 8 times [2019-12-27 04:00:26,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:00:26,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952914159] [2019-12-27 04:00:26,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:00:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:00:26,809 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 04:00:26,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952914159] [2019-12-27 04:00:26,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:00:26,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:00:26,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395558709] [2019-12-27 04:00:26,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:00:26,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:00:26,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:00:26,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:00:26,811 INFO L87 Difference]: Start difference. First operand 20730 states and 61975 transitions. Second operand 16 states. [2019-12-27 04:00:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:00:30,600 INFO L93 Difference]: Finished difference Result 35095 states and 104247 transitions. [2019-12-27 04:00:30,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 04:00:30,600 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-12-27 04:00:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:00:30,647 INFO L225 Difference]: With dead ends: 35095 [2019-12-27 04:00:30,647 INFO L226 Difference]: Without dead ends: 32873 [2019-12-27 04:00:30,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=449, Invalid=2203, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 04:00:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32873 states. [2019-12-27 04:00:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32873 to 18834. [2019-12-27 04:00:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18834 states. [2019-12-27 04:00:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18834 states to 18834 states and 56512 transitions. [2019-12-27 04:00:31,169 INFO L78 Accepts]: Start accepts. Automaton has 18834 states and 56512 transitions. Word has length 54 [2019-12-27 04:00:31,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:00:31,169 INFO L462 AbstractCegarLoop]: Abstraction has 18834 states and 56512 transitions. [2019-12-27 04:00:31,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:00:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 18834 states and 56512 transitions. [2019-12-27 04:00:31,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:00:31,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:00:31,188 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] [2019-12-27 04:00:31,188 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:00:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:00:31,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1391330862, now seen corresponding path program 9 times [2019-12-27 04:00:31,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:00:31,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721390736] [2019-12-27 04:00:31,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:00:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:00:31,305 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 04:00:31,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721390736] [2019-12-27 04:00:31,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:00:31,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:00:31,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368871931] [2019-12-27 04:00:31,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:00:31,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:00:31,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:00:31,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:00:31,307 INFO L87 Difference]: Start difference. First operand 18834 states and 56512 transitions. Second operand 9 states. [2019-12-27 04:00:32,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:00:32,506 INFO L93 Difference]: Finished difference Result 32437 states and 97011 transitions. [2019-12-27 04:00:32,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:00:32,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 04:00:32,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:00:32,544 INFO L225 Difference]: With dead ends: 32437 [2019-12-27 04:00:32,545 INFO L226 Difference]: Without dead ends: 26141 [2019-12-27 04:00:32,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:00:32,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26141 states. [2019-12-27 04:00:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26141 to 18764. [2019-12-27 04:00:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18764 states. [2019-12-27 04:00:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18764 states to 18764 states and 56195 transitions. [2019-12-27 04:00:32,873 INFO L78 Accepts]: Start accepts. Automaton has 18764 states and 56195 transitions. Word has length 54 [2019-12-27 04:00:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:00:32,873 INFO L462 AbstractCegarLoop]: Abstraction has 18764 states and 56195 transitions. [2019-12-27 04:00:32,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:00:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 18764 states and 56195 transitions. [2019-12-27 04:00:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:00:32,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:00:32,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, 1, 1, 1, 1, 1, 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 04:00:32,892 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:00:32,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:00:32,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1687814112, now seen corresponding path program 10 times [2019-12-27 04:00:32,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:00:32,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647712301] [2019-12-27 04:00:32,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:00:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:00:33,066 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 04:00:33,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647712301] [2019-12-27 04:00:33,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:00:33,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:00:33,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652264804] [2019-12-27 04:00:33,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:00:33,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:00:33,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:00:33,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:00:33,068 INFO L87 Difference]: Start difference. First operand 18764 states and 56195 transitions. Second operand 11 states. [2019-12-27 04:00:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:00:35,837 INFO L93 Difference]: Finished difference Result 31907 states and 93136 transitions. [2019-12-27 04:00:35,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 04:00:35,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 04:00:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:00:35,898 INFO L225 Difference]: With dead ends: 31907 [2019-12-27 04:00:35,898 INFO L226 Difference]: Without dead ends: 31907 [2019-12-27 04:00:35,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:00:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31907 states. [2019-12-27 04:00:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31907 to 20856. [2019-12-27 04:00:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20856 states. [2019-12-27 04:00:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20856 states to 20856 states and 61963 transitions. [2019-12-27 04:00:36,288 INFO L78 Accepts]: Start accepts. Automaton has 20856 states and 61963 transitions. Word has length 54 [2019-12-27 04:00:36,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:00:36,288 INFO L462 AbstractCegarLoop]: Abstraction has 20856 states and 61963 transitions. [2019-12-27 04:00:36,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:00:36,288 INFO L276 IsEmpty]: Start isEmpty. Operand 20856 states and 61963 transitions. [2019-12-27 04:00:36,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:00:36,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:00:36,308 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] [2019-12-27 04:00:36,308 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:00:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:00:36,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1451766760, now seen corresponding path program 11 times [2019-12-27 04:00:36,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:00:36,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713717446] [2019-12-27 04:00:36,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:00:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:00:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:00:36,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713717446] [2019-12-27 04:00:36,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:00:36,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 04:00:36,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889008520] [2019-12-27 04:00:36,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:00:36,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:00:36,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:00:36,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:00:36,508 INFO L87 Difference]: Start difference. First operand 20856 states and 61963 transitions. Second operand 12 states. [2019-12-27 04:00:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:00:39,012 INFO L93 Difference]: Finished difference Result 31452 states and 91546 transitions. [2019-12-27 04:00:39,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 04:00:39,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 04:00:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:00:39,057 INFO L225 Difference]: With dead ends: 31452 [2019-12-27 04:00:39,057 INFO L226 Difference]: Without dead ends: 31452 [2019-12-27 04:00:39,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2019-12-27 04:00:39,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31452 states. [2019-12-27 04:00:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31452 to 20655. [2019-12-27 04:00:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20655 states. [2019-12-27 04:00:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20655 states to 20655 states and 61527 transitions. [2019-12-27 04:00:39,434 INFO L78 Accepts]: Start accepts. Automaton has 20655 states and 61527 transitions. Word has length 54 [2019-12-27 04:00:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:00:39,435 INFO L462 AbstractCegarLoop]: Abstraction has 20655 states and 61527 transitions. [2019-12-27 04:00:39,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:00:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand 20655 states and 61527 transitions. [2019-12-27 04:00:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 04:00:39,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:00:39,457 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] [2019-12-27 04:00:39,457 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:00:39,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:00:39,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1496564564, now seen corresponding path program 12 times [2019-12-27 04:00:39,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:00:39,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215762427] [2019-12-27 04:00:39,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:00:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:00:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:00:39,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215762427] [2019-12-27 04:00:39,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:00:39,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:00:39,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313085837] [2019-12-27 04:00:39,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:00:39,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:00:39,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:00:39,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:00:39,508 INFO L87 Difference]: Start difference. First operand 20655 states and 61527 transitions. Second operand 3 states. [2019-12-27 04:00:39,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:00:39,617 INFO L93 Difference]: Finished difference Result 20653 states and 61522 transitions. [2019-12-27 04:00:39,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:00:39,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 04:00:39,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:00:39,666 INFO L225 Difference]: With dead ends: 20653 [2019-12-27 04:00:39,667 INFO L226 Difference]: Without dead ends: 20653 [2019-12-27 04:00:39,667 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 04:00:39,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20653 states. [2019-12-27 04:00:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20653 to 18533. [2019-12-27 04:00:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18533 states. [2019-12-27 04:00:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18533 states to 18533 states and 55754 transitions. [2019-12-27 04:00:40,231 INFO L78 Accepts]: Start accepts. Automaton has 18533 states and 55754 transitions. Word has length 54 [2019-12-27 04:00:40,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:00:40,231 INFO L462 AbstractCegarLoop]: Abstraction has 18533 states and 55754 transitions. [2019-12-27 04:00:40,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:00:40,232 INFO L276 IsEmpty]: Start isEmpty. Operand 18533 states and 55754 transitions. [2019-12-27 04:00:40,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 04:00:40,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:00:40,261 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] [2019-12-27 04:00:40,261 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:00:40,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:00:40,261 INFO L82 PathProgramCache]: Analyzing trace with hash -866822381, now seen corresponding path program 1 times [2019-12-27 04:00:40,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:00:40,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823175034] [2019-12-27 04:00:40,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:00:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:00:40,455 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 04:00:40,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823175034] [2019-12-27 04:00:40,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:00:40,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:00:40,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400761483] [2019-12-27 04:00:40,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:00:40,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:00:40,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:00:40,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:00:40,457 INFO L87 Difference]: Start difference. First operand 18533 states and 55754 transitions. Second operand 11 states. [2019-12-27 04:00:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:00:41,423 INFO L93 Difference]: Finished difference Result 31620 states and 95422 transitions. [2019-12-27 04:00:41,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 04:00:41,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 04:00:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:00:41,472 INFO L225 Difference]: With dead ends: 31620 [2019-12-27 04:00:41,472 INFO L226 Difference]: Without dead ends: 31054 [2019-12-27 04:00:41,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-27 04:00:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31054 states. [2019-12-27 04:00:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31054 to 21117. [2019-12-27 04:00:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21117 states. [2019-12-27 04:00:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21117 states to 21117 states and 63368 transitions. [2019-12-27 04:00:41,898 INFO L78 Accepts]: Start accepts. Automaton has 21117 states and 63368 transitions. Word has length 55 [2019-12-27 04:00:41,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:00:41,899 INFO L462 AbstractCegarLoop]: Abstraction has 21117 states and 63368 transitions. [2019-12-27 04:00:41,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:00:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 21117 states and 63368 transitions. [2019-12-27 04:00:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 04:00:41,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:00:41,922 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] [2019-12-27 04:00:41,922 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:00:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:00:41,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1270200649, now seen corresponding path program 2 times [2019-12-27 04:00:41,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:00:41,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691944141] [2019-12-27 04:00:41,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:00:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:00:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:00:42,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691944141] [2019-12-27 04:00:42,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:00:42,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 04:00:42,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061601755] [2019-12-27 04:00:42,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 04:00:42,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:00:42,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 04:00:42,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:00:42,658 INFO L87 Difference]: Start difference. First operand 21117 states and 63368 transitions. Second operand 17 states. [2019-12-27 04:00:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:00:46,901 INFO L93 Difference]: Finished difference Result 38042 states and 113177 transitions. [2019-12-27 04:00:46,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 04:00:46,902 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-27 04:00:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:00:46,951 INFO L225 Difference]: With dead ends: 38042 [2019-12-27 04:00:46,951 INFO L226 Difference]: Without dead ends: 33799 [2019-12-27 04:00:46,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=445, Invalid=2311, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 04:00:47,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33799 states. [2019-12-27 04:00:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33799 to 21117. [2019-12-27 04:00:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21117 states. [2019-12-27 04:00:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21117 states to 21117 states and 63365 transitions. [2019-12-27 04:00:47,379 INFO L78 Accepts]: Start accepts. Automaton has 21117 states and 63365 transitions. Word has length 55 [2019-12-27 04:00:47,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:00:47,379 INFO L462 AbstractCegarLoop]: Abstraction has 21117 states and 63365 transitions. [2019-12-27 04:00:47,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 04:00:47,379 INFO L276 IsEmpty]: Start isEmpty. Operand 21117 states and 63365 transitions. [2019-12-27 04:00:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 04:00:47,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:00:47,403 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] [2019-12-27 04:00:47,403 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:00:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:00:47,403 INFO L82 PathProgramCache]: Analyzing trace with hash -151545341, now seen corresponding path program 3 times [2019-12-27 04:00:47,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:00:47,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379215888] [2019-12-27 04:00:47,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:00:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:00:47,588 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 04:00:47,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379215888] [2019-12-27 04:00:47,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:00:47,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:00:47,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074661342] [2019-12-27 04:00:47,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:00:47,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:00:47,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:00:47,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:00:47,590 INFO L87 Difference]: Start difference. First operand 21117 states and 63365 transitions. Second operand 11 states. [2019-12-27 04:00:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:00:48,477 INFO L93 Difference]: Finished difference Result 31448 states and 94486 transitions. [2019-12-27 04:00:48,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 04:00:48,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 04:00:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:00:48,520 INFO L225 Difference]: With dead ends: 31448 [2019-12-27 04:00:48,520 INFO L226 Difference]: Without dead ends: 26325 [2019-12-27 04:00:48,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:00:48,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26325 states. [2019-12-27 04:00:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26325 to 17362. [2019-12-27 04:00:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17362 states. [2019-12-27 04:00:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17362 states to 17362 states and 52504 transitions. [2019-12-27 04:00:48,857 INFO L78 Accepts]: Start accepts. Automaton has 17362 states and 52504 transitions. Word has length 55 [2019-12-27 04:00:48,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:00:48,858 INFO L462 AbstractCegarLoop]: Abstraction has 17362 states and 52504 transitions. [2019-12-27 04:00:48,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:00:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 17362 states and 52504 transitions. [2019-12-27 04:00:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 04:00:48,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:00:48,878 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] [2019-12-27 04:00:48,878 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:00:48,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:00:48,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 4 times [2019-12-27 04:00:48,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:00:48,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397250913] [2019-12-27 04:00:48,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:00:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:00:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:00:48,978 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:00:48,978 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:00:48,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2354~0.base_24|)) (= 0 v_~x$w_buff1_used~0_531) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= 0 |v_ULTIMATE.start_main_~#t2354~0.offset_18|) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2354~0.base_24|) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2354~0.base_24| 1)) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2354~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2354~0.base_24|) |v_ULTIMATE.start_main_~#t2354~0.offset_18| 0)) |v_#memory_int_23|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2354~0.base_24| 4)) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ULTIMATE.start_main_~#t2355~0.offset=|v_ULTIMATE.start_main_~#t2355~0.offset_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2354~0.offset=|v_ULTIMATE.start_main_~#t2354~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, ULTIMATE.start_main_~#t2354~0.base=|v_ULTIMATE.start_main_~#t2354~0.base_24|, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ULTIMATE.start_main_~#t2356~0.offset=|v_ULTIMATE.start_main_~#t2356~0.offset_19|, ULTIMATE.start_main_~#t2355~0.base=|v_ULTIMATE.start_main_~#t2355~0.base_26|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2356~0.base=|v_ULTIMATE.start_main_~#t2356~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2355~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2354~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2354~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2356~0.offset, ULTIMATE.start_main_~#t2355~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2356~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 04:00:48,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2355~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2355~0.base_13|) |v_ULTIMATE.start_main_~#t2355~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2355~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t2355~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2355~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2355~0.offset_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2355~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2355~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t2355~0.base=|v_ULTIMATE.start_main_~#t2355~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2355~0.offset=|v_ULTIMATE.start_main_~#t2355~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2355~0.base, #length, ULTIMATE.start_main_~#t2355~0.offset] because there is no mapped edge [2019-12-27 04:00:48,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2356~0.offset_11|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2356~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2356~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2356~0.base_13|) |v_ULTIMATE.start_main_~#t2356~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2356~0.base_13| 1) |v_#valid_38|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2356~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2356~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2356~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2356~0.base=|v_ULTIMATE.start_main_~#t2356~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2356~0.offset=|v_ULTIMATE.start_main_~#t2356~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2356~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2356~0.offset] because there is no mapped edge [2019-12-27 04:00:48,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= P1Thread1of1ForFork0_~arg.base_Out282358984 |P1Thread1of1ForFork0_#in~arg.base_In282358984|) (= ~x$w_buff0_used~0_In282358984 ~x$w_buff1_used~0_Out282358984) (= ~x$w_buff0_used~0_Out282358984 1) (= |P1Thread1of1ForFork0_#in~arg.offset_In282358984| P1Thread1of1ForFork0_~arg.offset_Out282358984) (= ~x$w_buff0~0_In282358984 ~x$w_buff1~0_Out282358984) (= 0 (mod ~x$w_buff1_used~0_Out282358984 256)) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out282358984| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out282358984) (= ~x$w_buff0~0_Out282358984 1) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out282358984| 1)) InVars {~x$w_buff0~0=~x$w_buff0~0_In282358984, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In282358984|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In282358984|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In282358984} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out282358984, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out282358984, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out282358984, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out282358984, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out282358984|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In282358984|, ~x$w_buff1~0=~x$w_buff1~0_Out282358984, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In282358984|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out282358984, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out282358984} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 04:00:48,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1796715618 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1796715618 256)))) (or (and (= ~x$w_buff1~0_In-1796715618 |P2Thread1of1ForFork1_#t~ite32_Out-1796715618|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-1796715618| ~x~0_In-1796715618)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1796715618, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1796715618, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1796715618, ~x~0=~x~0_In-1796715618} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1796715618|, ~x$w_buff1~0=~x$w_buff1~0_In-1796715618, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1796715618, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1796715618, ~x~0=~x~0_In-1796715618} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 04:00:48,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 04:00:48,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In368942138 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In368942138 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out368942138| 0)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In368942138 |P2Thread1of1ForFork1_#t~ite34_Out368942138|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In368942138, ~x$w_buff0_used~0=~x$w_buff0_used~0_In368942138} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out368942138|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In368942138, ~x$w_buff0_used~0=~x$w_buff0_used~0_In368942138} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 04:00:48,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In944762430 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In944762430 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out944762430|)) (and (= ~x$w_buff0_used~0_In944762430 |P1Thread1of1ForFork0_#t~ite28_Out944762430|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In944762430, ~x$w_buff0_used~0=~x$w_buff0_used~0_In944762430} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In944762430, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out944762430|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In944762430} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 04:00:48,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1375807270 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1375807270 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1375807270 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1375807270 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1375807270 |P1Thread1of1ForFork0_#t~ite29_Out1375807270|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1375807270|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1375807270, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1375807270, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1375807270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1375807270} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1375807270, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1375807270, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1375807270, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1375807270|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1375807270} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 04:00:48,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1555877269 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1555877269 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-1555877269 ~x$r_buff0_thd2~0_In-1555877269) (or .cse0 .cse1)) (and (= ~x$r_buff0_thd2~0_Out-1555877269 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1555877269, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1555877269} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1555877269|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1555877269, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1555877269} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 04:00:48,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1189639357 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1189639357 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1189639357 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1189639357 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1189639357|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1189639357 |P1Thread1of1ForFork0_#t~ite31_Out-1189639357|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1189639357, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1189639357, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1189639357, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1189639357} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1189639357|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1189639357, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1189639357, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1189639357, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1189639357} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 04:00:48,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 04:00:48,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In40896107 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In40896107 |P0Thread1of1ForFork2_#t~ite12_Out40896107|) (= |P0Thread1of1ForFork2_#t~ite11_In40896107| |P0Thread1of1ForFork2_#t~ite11_Out40896107|)) (and (= ~x$w_buff1~0_In40896107 |P0Thread1of1ForFork2_#t~ite11_Out40896107|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In40896107 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In40896107 256))) (= 0 (mod ~x$w_buff0_used~0_In40896107 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In40896107 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite12_Out40896107| |P0Thread1of1ForFork2_#t~ite11_Out40896107|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In40896107, ~x$w_buff1~0=~x$w_buff1~0_In40896107, ~x$w_buff1_used~0=~x$w_buff1_used~0_In40896107, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In40896107, ~weak$$choice2~0=~weak$$choice2~0_In40896107, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In40896107|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In40896107} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In40896107, ~x$w_buff1~0=~x$w_buff1~0_In40896107, ~x$w_buff1_used~0=~x$w_buff1_used~0_In40896107, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In40896107, ~weak$$choice2~0=~weak$$choice2~0_In40896107, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out40896107|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out40896107|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In40896107} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 04:00:48,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1762282257 256) 0))) (or (and (= ~x$w_buff0_used~0_In1762282257 |P0Thread1of1ForFork2_#t~ite14_Out1762282257|) (= |P0Thread1of1ForFork2_#t~ite14_Out1762282257| |P0Thread1of1ForFork2_#t~ite15_Out1762282257|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1762282257 256) 0))) (or (= (mod ~x$w_buff0_used~0_In1762282257 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In1762282257 256) 0) .cse0) (and (= (mod ~x$w_buff1_used~0_In1762282257 256) 0) .cse0))) .cse1) (and (= ~x$w_buff0_used~0_In1762282257 |P0Thread1of1ForFork2_#t~ite15_Out1762282257|) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite14_In1762282257| |P0Thread1of1ForFork2_#t~ite14_Out1762282257|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1762282257, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1762282257, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1762282257, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1762282257|, ~weak$$choice2~0=~weak$$choice2~0_In1762282257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1762282257} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1762282257, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1762282257, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1762282257|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1762282257, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1762282257|, ~weak$$choice2~0=~weak$$choice2~0_In1762282257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1762282257} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 04:00:48,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In850531803 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite18_Out850531803| |P0Thread1of1ForFork2_#t~ite17_Out850531803|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In850531803 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In850531803 256) 0) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In850531803 256)) .cse0) (= (mod ~x$w_buff0_used~0_In850531803 256) 0))) (= |P0Thread1of1ForFork2_#t~ite17_Out850531803| ~x$w_buff1_used~0_In850531803) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite17_In850531803| |P0Thread1of1ForFork2_#t~ite17_Out850531803|) (= |P0Thread1of1ForFork2_#t~ite18_Out850531803| ~x$w_buff1_used~0_In850531803)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In850531803, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In850531803|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In850531803, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In850531803, ~weak$$choice2~0=~weak$$choice2~0_In850531803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In850531803} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In850531803, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out850531803|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out850531803|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In850531803, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In850531803, ~weak$$choice2~0=~weak$$choice2~0_In850531803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In850531803} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 04:00:48,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 04:00:48,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 04:00:48,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-796758 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-796758 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-796758 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-796758 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-796758 |P2Thread1of1ForFork1_#t~ite35_Out-796758|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-796758|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-796758, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-796758, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-796758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-796758} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-796758|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-796758, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-796758, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-796758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-796758} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 04:00:48,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1462251626 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1462251626 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out1462251626| ~x$r_buff0_thd3~0_In1462251626)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out1462251626| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1462251626, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1462251626} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1462251626|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1462251626, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1462251626} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 04:00:48,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In889521830 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In889521830 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In889521830 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In889521830 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out889521830|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd3~0_In889521830 |P2Thread1of1ForFork1_#t~ite37_Out889521830|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In889521830, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In889521830, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In889521830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In889521830} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out889521830|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In889521830, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In889521830, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In889521830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In889521830} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 04:00:48,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 04:00:48,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 04:00:48,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In35832268 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In35832268 256) 0))) (or (and (= ~x~0_In35832268 |ULTIMATE.start_main_#t~ite41_Out35832268|) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In35832268 |ULTIMATE.start_main_#t~ite41_Out35832268|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In35832268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In35832268, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In35832268, ~x~0=~x~0_In35832268} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out35832268|, ~x$w_buff1~0=~x$w_buff1~0_In35832268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In35832268, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In35832268, ~x~0=~x~0_In35832268} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 04:00:48,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 04:00:48,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1117264007 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1117264007 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1117264007| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1117264007 |ULTIMATE.start_main_#t~ite43_Out-1117264007|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1117264007, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1117264007} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1117264007, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1117264007|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1117264007} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 04:00:48,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In2052347537 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In2052347537 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In2052347537 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2052347537 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out2052347537|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2052347537 |ULTIMATE.start_main_#t~ite44_Out2052347537|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2052347537, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2052347537, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2052347537, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2052347537} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2052347537, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2052347537, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2052347537, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2052347537|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2052347537} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 04:00:49,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1508116012 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1508116012 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1508116012| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out1508116012| ~x$r_buff0_thd0~0_In1508116012) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1508116012, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1508116012} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1508116012, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1508116012|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1508116012} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 04:00:49,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-1095939494 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1095939494 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1095939494 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1095939494 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1095939494| ~x$r_buff1_thd0~0_In-1095939494) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite46_Out-1095939494| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1095939494, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1095939494, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1095939494, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1095939494} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1095939494, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1095939494|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1095939494, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1095939494, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1095939494} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 04:00:49,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 04:00:49,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:00:49 BasicIcfg [2019-12-27 04:00:49,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:00:49,078 INFO L168 Benchmark]: Toolchain (without parser) took 121751.09 ms. Allocated memory was 145.2 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 101.4 MB in the beginning and 900.0 MB in the end (delta: -798.7 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 04:00:49,079 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 04:00:49,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.60 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 156.1 MB in the end (delta: -55.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 04:00:49,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.45 ms. Allocated memory is still 202.4 MB. Free memory was 156.1 MB in the beginning and 153.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:00:49,080 INFO L168 Benchmark]: Boogie Preprocessor took 39.03 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 151.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:00:49,080 INFO L168 Benchmark]: RCFGBuilder took 822.19 ms. Allocated memory is still 202.4 MB. Free memory was 151.2 MB in the beginning and 104.5 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:00:49,081 INFO L168 Benchmark]: TraceAbstraction took 120040.76 ms. Allocated memory was 202.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 103.5 MB in the beginning and 900.0 MB in the end (delta: -796.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 04:00:49,083 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.21 ms. Allocated memory is still 145.2 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.60 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 156.1 MB in the end (delta: -55.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.45 ms. Allocated memory is still 202.4 MB. Free memory was 156.1 MB in the beginning and 153.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.03 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 151.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 822.19 ms. Allocated memory is still 202.4 MB. Free memory was 151.2 MB in the beginning and 104.5 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120040.76 ms. Allocated memory was 202.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 103.5 MB in the beginning and 900.0 MB in the end (delta: -796.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2354, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2355, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2356, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 119.7s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 57.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7896 SDtfs, 12882 SDslu, 37142 SDs, 0 SdLazy, 34477 SolverSat, 714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 781 GetRequests, 66 SyntacticMatches, 41 SemanticMatches, 674 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7612 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred 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: 35.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 271459 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1476 NumberOfCodeBlocks, 1476 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1390 ConstructedInterpolants, 0 QuantifiedInterpolants, 376714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...