/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:03:06,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:03:06,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:03:06,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:03:06,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:03:06,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:03:06,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:03:06,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:03:06,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:03:06,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:03:06,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:03:06,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:03:06,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:03:06,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:03:06,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:03:06,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:03:06,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:03:06,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:03:06,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:03:06,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:03:06,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:03:06,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:03:06,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:03:06,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:03:06,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:03:06,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:03:06,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:03:06,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:03:06,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:03:06,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:03:06,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:03:06,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:03:06,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:03:06,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:03:06,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:03:06,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:03:06,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:03:06,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:03:06,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:03:06,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:03:06,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:03:06,148 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:03:06,162 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:03:06,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:03:06,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:03:06,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:03:06,164 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:03:06,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:03:06,165 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:03:06,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:03:06,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:03:06,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:03:06,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:03:06,166 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:03:06,166 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:03:06,166 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:03:06,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:03:06,167 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:03:06,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:03:06,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:03:06,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:03:06,167 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:03:06,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:03:06,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:03:06,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:03:06,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:03:06,168 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:03:06,169 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:03:06,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:03:06,169 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:03:06,169 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:03:06,169 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:03:06,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:03:06,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:03:06,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:03:06,458 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:03:06,458 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:03:06,459 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i [2019-12-26 23:03:06,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5170eeb0d/be79a5b5d3da4997ba42412e965e586a/FLAG982a2c9df [2019-12-26 23:03:07,096 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:03:07,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i [2019-12-26 23:03:07,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5170eeb0d/be79a5b5d3da4997ba42412e965e586a/FLAG982a2c9df [2019-12-26 23:03:07,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5170eeb0d/be79a5b5d3da4997ba42412e965e586a [2019-12-26 23:03:07,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:03:07,418 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:03:07,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:03:07,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:03:07,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:03:07,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:03:07" (1/1) ... [2019-12-26 23:03:07,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1562cfed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:03:07, skipping insertion in model container [2019-12-26 23:03:07,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:03:07" (1/1) ... [2019-12-26 23:03:07,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:03:07,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:03:08,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:03:08,094 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:03:08,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:03:08,243 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:03:08,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:03:08 WrapperNode [2019-12-26 23:03:08,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:03:08,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:03:08,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:03:08,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:03:08,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:03:08" (1/1) ... [2019-12-26 23:03:08,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:03:08" (1/1) ... [2019-12-26 23:03:08,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:03:08,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:03:08,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:03:08,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:03:08,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:03:08" (1/1) ... [2019-12-26 23:03:08,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:03:08" (1/1) ... [2019-12-26 23:03:08,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:03:08" (1/1) ... [2019-12-26 23:03:08,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:03:08" (1/1) ... [2019-12-26 23:03:08,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:03:08" (1/1) ... [2019-12-26 23:03:08,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:03:08" (1/1) ... [2019-12-26 23:03:08,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:03:08" (1/1) ... [2019-12-26 23:03:08,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:03:08,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:03:08,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:03:08,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:03:08,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:03:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:03:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:03:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:03:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:03:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:03:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:03:08,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:03:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:03:08,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:03:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:03:08,443 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:03:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:03:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:03:08,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:03:08,445 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:03:09,220 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:03:09,221 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:03:09,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:03:09 BoogieIcfgContainer [2019-12-26 23:03:09,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:03:09,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:03:09,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:03:09,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:03:09,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:03:07" (1/3) ... [2019-12-26 23:03:09,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef352b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:03:09, skipping insertion in model container [2019-12-26 23:03:09,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:03:08" (2/3) ... [2019-12-26 23:03:09,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef352b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:03:09, skipping insertion in model container [2019-12-26 23:03:09,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:03:09" (3/3) ... [2019-12-26 23:03:09,232 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc.i [2019-12-26 23:03:09,240 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:03:09,241 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:03:09,248 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:03:09,249 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:03:09,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,291 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,291 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,291 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,292 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,292 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,299 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,300 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,310 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,310 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,380 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,382 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,383 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,386 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,389 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:03:09,418 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:03:09,441 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:03:09,441 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:03:09,442 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:03:09,442 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:03:09,442 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:03:09,442 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:03:09,442 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:03:09,442 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:03:09,466 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-26 23:03:09,468 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:03:09,582 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:03:09,582 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:03:09,605 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:03:09,627 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:03:09,715 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:03:09,716 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:03:09,725 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:03:09,746 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 23:03:09,747 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:03:15,388 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-26 23:03:15,524 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-26 23:03:15,543 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77200 [2019-12-26 23:03:15,543 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-26 23:03:15,546 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-26 23:03:29,310 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-26 23:03:29,312 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-26 23:03:29,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:03:29,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:03:29,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:03:29,319 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:03:29,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:03:29,325 INFO L82 PathProgramCache]: Analyzing trace with hash 909908, now seen corresponding path program 1 times [2019-12-26 23:03:29,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:03:29,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487295870] [2019-12-26 23:03:29,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:03:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:03:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:03:29,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487295870] [2019-12-26 23:03:29,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:03:29,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:03:29,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950079050] [2019-12-26 23:03:29,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:03:29,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:03:29,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:03:29,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:03:29,585 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-26 23:03:32,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:03:32,493 INFO L93 Difference]: Finished difference Result 101472 states and 432734 transitions. [2019-12-26 23:03:32,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:03:32,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:03:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:03:33,066 INFO L225 Difference]: With dead ends: 101472 [2019-12-26 23:03:33,066 INFO L226 Difference]: Without dead ends: 95232 [2019-12-26 23:03:33,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:03:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95232 states. [2019-12-26 23:03:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95232 to 95232. [2019-12-26 23:03:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95232 states. [2019-12-26 23:03:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95232 states to 95232 states and 405538 transitions. [2019-12-26 23:03:43,859 INFO L78 Accepts]: Start accepts. Automaton has 95232 states and 405538 transitions. Word has length 3 [2019-12-26 23:03:43,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:03:43,860 INFO L462 AbstractCegarLoop]: Abstraction has 95232 states and 405538 transitions. [2019-12-26 23:03:43,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:03:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 95232 states and 405538 transitions. [2019-12-26 23:03:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:03:43,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:03:43,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:03:43,865 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:03:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:03:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1729820714, now seen corresponding path program 1 times [2019-12-26 23:03:43,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:03:43,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505015818] [2019-12-26 23:03:43,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:03:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:03:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:03:43,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505015818] [2019-12-26 23:03:43,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:03:43,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:03:43,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956476634] [2019-12-26 23:03:43,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:03:43,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:03:43,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:03:43,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:03:43,950 INFO L87 Difference]: Start difference. First operand 95232 states and 405538 transitions. Second operand 4 states. [2019-12-26 23:03:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:03:48,784 INFO L93 Difference]: Finished difference Result 151692 states and 619304 transitions. [2019-12-26 23:03:48,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:03:48,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:03:48,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:03:49,484 INFO L225 Difference]: With dead ends: 151692 [2019-12-26 23:03:49,484 INFO L226 Difference]: Without dead ends: 151643 [2019-12-26 23:03:49,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:03:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151643 states. [2019-12-26 23:03:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151643 to 138429. [2019-12-26 23:03:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138429 states. [2019-12-26 23:04:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138429 states to 138429 states and 572602 transitions. [2019-12-26 23:04:01,873 INFO L78 Accepts]: Start accepts. Automaton has 138429 states and 572602 transitions. Word has length 11 [2019-12-26 23:04:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:01,874 INFO L462 AbstractCegarLoop]: Abstraction has 138429 states and 572602 transitions. [2019-12-26 23:04:01,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:04:01,874 INFO L276 IsEmpty]: Start isEmpty. Operand 138429 states and 572602 transitions. [2019-12-26 23:04:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:04:01,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:01,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:01,880 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:01,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:01,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1791451612, now seen corresponding path program 1 times [2019-12-26 23:04:01,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:01,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114590267] [2019-12-26 23:04:01,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:01,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114590267] [2019-12-26 23:04:01,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:01,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:04:01,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284439682] [2019-12-26 23:04:01,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:04:01,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:01,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:04:01,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:01,945 INFO L87 Difference]: Start difference. First operand 138429 states and 572602 transitions. Second operand 3 states. [2019-12-26 23:04:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:02,070 INFO L93 Difference]: Finished difference Result 30955 states and 100617 transitions. [2019-12-26 23:04:02,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:04:02,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:04:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:02,125 INFO L225 Difference]: With dead ends: 30955 [2019-12-26 23:04:02,126 INFO L226 Difference]: Without dead ends: 30955 [2019-12-26 23:04:02,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:02,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30955 states. [2019-12-26 23:04:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30955 to 30955. [2019-12-26 23:04:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30955 states. [2019-12-26 23:04:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30955 states to 30955 states and 100617 transitions. [2019-12-26 23:04:02,695 INFO L78 Accepts]: Start accepts. Automaton has 30955 states and 100617 transitions. Word has length 13 [2019-12-26 23:04:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:02,695 INFO L462 AbstractCegarLoop]: Abstraction has 30955 states and 100617 transitions. [2019-12-26 23:04:02,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:04:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 30955 states and 100617 transitions. [2019-12-26 23:04:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:04:02,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:02,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:02,698 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:02,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash -137996123, now seen corresponding path program 1 times [2019-12-26 23:04:02,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:02,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519650244] [2019-12-26 23:04:02,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:02,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519650244] [2019-12-26 23:04:02,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:02,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:04:02,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690775221] [2019-12-26 23:04:02,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:04:02,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:02,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:04:02,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:02,802 INFO L87 Difference]: Start difference. First operand 30955 states and 100617 transitions. Second operand 3 states. [2019-12-26 23:04:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:02,999 INFO L93 Difference]: Finished difference Result 47061 states and 152507 transitions. [2019-12-26 23:04:03,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:04:03,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 23:04:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:03,084 INFO L225 Difference]: With dead ends: 47061 [2019-12-26 23:04:03,084 INFO L226 Difference]: Without dead ends: 47061 [2019-12-26 23:04:03,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:03,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47061 states. [2019-12-26 23:04:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47061 to 33925. [2019-12-26 23:04:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33925 states. [2019-12-26 23:04:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33925 states to 33925 states and 111057 transitions. [2019-12-26 23:04:05,130 INFO L78 Accepts]: Start accepts. Automaton has 33925 states and 111057 transitions. Word has length 16 [2019-12-26 23:04:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:05,131 INFO L462 AbstractCegarLoop]: Abstraction has 33925 states and 111057 transitions. [2019-12-26 23:04:05,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:04:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 33925 states and 111057 transitions. [2019-12-26 23:04:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:04:05,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:05,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:05,134 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:05,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:05,135 INFO L82 PathProgramCache]: Analyzing trace with hash -137876649, now seen corresponding path program 1 times [2019-12-26 23:04:05,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:05,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489647621] [2019-12-26 23:04:05,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:05,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489647621] [2019-12-26 23:04:05,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:05,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:04:05,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794538394] [2019-12-26 23:04:05,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:04:05,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:05,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:04:05,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:04:05,243 INFO L87 Difference]: Start difference. First operand 33925 states and 111057 transitions. Second operand 4 states. [2019-12-26 23:04:05,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:05,607 INFO L93 Difference]: Finished difference Result 41000 states and 132194 transitions. [2019-12-26 23:04:05,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:04:05,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 23:04:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:05,674 INFO L225 Difference]: With dead ends: 41000 [2019-12-26 23:04:05,674 INFO L226 Difference]: Without dead ends: 41000 [2019-12-26 23:04:05,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:04:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41000 states. [2019-12-26 23:04:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41000 to 37405. [2019-12-26 23:04:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37405 states. [2019-12-26 23:04:06,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37405 states to 37405 states and 121522 transitions. [2019-12-26 23:04:06,413 INFO L78 Accepts]: Start accepts. Automaton has 37405 states and 121522 transitions. Word has length 16 [2019-12-26 23:04:06,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:06,414 INFO L462 AbstractCegarLoop]: Abstraction has 37405 states and 121522 transitions. [2019-12-26 23:04:06,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:04:06,414 INFO L276 IsEmpty]: Start isEmpty. Operand 37405 states and 121522 transitions. [2019-12-26 23:04:06,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:04:06,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:06,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:06,416 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:06,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:06,417 INFO L82 PathProgramCache]: Analyzing trace with hash -219444717, now seen corresponding path program 1 times [2019-12-26 23:04:06,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:06,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931550410] [2019-12-26 23:04:06,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:07,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931550410] [2019-12-26 23:04:07,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:07,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:04:07,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047981770] [2019-12-26 23:04:07,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:04:07,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:07,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:04:07,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:04:07,252 INFO L87 Difference]: Start difference. First operand 37405 states and 121522 transitions. Second operand 4 states. [2019-12-26 23:04:07,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:07,610 INFO L93 Difference]: Finished difference Result 45062 states and 145323 transitions. [2019-12-26 23:04:07,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:04:07,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 23:04:07,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:07,704 INFO L225 Difference]: With dead ends: 45062 [2019-12-26 23:04:07,704 INFO L226 Difference]: Without dead ends: 45062 [2019-12-26 23:04:07,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:04:07,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45062 states. [2019-12-26 23:04:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45062 to 38365. [2019-12-26 23:04:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38365 states. [2019-12-26 23:04:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38365 states to 38365 states and 124903 transitions. [2019-12-26 23:04:08,413 INFO L78 Accepts]: Start accepts. Automaton has 38365 states and 124903 transitions. Word has length 16 [2019-12-26 23:04:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:08,414 INFO L462 AbstractCegarLoop]: Abstraction has 38365 states and 124903 transitions. [2019-12-26 23:04:08,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:04:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 38365 states and 124903 transitions. [2019-12-26 23:04:08,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:04:08,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:08,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:08,425 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:08,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:08,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1066994180, now seen corresponding path program 1 times [2019-12-26 23:04:08,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:08,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264404077] [2019-12-26 23:04:08,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:08,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264404077] [2019-12-26 23:04:08,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:08,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:04:08,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544416964] [2019-12-26 23:04:08,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:04:08,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:08,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:04:08,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:04:08,564 INFO L87 Difference]: Start difference. First operand 38365 states and 124903 transitions. Second operand 5 states. [2019-12-26 23:04:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:09,250 INFO L93 Difference]: Finished difference Result 53898 states and 171065 transitions. [2019-12-26 23:04:09,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:04:09,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 23:04:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:09,360 INFO L225 Difference]: With dead ends: 53898 [2019-12-26 23:04:09,360 INFO L226 Difference]: Without dead ends: 53891 [2019-12-26 23:04:09,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:04:10,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53891 states. [2019-12-26 23:04:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53891 to 39721. [2019-12-26 23:04:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39721 states. [2019-12-26 23:04:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39721 states to 39721 states and 129036 transitions. [2019-12-26 23:04:10,953 INFO L78 Accepts]: Start accepts. Automaton has 39721 states and 129036 transitions. Word has length 22 [2019-12-26 23:04:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:10,953 INFO L462 AbstractCegarLoop]: Abstraction has 39721 states and 129036 transitions. [2019-12-26 23:04:10,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:04:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 39721 states and 129036 transitions. [2019-12-26 23:04:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:04:10,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:10,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:10,963 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:10,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:10,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1734556852, now seen corresponding path program 1 times [2019-12-26 23:04:10,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:10,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971526428] [2019-12-26 23:04:10,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:11,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971526428] [2019-12-26 23:04:11,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:11,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:04:11,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727908243] [2019-12-26 23:04:11,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:04:11,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:11,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:04:11,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:04:11,046 INFO L87 Difference]: Start difference. First operand 39721 states and 129036 transitions. Second operand 5 states. [2019-12-26 23:04:11,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:11,683 INFO L93 Difference]: Finished difference Result 56181 states and 177938 transitions. [2019-12-26 23:04:11,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:04:11,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 23:04:11,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:11,780 INFO L225 Difference]: With dead ends: 56181 [2019-12-26 23:04:11,781 INFO L226 Difference]: Without dead ends: 56174 [2019-12-26 23:04:11,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:04:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56174 states. [2019-12-26 23:04:13,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56174 to 38054. [2019-12-26 23:04:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38054 states. [2019-12-26 23:04:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38054 states to 38054 states and 123745 transitions. [2019-12-26 23:04:13,361 INFO L78 Accepts]: Start accepts. Automaton has 38054 states and 123745 transitions. Word has length 22 [2019-12-26 23:04:13,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:13,361 INFO L462 AbstractCegarLoop]: Abstraction has 38054 states and 123745 transitions. [2019-12-26 23:04:13,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:04:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 38054 states and 123745 transitions. [2019-12-26 23:04:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:04:13,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:13,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:13,373 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:13,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:13,374 INFO L82 PathProgramCache]: Analyzing trace with hash -779030427, now seen corresponding path program 1 times [2019-12-26 23:04:13,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:13,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723232832] [2019-12-26 23:04:13,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:13,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723232832] [2019-12-26 23:04:13,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:13,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:04:13,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908453958] [2019-12-26 23:04:13,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:04:13,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:13,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:04:13,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:04:13,422 INFO L87 Difference]: Start difference. First operand 38054 states and 123745 transitions. Second operand 4 states. [2019-12-26 23:04:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:13,514 INFO L93 Difference]: Finished difference Result 15260 states and 46817 transitions. [2019-12-26 23:04:13,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:04:13,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:04:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:13,543 INFO L225 Difference]: With dead ends: 15260 [2019-12-26 23:04:13,543 INFO L226 Difference]: Without dead ends: 15260 [2019-12-26 23:04:13,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:04:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15260 states. [2019-12-26 23:04:13,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15260 to 14988. [2019-12-26 23:04:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14988 states. [2019-12-26 23:04:13,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14988 states to 14988 states and 46041 transitions. [2019-12-26 23:04:13,825 INFO L78 Accepts]: Start accepts. Automaton has 14988 states and 46041 transitions. Word has length 25 [2019-12-26 23:04:13,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:13,826 INFO L462 AbstractCegarLoop]: Abstraction has 14988 states and 46041 transitions. [2019-12-26 23:04:13,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:04:13,826 INFO L276 IsEmpty]: Start isEmpty. Operand 14988 states and 46041 transitions. [2019-12-26 23:04:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 23:04:13,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:13,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:13,838 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:13,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:13,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1740727520, now seen corresponding path program 1 times [2019-12-26 23:04:13,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:13,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744196546] [2019-12-26 23:04:13,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:13,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744196546] [2019-12-26 23:04:13,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:13,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:04:13,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442551739] [2019-12-26 23:04:13,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:04:13,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:13,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:04:13,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:04:13,907 INFO L87 Difference]: Start difference. First operand 14988 states and 46041 transitions. Second operand 5 states. [2019-12-26 23:04:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:14,309 INFO L93 Difference]: Finished difference Result 19496 states and 58771 transitions. [2019-12-26 23:04:14,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:04:14,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 23:04:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:14,345 INFO L225 Difference]: With dead ends: 19496 [2019-12-26 23:04:14,345 INFO L226 Difference]: Without dead ends: 19496 [2019-12-26 23:04:14,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:04:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19496 states. [2019-12-26 23:04:14,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19496 to 18230. [2019-12-26 23:04:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18230 states. [2019-12-26 23:04:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18230 states to 18230 states and 55601 transitions. [2019-12-26 23:04:14,614 INFO L78 Accepts]: Start accepts. Automaton has 18230 states and 55601 transitions. Word has length 27 [2019-12-26 23:04:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:14,614 INFO L462 AbstractCegarLoop]: Abstraction has 18230 states and 55601 transitions. [2019-12-26 23:04:14,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:04:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 18230 states and 55601 transitions. [2019-12-26 23:04:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:04:14,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:14,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:14,627 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:14,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:14,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1978987791, now seen corresponding path program 1 times [2019-12-26 23:04:14,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:14,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764733925] [2019-12-26 23:04:14,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:14,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764733925] [2019-12-26 23:04:14,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:14,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:04:14,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614212841] [2019-12-26 23:04:14,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:04:14,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:14,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:04:14,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:04:14,690 INFO L87 Difference]: Start difference. First operand 18230 states and 55601 transitions. Second operand 5 states. [2019-12-26 23:04:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:15,039 INFO L93 Difference]: Finished difference Result 21384 states and 64177 transitions. [2019-12-26 23:04:15,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:04:15,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 23:04:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:15,078 INFO L225 Difference]: With dead ends: 21384 [2019-12-26 23:04:15,078 INFO L226 Difference]: Without dead ends: 21384 [2019-12-26 23:04:15,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:04:15,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21384 states. [2019-12-26 23:04:15,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21384 to 17323. [2019-12-26 23:04:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-12-26 23:04:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 52883 transitions. [2019-12-26 23:04:15,491 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 52883 transitions. Word has length 28 [2019-12-26 23:04:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:15,492 INFO L462 AbstractCegarLoop]: Abstraction has 17323 states and 52883 transitions. [2019-12-26 23:04:15,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:04:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 52883 transitions. [2019-12-26 23:04:15,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 23:04:15,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:15,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:15,516 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:15,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:15,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1850577991, now seen corresponding path program 1 times [2019-12-26 23:04:15,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:15,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228005043] [2019-12-26 23:04:15,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:15,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228005043] [2019-12-26 23:04:15,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:15,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:04:15,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362767014] [2019-12-26 23:04:15,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:04:15,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:15,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:04:15,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:04:15,599 INFO L87 Difference]: Start difference. First operand 17323 states and 52883 transitions. Second operand 6 states. [2019-12-26 23:04:16,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:16,827 INFO L93 Difference]: Finished difference Result 24527 states and 73018 transitions. [2019-12-26 23:04:16,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:04:16,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-26 23:04:16,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:16,863 INFO L225 Difference]: With dead ends: 24527 [2019-12-26 23:04:16,863 INFO L226 Difference]: Without dead ends: 24527 [2019-12-26 23:04:16,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:04:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24527 states. [2019-12-26 23:04:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24527 to 18692. [2019-12-26 23:04:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18692 states. [2019-12-26 23:04:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18692 states to 18692 states and 56821 transitions. [2019-12-26 23:04:17,177 INFO L78 Accepts]: Start accepts. Automaton has 18692 states and 56821 transitions. Word has length 33 [2019-12-26 23:04:17,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:17,177 INFO L462 AbstractCegarLoop]: Abstraction has 18692 states and 56821 transitions. [2019-12-26 23:04:17,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:04:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 18692 states and 56821 transitions. [2019-12-26 23:04:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 23:04:17,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:17,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:17,197 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:17,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1933444630, now seen corresponding path program 1 times [2019-12-26 23:04:17,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:17,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936195829] [2019-12-26 23:04:17,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:17,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936195829] [2019-12-26 23:04:17,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:17,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:04:17,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779184527] [2019-12-26 23:04:17,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:04:17,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:17,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:04:17,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:04:17,278 INFO L87 Difference]: Start difference. First operand 18692 states and 56821 transitions. Second operand 6 states. [2019-12-26 23:04:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:17,959 INFO L93 Difference]: Finished difference Result 23844 states and 71231 transitions. [2019-12-26 23:04:17,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:04:17,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-26 23:04:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:18,003 INFO L225 Difference]: With dead ends: 23844 [2019-12-26 23:04:18,003 INFO L226 Difference]: Without dead ends: 23844 [2019-12-26 23:04:18,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:04:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23844 states. [2019-12-26 23:04:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23844 to 15691. [2019-12-26 23:04:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15691 states. [2019-12-26 23:04:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15691 states to 15691 states and 48077 transitions. [2019-12-26 23:04:18,291 INFO L78 Accepts]: Start accepts. Automaton has 15691 states and 48077 transitions. Word has length 34 [2019-12-26 23:04:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:18,291 INFO L462 AbstractCegarLoop]: Abstraction has 15691 states and 48077 transitions. [2019-12-26 23:04:18,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:04:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 15691 states and 48077 transitions. [2019-12-26 23:04:18,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 23:04:18,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:18,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:18,310 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash -390301387, now seen corresponding path program 1 times [2019-12-26 23:04:18,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:18,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61942286] [2019-12-26 23:04:18,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:18,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61942286] [2019-12-26 23:04:18,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:18,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:04:18,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222211333] [2019-12-26 23:04:18,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:04:18,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:18,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:04:18,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:18,363 INFO L87 Difference]: Start difference. First operand 15691 states and 48077 transitions. Second operand 3 states. [2019-12-26 23:04:18,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:18,449 INFO L93 Difference]: Finished difference Result 29593 states and 90773 transitions. [2019-12-26 23:04:18,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:04:18,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 23:04:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:18,473 INFO L225 Difference]: With dead ends: 29593 [2019-12-26 23:04:18,473 INFO L226 Difference]: Without dead ends: 16129 [2019-12-26 23:04:18,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16129 states. [2019-12-26 23:04:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16129 to 16073. [2019-12-26 23:04:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16073 states. [2019-12-26 23:04:18,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16073 states to 16073 states and 48010 transitions. [2019-12-26 23:04:18,694 INFO L78 Accepts]: Start accepts. Automaton has 16073 states and 48010 transitions. Word has length 39 [2019-12-26 23:04:18,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:18,695 INFO L462 AbstractCegarLoop]: Abstraction has 16073 states and 48010 transitions. [2019-12-26 23:04:18,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:04:18,695 INFO L276 IsEmpty]: Start isEmpty. Operand 16073 states and 48010 transitions. [2019-12-26 23:04:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:04:18,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:18,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:18,711 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:18,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:18,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1543157030, now seen corresponding path program 1 times [2019-12-26 23:04:18,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:18,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814446359] [2019-12-26 23:04:18,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:18,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814446359] [2019-12-26 23:04:18,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:18,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:04:18,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490738147] [2019-12-26 23:04:18,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:04:18,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:04:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:04:18,791 INFO L87 Difference]: Start difference. First operand 16073 states and 48010 transitions. Second operand 5 states. [2019-12-26 23:04:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:19,409 INFO L93 Difference]: Finished difference Result 23632 states and 69938 transitions. [2019-12-26 23:04:19,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:04:19,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 23:04:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:20,017 INFO L225 Difference]: With dead ends: 23632 [2019-12-26 23:04:20,017 INFO L226 Difference]: Without dead ends: 23632 [2019-12-26 23:04:20,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:04:20,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23632 states. [2019-12-26 23:04:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23632 to 21777. [2019-12-26 23:04:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21777 states. [2019-12-26 23:04:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21777 states to 21777 states and 64983 transitions. [2019-12-26 23:04:20,336 INFO L78 Accepts]: Start accepts. Automaton has 21777 states and 64983 transitions. Word has length 40 [2019-12-26 23:04:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:20,336 INFO L462 AbstractCegarLoop]: Abstraction has 21777 states and 64983 transitions. [2019-12-26 23:04:20,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:04:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 21777 states and 64983 transitions. [2019-12-26 23:04:20,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:04:20,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:20,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:20,358 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:20,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:20,359 INFO L82 PathProgramCache]: Analyzing trace with hash 838743556, now seen corresponding path program 2 times [2019-12-26 23:04:20,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:20,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919372475] [2019-12-26 23:04:20,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:20,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919372475] [2019-12-26 23:04:20,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:20,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:04:20,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422378374] [2019-12-26 23:04:20,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:04:20,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:20,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:04:20,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:04:20,422 INFO L87 Difference]: Start difference. First operand 21777 states and 64983 transitions. Second operand 5 states. [2019-12-26 23:04:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:20,537 INFO L93 Difference]: Finished difference Result 20526 states and 62067 transitions. [2019-12-26 23:04:20,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:04:20,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 23:04:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:20,573 INFO L225 Difference]: With dead ends: 20526 [2019-12-26 23:04:20,573 INFO L226 Difference]: Without dead ends: 18967 [2019-12-26 23:04:20,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:04:20,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18967 states. [2019-12-26 23:04:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18967 to 18092. [2019-12-26 23:04:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18092 states. [2019-12-26 23:04:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18092 states to 18092 states and 56295 transitions. [2019-12-26 23:04:21,028 INFO L78 Accepts]: Start accepts. Automaton has 18092 states and 56295 transitions. Word has length 40 [2019-12-26 23:04:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:21,029 INFO L462 AbstractCegarLoop]: Abstraction has 18092 states and 56295 transitions. [2019-12-26 23:04:21,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:04:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 18092 states and 56295 transitions. [2019-12-26 23:04:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:04:21,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:21,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:21,058 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:21,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:21,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1449191354, now seen corresponding path program 1 times [2019-12-26 23:04:21,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:21,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278873547] [2019-12-26 23:04:21,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:21,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278873547] [2019-12-26 23:04:21,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:21,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:04:21,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331715464] [2019-12-26 23:04:21,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:04:21,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:21,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:04:21,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:21,124 INFO L87 Difference]: Start difference. First operand 18092 states and 56295 transitions. Second operand 3 states. [2019-12-26 23:04:21,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:21,245 INFO L93 Difference]: Finished difference Result 24294 states and 73055 transitions. [2019-12-26 23:04:21,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:04:21,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 23:04:21,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:21,284 INFO L225 Difference]: With dead ends: 24294 [2019-12-26 23:04:21,284 INFO L226 Difference]: Without dead ends: 24294 [2019-12-26 23:04:21,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24294 states. [2019-12-26 23:04:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24294 to 18274. [2019-12-26 23:04:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18274 states. [2019-12-26 23:04:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18274 states to 18274 states and 55190 transitions. [2019-12-26 23:04:21,593 INFO L78 Accepts]: Start accepts. Automaton has 18274 states and 55190 transitions. Word has length 64 [2019-12-26 23:04:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:21,594 INFO L462 AbstractCegarLoop]: Abstraction has 18274 states and 55190 transitions. [2019-12-26 23:04:21,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:04:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 18274 states and 55190 transitions. [2019-12-26 23:04:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:04:21,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:21,617 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:21,617 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:21,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:21,618 INFO L82 PathProgramCache]: Analyzing trace with hash -237391966, now seen corresponding path program 1 times [2019-12-26 23:04:21,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:21,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939910634] [2019-12-26 23:04:21,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:21,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939910634] [2019-12-26 23:04:21,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:21,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:04:21,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893058932] [2019-12-26 23:04:21,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:04:21,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:21,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:04:21,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:04:21,718 INFO L87 Difference]: Start difference. First operand 18274 states and 55190 transitions. Second operand 8 states. [2019-12-26 23:04:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:23,759 INFO L93 Difference]: Finished difference Result 80145 states and 240194 transitions. [2019-12-26 23:04:23,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:04:23,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-26 23:04:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:23,846 INFO L225 Difference]: With dead ends: 80145 [2019-12-26 23:04:23,847 INFO L226 Difference]: Without dead ends: 58918 [2019-12-26 23:04:23,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-26 23:04:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58918 states. [2019-12-26 23:04:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58918 to 21155. [2019-12-26 23:04:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21155 states. [2019-12-26 23:04:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21155 states to 21155 states and 64148 transitions. [2019-12-26 23:04:24,430 INFO L78 Accepts]: Start accepts. Automaton has 21155 states and 64148 transitions. Word has length 64 [2019-12-26 23:04:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:24,431 INFO L462 AbstractCegarLoop]: Abstraction has 21155 states and 64148 transitions. [2019-12-26 23:04:24,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:04:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 21155 states and 64148 transitions. [2019-12-26 23:04:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:04:24,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:24,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:24,455 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:24,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:24,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1797634292, now seen corresponding path program 2 times [2019-12-26 23:04:24,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:24,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385118076] [2019-12-26 23:04:24,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:24,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385118076] [2019-12-26 23:04:24,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:24,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:04:24,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498462146] [2019-12-26 23:04:24,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:04:24,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:24,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:04:24,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:04:24,539 INFO L87 Difference]: Start difference. First operand 21155 states and 64148 transitions. Second operand 7 states. [2019-12-26 23:04:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:25,059 INFO L93 Difference]: Finished difference Result 60723 states and 180590 transitions. [2019-12-26 23:04:25,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:04:25,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:04:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:25,137 INFO L225 Difference]: With dead ends: 60723 [2019-12-26 23:04:25,137 INFO L226 Difference]: Without dead ends: 42175 [2019-12-26 23:04:25,137 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-26 23:04:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42175 states. [2019-12-26 23:04:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42175 to 24456. [2019-12-26 23:04:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24456 states. [2019-12-26 23:04:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24456 states to 24456 states and 73578 transitions. [2019-12-26 23:04:25,660 INFO L78 Accepts]: Start accepts. Automaton has 24456 states and 73578 transitions. Word has length 64 [2019-12-26 23:04:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:25,660 INFO L462 AbstractCegarLoop]: Abstraction has 24456 states and 73578 transitions. [2019-12-26 23:04:25,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:04:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 24456 states and 73578 transitions. [2019-12-26 23:04:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:04:25,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:25,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:25,685 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:25,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:25,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1864819808, now seen corresponding path program 3 times [2019-12-26 23:04:25,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:25,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711072208] [2019-12-26 23:04:25,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:25,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711072208] [2019-12-26 23:04:25,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:25,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:04:25,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659199739] [2019-12-26 23:04:25,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:04:25,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:04:25,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:04:25,795 INFO L87 Difference]: Start difference. First operand 24456 states and 73578 transitions. Second operand 9 states. [2019-12-26 23:04:27,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:27,642 INFO L93 Difference]: Finished difference Result 82000 states and 242893 transitions. [2019-12-26 23:04:27,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 23:04:27,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 23:04:27,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:27,758 INFO L225 Difference]: With dead ends: 82000 [2019-12-26 23:04:27,758 INFO L226 Difference]: Without dead ends: 78263 [2019-12-26 23:04:27,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-26 23:04:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78263 states. [2019-12-26 23:04:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78263 to 24486. [2019-12-26 23:04:28,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24486 states. [2019-12-26 23:04:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24486 states to 24486 states and 73706 transitions. [2019-12-26 23:04:28,532 INFO L78 Accepts]: Start accepts. Automaton has 24486 states and 73706 transitions. Word has length 64 [2019-12-26 23:04:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:28,532 INFO L462 AbstractCegarLoop]: Abstraction has 24486 states and 73706 transitions. [2019-12-26 23:04:28,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:04:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 24486 states and 73706 transitions. [2019-12-26 23:04:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:04:28,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:28,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:28,556 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:28,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:28,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1743895244, now seen corresponding path program 4 times [2019-12-26 23:04:28,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:28,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827877891] [2019-12-26 23:04:28,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:28,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827877891] [2019-12-26 23:04:28,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:28,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:04:28,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870983444] [2019-12-26 23:04:28,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:04:28,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:28,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:04:28,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:04:28,681 INFO L87 Difference]: Start difference. First operand 24486 states and 73706 transitions. Second operand 9 states. [2019-12-26 23:04:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:29,985 INFO L93 Difference]: Finished difference Result 98855 states and 292935 transitions. [2019-12-26 23:04:29,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:04:29,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 23:04:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:30,123 INFO L225 Difference]: With dead ends: 98855 [2019-12-26 23:04:30,123 INFO L226 Difference]: Without dead ends: 95231 [2019-12-26 23:04:30,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-26 23:04:30,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95231 states. [2019-12-26 23:04:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95231 to 24523. [2019-12-26 23:04:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24523 states. [2019-12-26 23:04:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24523 states to 24523 states and 73910 transitions. [2019-12-26 23:04:31,719 INFO L78 Accepts]: Start accepts. Automaton has 24523 states and 73910 transitions. Word has length 64 [2019-12-26 23:04:31,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:31,719 INFO L462 AbstractCegarLoop]: Abstraction has 24523 states and 73910 transitions. [2019-12-26 23:04:31,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:04:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 24523 states and 73910 transitions. [2019-12-26 23:04:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:04:31,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:31,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:31,748 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:31,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1299608434, now seen corresponding path program 5 times [2019-12-26 23:04:31,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:31,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841011690] [2019-12-26 23:04:31,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:31,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841011690] [2019-12-26 23:04:31,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:31,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:04:31,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710288021] [2019-12-26 23:04:31,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:04:31,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:31,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:04:31,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:04:31,817 INFO L87 Difference]: Start difference. First operand 24523 states and 73910 transitions. Second operand 7 states. [2019-12-26 23:04:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:32,260 INFO L93 Difference]: Finished difference Result 51563 states and 153345 transitions. [2019-12-26 23:04:32,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:04:32,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:04:32,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:32,321 INFO L225 Difference]: With dead ends: 51563 [2019-12-26 23:04:32,321 INFO L226 Difference]: Without dead ends: 44912 [2019-12-26 23:04:32,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:04:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44912 states. [2019-12-26 23:04:32,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44912 to 24831. [2019-12-26 23:04:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24831 states. [2019-12-26 23:04:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24831 states to 24831 states and 74861 transitions. [2019-12-26 23:04:32,838 INFO L78 Accepts]: Start accepts. Automaton has 24831 states and 74861 transitions. Word has length 64 [2019-12-26 23:04:32,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:32,838 INFO L462 AbstractCegarLoop]: Abstraction has 24831 states and 74861 transitions. [2019-12-26 23:04:32,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:04:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 24831 states and 74861 transitions. [2019-12-26 23:04:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:04:32,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:32,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:32,866 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:32,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:32,866 INFO L82 PathProgramCache]: Analyzing trace with hash 2138548684, now seen corresponding path program 6 times [2019-12-26 23:04:32,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:32,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784601698] [2019-12-26 23:04:32,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:32,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784601698] [2019-12-26 23:04:32,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:32,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:04:32,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074048482] [2019-12-26 23:04:32,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:04:32,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:32,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:04:32,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:04:32,954 INFO L87 Difference]: Start difference. First operand 24831 states and 74861 transitions. Second operand 6 states. [2019-12-26 23:04:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:33,722 INFO L93 Difference]: Finished difference Result 40171 states and 119168 transitions. [2019-12-26 23:04:33,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:04:33,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-26 23:04:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:33,778 INFO L225 Difference]: With dead ends: 40171 [2019-12-26 23:04:33,779 INFO L226 Difference]: Without dead ends: 39968 [2019-12-26 23:04:33,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:04:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39968 states. [2019-12-26 23:04:34,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39968 to 26499. [2019-12-26 23:04:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26499 states. [2019-12-26 23:04:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26499 states to 26499 states and 80093 transitions. [2019-12-26 23:04:34,915 INFO L78 Accepts]: Start accepts. Automaton has 26499 states and 80093 transitions. Word has length 64 [2019-12-26 23:04:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:34,916 INFO L462 AbstractCegarLoop]: Abstraction has 26499 states and 80093 transitions. [2019-12-26 23:04:34,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:04:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 26499 states and 80093 transitions. [2019-12-26 23:04:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:04:34,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:34,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:34,946 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:34,947 INFO L82 PathProgramCache]: Analyzing trace with hash -203791434, now seen corresponding path program 7 times [2019-12-26 23:04:34,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:34,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979565990] [2019-12-26 23:04:34,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:35,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979565990] [2019-12-26 23:04:35,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:35,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:04:35,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295953706] [2019-12-26 23:04:35,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:04:35,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:35,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:04:35,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:04:35,032 INFO L87 Difference]: Start difference. First operand 26499 states and 80093 transitions. Second operand 5 states. [2019-12-26 23:04:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:35,493 INFO L93 Difference]: Finished difference Result 28511 states and 85751 transitions. [2019-12-26 23:04:35,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:04:35,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-26 23:04:35,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:35,546 INFO L225 Difference]: With dead ends: 28511 [2019-12-26 23:04:35,546 INFO L226 Difference]: Without dead ends: 28511 [2019-12-26 23:04:35,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:04:35,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28511 states. [2019-12-26 23:04:35,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28511 to 26924. [2019-12-26 23:04:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26924 states. [2019-12-26 23:04:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26924 states to 26924 states and 81409 transitions. [2019-12-26 23:04:36,045 INFO L78 Accepts]: Start accepts. Automaton has 26924 states and 81409 transitions. Word has length 64 [2019-12-26 23:04:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:36,045 INFO L462 AbstractCegarLoop]: Abstraction has 26924 states and 81409 transitions. [2019-12-26 23:04:36,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:04:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 26924 states and 81409 transitions. [2019-12-26 23:04:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:04:36,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:36,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:36,075 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:36,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:36,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1288865556, now seen corresponding path program 8 times [2019-12-26 23:04:36,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:36,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009673442] [2019-12-26 23:04:36,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:36,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-26 23:04:36,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009673442] [2019-12-26 23:04:36,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:36,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:04:36,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104431477] [2019-12-26 23:04:36,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:04:36,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:36,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:04:36,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:04:36,211 INFO L87 Difference]: Start difference. First operand 26924 states and 81409 transitions. Second operand 8 states. [2019-12-26 23:04:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:38,092 INFO L93 Difference]: Finished difference Result 43600 states and 128179 transitions. [2019-12-26 23:04:38,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:04:38,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-26 23:04:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:38,151 INFO L225 Difference]: With dead ends: 43600 [2019-12-26 23:04:38,151 INFO L226 Difference]: Without dead ends: 43304 [2019-12-26 23:04:38,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2019-12-26 23:04:38,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43304 states. [2019-12-26 23:04:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43304 to 27220. [2019-12-26 23:04:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27220 states. [2019-12-26 23:04:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27220 states to 27220 states and 82366 transitions. [2019-12-26 23:04:39,343 INFO L78 Accepts]: Start accepts. Automaton has 27220 states and 82366 transitions. Word has length 64 [2019-12-26 23:04:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:39,343 INFO L462 AbstractCegarLoop]: Abstraction has 27220 states and 82366 transitions. [2019-12-26 23:04:39,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:04:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 27220 states and 82366 transitions. [2019-12-26 23:04:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:04:39,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:39,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:39,371 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:39,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:39,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2115336524, now seen corresponding path program 9 times [2019-12-26 23:04:39,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:39,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903268326] [2019-12-26 23:04:39,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:39,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-26 23:04:39,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903268326] [2019-12-26 23:04:39,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:39,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:04:39,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807433020] [2019-12-26 23:04:39,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:04:39,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:39,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:04:39,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:04:39,463 INFO L87 Difference]: Start difference. First operand 27220 states and 82366 transitions. Second operand 7 states. [2019-12-26 23:04:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:40,595 INFO L93 Difference]: Finished difference Result 39161 states and 118278 transitions. [2019-12-26 23:04:40,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:04:40,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:04:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:40,655 INFO L225 Difference]: With dead ends: 39161 [2019-12-26 23:04:40,655 INFO L226 Difference]: Without dead ends: 39161 [2019-12-26 23:04:40,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:04:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39161 states. [2019-12-26 23:04:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39161 to 26999. [2019-12-26 23:04:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26999 states. [2019-12-26 23:04:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26999 states to 26999 states and 81718 transitions. [2019-12-26 23:04:41,166 INFO L78 Accepts]: Start accepts. Automaton has 26999 states and 81718 transitions. Word has length 64 [2019-12-26 23:04:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:41,166 INFO L462 AbstractCegarLoop]: Abstraction has 26999 states and 81718 transitions. [2019-12-26 23:04:41,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:04:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 26999 states and 81718 transitions. [2019-12-26 23:04:41,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:04:41,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:41,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:41,198 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 576481680, now seen corresponding path program 10 times [2019-12-26 23:04:41,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:41,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841647228] [2019-12-26 23:04:41,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:41,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841647228] [2019-12-26 23:04:41,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:41,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:04:41,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295323881] [2019-12-26 23:04:41,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:04:41,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:41,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:04:41,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:04:41,300 INFO L87 Difference]: Start difference. First operand 26999 states and 81718 transitions. Second operand 5 states. [2019-12-26 23:04:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:41,893 INFO L93 Difference]: Finished difference Result 38088 states and 112998 transitions. [2019-12-26 23:04:41,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:04:41,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-26 23:04:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:41,946 INFO L225 Difference]: With dead ends: 38088 [2019-12-26 23:04:41,947 INFO L226 Difference]: Without dead ends: 37868 [2019-12-26 23:04:41,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:04:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37868 states. [2019-12-26 23:04:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37868 to 32230. [2019-12-26 23:04:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32230 states. [2019-12-26 23:04:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32230 states to 32230 states and 96827 transitions. [2019-12-26 23:04:43,116 INFO L78 Accepts]: Start accepts. Automaton has 32230 states and 96827 transitions. Word has length 64 [2019-12-26 23:04:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:43,116 INFO L462 AbstractCegarLoop]: Abstraction has 32230 states and 96827 transitions. [2019-12-26 23:04:43,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:04:43,116 INFO L276 IsEmpty]: Start isEmpty. Operand 32230 states and 96827 transitions. [2019-12-26 23:04:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:04:43,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:43,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:43,152 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:43,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:43,153 INFO L82 PathProgramCache]: Analyzing trace with hash 883747876, now seen corresponding path program 11 times [2019-12-26 23:04:43,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:43,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919148613] [2019-12-26 23:04:43,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:43,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919148613] [2019-12-26 23:04:43,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:43,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:04:43,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349950278] [2019-12-26 23:04:43,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:04:43,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:43,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:04:43,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:43,213 INFO L87 Difference]: Start difference. First operand 32230 states and 96827 transitions. Second operand 3 states. [2019-12-26 23:04:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:43,331 INFO L93 Difference]: Finished difference Result 32230 states and 96826 transitions. [2019-12-26 23:04:43,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:04:43,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 23:04:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:43,375 INFO L225 Difference]: With dead ends: 32230 [2019-12-26 23:04:43,376 INFO L226 Difference]: Without dead ends: 32230 [2019-12-26 23:04:43,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32230 states. [2019-12-26 23:04:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32230 to 27464. [2019-12-26 23:04:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27464 states. [2019-12-26 23:04:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27464 states to 27464 states and 83359 transitions. [2019-12-26 23:04:43,826 INFO L78 Accepts]: Start accepts. Automaton has 27464 states and 83359 transitions. Word has length 64 [2019-12-26 23:04:43,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:43,827 INFO L462 AbstractCegarLoop]: Abstraction has 27464 states and 83359 transitions. [2019-12-26 23:04:43,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:04:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 27464 states and 83359 transitions. [2019-12-26 23:04:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:04:43,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:43,856 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:43,856 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:43,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:43,857 INFO L82 PathProgramCache]: Analyzing trace with hash 112305005, now seen corresponding path program 1 times [2019-12-26 23:04:43,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:43,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561232562] [2019-12-26 23:04:43,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:43,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561232562] [2019-12-26 23:04:43,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:43,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:04:43,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458633842] [2019-12-26 23:04:43,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:04:43,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:43,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:04:43,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:43,920 INFO L87 Difference]: Start difference. First operand 27464 states and 83359 transitions. Second operand 3 states. [2019-12-26 23:04:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:44,010 INFO L93 Difference]: Finished difference Result 20726 states and 62068 transitions. [2019-12-26 23:04:44,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:04:44,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:04:44,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:44,050 INFO L225 Difference]: With dead ends: 20726 [2019-12-26 23:04:44,051 INFO L226 Difference]: Without dead ends: 20726 [2019-12-26 23:04:44,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20726 states. [2019-12-26 23:04:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20726 to 19928. [2019-12-26 23:04:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19928 states. [2019-12-26 23:04:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19928 states to 19928 states and 59623 transitions. [2019-12-26 23:04:44,573 INFO L78 Accepts]: Start accepts. Automaton has 19928 states and 59623 transitions. Word has length 65 [2019-12-26 23:04:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:44,573 INFO L462 AbstractCegarLoop]: Abstraction has 19928 states and 59623 transitions. [2019-12-26 23:04:44,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:04:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 19928 states and 59623 transitions. [2019-12-26 23:04:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:04:44,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:44,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:44,595 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:44,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:44,595 INFO L82 PathProgramCache]: Analyzing trace with hash -424379593, now seen corresponding path program 1 times [2019-12-26 23:04:44,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:44,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537818047] [2019-12-26 23:04:44,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:44,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537818047] [2019-12-26 23:04:44,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:44,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:04:44,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981000169] [2019-12-26 23:04:44,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:04:44,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:44,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:04:44,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:04:44,700 INFO L87 Difference]: Start difference. First operand 19928 states and 59623 transitions. Second operand 8 states. [2019-12-26 23:04:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:47,093 INFO L93 Difference]: Finished difference Result 28961 states and 85629 transitions. [2019-12-26 23:04:47,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 23:04:47,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-26 23:04:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:47,133 INFO L225 Difference]: With dead ends: 28961 [2019-12-26 23:04:47,133 INFO L226 Difference]: Without dead ends: 28961 [2019-12-26 23:04:47,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:04:47,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28961 states. [2019-12-26 23:04:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28961 to 20669. [2019-12-26 23:04:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20669 states. [2019-12-26 23:04:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20669 states to 20669 states and 61976 transitions. [2019-12-26 23:04:47,492 INFO L78 Accepts]: Start accepts. Automaton has 20669 states and 61976 transitions. Word has length 66 [2019-12-26 23:04:47,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:47,492 INFO L462 AbstractCegarLoop]: Abstraction has 20669 states and 61976 transitions. [2019-12-26 23:04:47,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:04:47,492 INFO L276 IsEmpty]: Start isEmpty. Operand 20669 states and 61976 transitions. [2019-12-26 23:04:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:04:47,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:47,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:47,514 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:47,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:47,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1525087521, now seen corresponding path program 2 times [2019-12-26 23:04:47,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:47,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627551965] [2019-12-26 23:04:47,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:47,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627551965] [2019-12-26 23:04:47,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:47,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 23:04:47,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834581403] [2019-12-26 23:04:47,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:04:47,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:47,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:04:47,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:04:47,875 INFO L87 Difference]: Start difference. First operand 20669 states and 61976 transitions. Second operand 16 states. [2019-12-26 23:04:53,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:53,307 INFO L93 Difference]: Finished difference Result 32838 states and 99277 transitions. [2019-12-26 23:04:53,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-26 23:04:53,308 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-26 23:04:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:53,351 INFO L225 Difference]: With dead ends: 32838 [2019-12-26 23:04:53,351 INFO L226 Difference]: Without dead ends: 29990 [2019-12-26 23:04:53,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=560, Invalid=3100, Unknown=0, NotChecked=0, Total=3660 [2019-12-26 23:04:53,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29990 states. [2019-12-26 23:04:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29990 to 22179. [2019-12-26 23:04:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22179 states. [2019-12-26 23:04:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22179 states to 22179 states and 66535 transitions. [2019-12-26 23:04:54,338 INFO L78 Accepts]: Start accepts. Automaton has 22179 states and 66535 transitions. Word has length 66 [2019-12-26 23:04:54,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:54,338 INFO L462 AbstractCegarLoop]: Abstraction has 22179 states and 66535 transitions. [2019-12-26 23:04:54,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:04:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 22179 states and 66535 transitions. [2019-12-26 23:04:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:04:54,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:54,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:54,361 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:54,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:54,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1636332497, now seen corresponding path program 3 times [2019-12-26 23:04:54,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:54,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558610050] [2019-12-26 23:04:54,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:04:54,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558610050] [2019-12-26 23:04:54,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:54,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 23:04:54,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579424097] [2019-12-26 23:04:54,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 23:04:54,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:54,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 23:04:54,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:04:54,776 INFO L87 Difference]: Start difference. First operand 22179 states and 66535 transitions. Second operand 17 states. [2019-12-26 23:05:01,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:01,612 INFO L93 Difference]: Finished difference Result 38880 states and 116529 transitions. [2019-12-26 23:05:01,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-26 23:05:01,612 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-26 23:05:01,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:01,666 INFO L225 Difference]: With dead ends: 38880 [2019-12-26 23:05:01,666 INFO L226 Difference]: Without dead ends: 37945 [2019-12-26 23:05:01,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2226 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=922, Invalid=5884, Unknown=0, NotChecked=0, Total=6806 [2019-12-26 23:05:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37945 states. [2019-12-26 23:05:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37945 to 22565. [2019-12-26 23:05:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22565 states. [2019-12-26 23:05:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22565 states to 22565 states and 67649 transitions. [2019-12-26 23:05:02,696 INFO L78 Accepts]: Start accepts. Automaton has 22565 states and 67649 transitions. Word has length 66 [2019-12-26 23:05:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:02,696 INFO L462 AbstractCegarLoop]: Abstraction has 22565 states and 67649 transitions. [2019-12-26 23:05:02,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 23:05:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 22565 states and 67649 transitions. [2019-12-26 23:05:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:05:02,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:02,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:02,719 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:02,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1737702309, now seen corresponding path program 4 times [2019-12-26 23:05:02,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:02,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052998760] [2019-12-26 23:05:02,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:03,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052998760] [2019-12-26 23:05:03,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:03,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 23:05:03,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108026330] [2019-12-26 23:05:03,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 23:05:03,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:03,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 23:05:03,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:05:03,248 INFO L87 Difference]: Start difference. First operand 22565 states and 67649 transitions. Second operand 17 states. [2019-12-26 23:05:10,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:10,554 INFO L93 Difference]: Finished difference Result 34583 states and 104385 transitions. [2019-12-26 23:05:10,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-12-26 23:05:10,554 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-26 23:05:10,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:10,602 INFO L225 Difference]: With dead ends: 34583 [2019-12-26 23:05:10,602 INFO L226 Difference]: Without dead ends: 33904 [2019-12-26 23:05:10,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2321 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=842, Invalid=6298, Unknown=0, NotChecked=0, Total=7140 [2019-12-26 23:05:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33904 states. [2019-12-26 23:05:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33904 to 22730. [2019-12-26 23:05:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22730 states. [2019-12-26 23:05:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22730 states to 22730 states and 68174 transitions. [2019-12-26 23:05:12,271 INFO L78 Accepts]: Start accepts. Automaton has 22730 states and 68174 transitions. Word has length 66 [2019-12-26 23:05:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:12,271 INFO L462 AbstractCegarLoop]: Abstraction has 22730 states and 68174 transitions. [2019-12-26 23:05:12,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 23:05:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 22730 states and 68174 transitions. [2019-12-26 23:05:12,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:05:12,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:12,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:12,294 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:12,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:12,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1858321725, now seen corresponding path program 5 times [2019-12-26 23:05:12,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:12,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198824897] [2019-12-26 23:05:12,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:12,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198824897] [2019-12-26 23:05:12,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:12,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 23:05:12,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402530162] [2019-12-26 23:05:12,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 23:05:12,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:12,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 23:05:12,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:05:12,685 INFO L87 Difference]: Start difference. First operand 22730 states and 68174 transitions. Second operand 17 states. [2019-12-26 23:05:20,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:20,247 INFO L93 Difference]: Finished difference Result 34636 states and 104166 transitions. [2019-12-26 23:05:20,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-26 23:05:20,248 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-26 23:05:20,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:20,297 INFO L225 Difference]: With dead ends: 34636 [2019-12-26 23:05:20,297 INFO L226 Difference]: Without dead ends: 34527 [2019-12-26 23:05:20,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2190 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=845, Invalid=5961, Unknown=0, NotChecked=0, Total=6806 [2019-12-26 23:05:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34527 states. [2019-12-26 23:05:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34527 to 22348. [2019-12-26 23:05:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22348 states. [2019-12-26 23:05:20,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22348 states to 22348 states and 67016 transitions. [2019-12-26 23:05:20,869 INFO L78 Accepts]: Start accepts. Automaton has 22348 states and 67016 transitions. Word has length 66 [2019-12-26 23:05:20,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:20,870 INFO L462 AbstractCegarLoop]: Abstraction has 22348 states and 67016 transitions. [2019-12-26 23:05:20,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 23:05:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 22348 states and 67016 transitions. [2019-12-26 23:05:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:05:20,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:20,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:20,895 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:20,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1228934255, now seen corresponding path program 6 times [2019-12-26 23:05:20,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:20,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462804865] [2019-12-26 23:05:20,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:21,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462804865] [2019-12-26 23:05:21,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:21,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:05:21,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856410472] [2019-12-26 23:05:21,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:05:21,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:21,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:05:21,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:05:21,241 INFO L87 Difference]: Start difference. First operand 22348 states and 67016 transitions. Second operand 14 states. [2019-12-26 23:05:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:22,695 INFO L93 Difference]: Finished difference Result 29060 states and 86401 transitions. [2019-12-26 23:05:22,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 23:05:22,696 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-26 23:05:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:22,734 INFO L225 Difference]: With dead ends: 29060 [2019-12-26 23:05:22,734 INFO L226 Difference]: Without dead ends: 26637 [2019-12-26 23:05:22,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-12-26 23:05:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26637 states. [2019-12-26 23:05:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26637 to 23054. [2019-12-26 23:05:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23054 states. [2019-12-26 23:05:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23054 states to 23054 states and 69094 transitions. [2019-12-26 23:05:23,075 INFO L78 Accepts]: Start accepts. Automaton has 23054 states and 69094 transitions. Word has length 66 [2019-12-26 23:05:23,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:23,075 INFO L462 AbstractCegarLoop]: Abstraction has 23054 states and 69094 transitions. [2019-12-26 23:05:23,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:05:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 23054 states and 69094 transitions. [2019-12-26 23:05:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:05:23,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:23,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:23,100 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:23,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1155944081, now seen corresponding path program 7 times [2019-12-26 23:05:23,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:23,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190635154] [2019-12-26 23:05:23,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:23,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190635154] [2019-12-26 23:05:23,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:23,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:05:23,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616173487] [2019-12-26 23:05:23,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:05:23,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:23,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:05:23,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:05:23,221 INFO L87 Difference]: Start difference. First operand 23054 states and 69094 transitions. Second operand 9 states. [2019-12-26 23:05:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:24,768 INFO L93 Difference]: Finished difference Result 42249 states and 126007 transitions. [2019-12-26 23:05:24,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 23:05:24,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 23:05:24,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:24,817 INFO L225 Difference]: With dead ends: 42249 [2019-12-26 23:05:24,818 INFO L226 Difference]: Without dead ends: 34321 [2019-12-26 23:05:24,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:05:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34321 states. [2019-12-26 23:05:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34321 to 22611. [2019-12-26 23:05:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22611 states. [2019-12-26 23:05:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22611 states to 22611 states and 67280 transitions. [2019-12-26 23:05:25,540 INFO L78 Accepts]: Start accepts. Automaton has 22611 states and 67280 transitions. Word has length 66 [2019-12-26 23:05:25,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:25,540 INFO L462 AbstractCegarLoop]: Abstraction has 22611 states and 67280 transitions. [2019-12-26 23:05:25,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:05:25,540 INFO L276 IsEmpty]: Start isEmpty. Operand 22611 states and 67280 transitions. [2019-12-26 23:05:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:05:25,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:25,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:25,564 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:25,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:25,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1730997117, now seen corresponding path program 8 times [2019-12-26 23:05:25,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:25,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710751379] [2019-12-26 23:05:25,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:25,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710751379] [2019-12-26 23:05:25,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:25,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:05:25,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342332271] [2019-12-26 23:05:25,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:05:25,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:25,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:05:25,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:05:25,675 INFO L87 Difference]: Start difference. First operand 22611 states and 67280 transitions. Second operand 9 states. [2019-12-26 23:05:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:26,819 INFO L93 Difference]: Finished difference Result 36896 states and 109362 transitions. [2019-12-26 23:05:26,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:05:26,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 23:05:26,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:26,866 INFO L225 Difference]: With dead ends: 36896 [2019-12-26 23:05:26,866 INFO L226 Difference]: Without dead ends: 33572 [2019-12-26 23:05:26,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:05:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33572 states. [2019-12-26 23:05:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33572 to 21963. [2019-12-26 23:05:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21963 states. [2019-12-26 23:05:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21963 states to 21963 states and 65275 transitions. [2019-12-26 23:05:27,270 INFO L78 Accepts]: Start accepts. Automaton has 21963 states and 65275 transitions. Word has length 66 [2019-12-26 23:05:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:27,270 INFO L462 AbstractCegarLoop]: Abstraction has 21963 states and 65275 transitions. [2019-12-26 23:05:27,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:05:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 21963 states and 65275 transitions. [2019-12-26 23:05:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:05:27,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:27,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:27,291 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:27,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:27,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1799648743, now seen corresponding path program 9 times [2019-12-26 23:05:27,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:27,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385386051] [2019-12-26 23:05:27,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:27,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385386051] [2019-12-26 23:05:27,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:27,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:05:27,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804911553] [2019-12-26 23:05:27,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:05:27,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:27,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:05:27,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:05:27,420 INFO L87 Difference]: Start difference. First operand 21963 states and 65275 transitions. Second operand 10 states. [2019-12-26 23:05:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:28,815 INFO L93 Difference]: Finished difference Result 30377 states and 89007 transitions. [2019-12-26 23:05:28,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 23:05:28,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 23:05:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:28,853 INFO L225 Difference]: With dead ends: 30377 [2019-12-26 23:05:28,853 INFO L226 Difference]: Without dead ends: 27438 [2019-12-26 23:05:28,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:05:28,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27438 states. [2019-12-26 23:05:29,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27438 to 22341. [2019-12-26 23:05:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22341 states. [2019-12-26 23:05:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22341 states to 22341 states and 66135 transitions. [2019-12-26 23:05:29,196 INFO L78 Accepts]: Start accepts. Automaton has 22341 states and 66135 transitions. Word has length 66 [2019-12-26 23:05:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:29,196 INFO L462 AbstractCegarLoop]: Abstraction has 22341 states and 66135 transitions. [2019-12-26 23:05:29,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:05:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 22341 states and 66135 transitions. [2019-12-26 23:05:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:05:29,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:29,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:29,218 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:29,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:29,218 INFO L82 PathProgramCache]: Analyzing trace with hash 925576671, now seen corresponding path program 10 times [2019-12-26 23:05:29,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:29,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517952375] [2019-12-26 23:05:29,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:29,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517952375] [2019-12-26 23:05:29,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:29,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:05:29,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042735549] [2019-12-26 23:05:29,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:05:29,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:29,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:05:29,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:05:29,392 INFO L87 Difference]: Start difference. First operand 22341 states and 66135 transitions. Second operand 10 states. [2019-12-26 23:05:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:31,630 INFO L93 Difference]: Finished difference Result 32354 states and 93850 transitions. [2019-12-26 23:05:31,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:05:31,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 23:05:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:31,672 INFO L225 Difference]: With dead ends: 32354 [2019-12-26 23:05:31,672 INFO L226 Difference]: Without dead ends: 32354 [2019-12-26 23:05:31,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2019-12-26 23:05:31,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32354 states. [2019-12-26 23:05:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32354 to 21122. [2019-12-26 23:05:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21122 states. [2019-12-26 23:05:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21122 states to 21122 states and 62003 transitions. [2019-12-26 23:05:32,067 INFO L78 Accepts]: Start accepts. Automaton has 21122 states and 62003 transitions. Word has length 66 [2019-12-26 23:05:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:32,068 INFO L462 AbstractCegarLoop]: Abstraction has 21122 states and 62003 transitions. [2019-12-26 23:05:32,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:05:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 21122 states and 62003 transitions. [2019-12-26 23:05:32,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:05:32,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:32,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:32,091 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:32,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:32,091 INFO L82 PathProgramCache]: Analyzing trace with hash -303516839, now seen corresponding path program 11 times [2019-12-26 23:05:32,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:32,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850368742] [2019-12-26 23:05:32,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:32,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850368742] [2019-12-26 23:05:32,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:32,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:05:32,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358707002] [2019-12-26 23:05:32,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:05:32,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:32,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:05:32,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:05:32,242 INFO L87 Difference]: Start difference. First operand 21122 states and 62003 transitions. Second operand 10 states. [2019-12-26 23:05:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:33,514 INFO L93 Difference]: Finished difference Result 25354 states and 74317 transitions. [2019-12-26 23:05:33,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 23:05:33,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 23:05:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:33,557 INFO L225 Difference]: With dead ends: 25354 [2019-12-26 23:05:33,557 INFO L226 Difference]: Without dead ends: 23696 [2019-12-26 23:05:33,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:05:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23696 states. [2019-12-26 23:05:33,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23696 to 21596. [2019-12-26 23:05:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21596 states. [2019-12-26 23:05:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21596 states to 21596 states and 63208 transitions. [2019-12-26 23:05:33,881 INFO L78 Accepts]: Start accepts. Automaton has 21596 states and 63208 transitions. Word has length 66 [2019-12-26 23:05:33,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:33,882 INFO L462 AbstractCegarLoop]: Abstraction has 21596 states and 63208 transitions. [2019-12-26 23:05:33,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:05:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 21596 states and 63208 transitions. [2019-12-26 23:05:33,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:05:33,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:33,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:33,906 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:33,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:33,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1265051241, now seen corresponding path program 12 times [2019-12-26 23:05:33,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:33,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319522095] [2019-12-26 23:05:33,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:34,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319522095] [2019-12-26 23:05:34,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:34,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:05:34,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974812367] [2019-12-26 23:05:34,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:05:34,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:34,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:05:34,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:05:34,035 INFO L87 Difference]: Start difference. First operand 21596 states and 63208 transitions. Second operand 10 states. [2019-12-26 23:05:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:35,087 INFO L93 Difference]: Finished difference Result 26270 states and 76377 transitions. [2019-12-26 23:05:35,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:05:35,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 23:05:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:35,121 INFO L225 Difference]: With dead ends: 26270 [2019-12-26 23:05:35,122 INFO L226 Difference]: Without dead ends: 24440 [2019-12-26 23:05:35,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:05:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24440 states. [2019-12-26 23:05:35,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24440 to 21226. [2019-12-26 23:05:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21226 states. [2019-12-26 23:05:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21226 states to 21226 states and 62229 transitions. [2019-12-26 23:05:35,443 INFO L78 Accepts]: Start accepts. Automaton has 21226 states and 62229 transitions. Word has length 66 [2019-12-26 23:05:35,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:35,444 INFO L462 AbstractCegarLoop]: Abstraction has 21226 states and 62229 transitions. [2019-12-26 23:05:35,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:05:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 21226 states and 62229 transitions. [2019-12-26 23:05:35,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:05:35,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:35,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:35,467 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:35,467 INFO L82 PathProgramCache]: Analyzing trace with hash -794198999, now seen corresponding path program 13 times [2019-12-26 23:05:35,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:35,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885438492] [2019-12-26 23:05:35,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:35,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885438492] [2019-12-26 23:05:35,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:35,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:05:35,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487653447] [2019-12-26 23:05:35,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:05:35,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:35,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:05:35,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:05:35,973 INFO L87 Difference]: Start difference. First operand 21226 states and 62229 transitions. Second operand 13 states. [2019-12-26 23:05:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:40,382 INFO L93 Difference]: Finished difference Result 46644 states and 136002 transitions. [2019-12-26 23:05:40,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-26 23:05:40,382 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-26 23:05:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:40,442 INFO L225 Difference]: With dead ends: 46644 [2019-12-26 23:05:40,442 INFO L226 Difference]: Without dead ends: 43880 [2019-12-26 23:05:40,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=2505, Unknown=0, NotChecked=0, Total=2970 [2019-12-26 23:05:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43880 states. [2019-12-26 23:05:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43880 to 23154. [2019-12-26 23:05:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23154 states. [2019-12-26 23:05:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23154 states to 23154 states and 67463 transitions. [2019-12-26 23:05:40,914 INFO L78 Accepts]: Start accepts. Automaton has 23154 states and 67463 transitions. Word has length 66 [2019-12-26 23:05:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:40,914 INFO L462 AbstractCegarLoop]: Abstraction has 23154 states and 67463 transitions. [2019-12-26 23:05:40,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:05:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 23154 states and 67463 transitions. [2019-12-26 23:05:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:05:40,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:40,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:40,937 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:40,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:40,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1471163297, now seen corresponding path program 14 times [2019-12-26 23:05:40,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:40,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645260742] [2019-12-26 23:05:40,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:41,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645260742] [2019-12-26 23:05:41,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:41,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:05:41,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826466072] [2019-12-26 23:05:41,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:05:41,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:41,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:05:41,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:05:41,187 INFO L87 Difference]: Start difference. First operand 23154 states and 67463 transitions. Second operand 13 states. [2019-12-26 23:05:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:45,015 INFO L93 Difference]: Finished difference Result 44423 states and 128306 transitions. [2019-12-26 23:05:45,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-26 23:05:45,015 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-26 23:05:45,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:45,066 INFO L225 Difference]: With dead ends: 44423 [2019-12-26 23:05:45,067 INFO L226 Difference]: Without dead ends: 38705 [2019-12-26 23:05:45,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=413, Invalid=1749, Unknown=0, NotChecked=0, Total=2162 [2019-12-26 23:05:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38705 states. [2019-12-26 23:05:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38705 to 20309. [2019-12-26 23:05:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20309 states. [2019-12-26 23:05:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20309 states to 20309 states and 59744 transitions. [2019-12-26 23:05:45,471 INFO L78 Accepts]: Start accepts. Automaton has 20309 states and 59744 transitions. Word has length 66 [2019-12-26 23:05:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:45,472 INFO L462 AbstractCegarLoop]: Abstraction has 20309 states and 59744 transitions. [2019-12-26 23:05:45,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:05:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 20309 states and 59744 transitions. [2019-12-26 23:05:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:05:45,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:45,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:45,492 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash 328971281, now seen corresponding path program 15 times [2019-12-26 23:05:45,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:45,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903840031] [2019-12-26 23:05:45,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:45,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903840031] [2019-12-26 23:05:45,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:45,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:05:45,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64649475] [2019-12-26 23:05:45,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:05:45,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:45,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:05:45,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:05:45,617 INFO L87 Difference]: Start difference. First operand 20309 states and 59744 transitions. Second operand 5 states. [2019-12-26 23:05:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:45,739 INFO L93 Difference]: Finished difference Result 23794 states and 70119 transitions. [2019-12-26 23:05:45,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:05:45,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-26 23:05:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:45,769 INFO L225 Difference]: With dead ends: 23794 [2019-12-26 23:05:45,769 INFO L226 Difference]: Without dead ends: 23794 [2019-12-26 23:05:45,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:05:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23794 states. [2019-12-26 23:05:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23794 to 18456. [2019-12-26 23:05:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18456 states. [2019-12-26 23:05:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18456 states to 18456 states and 54719 transitions. [2019-12-26 23:05:46,066 INFO L78 Accepts]: Start accepts. Automaton has 18456 states and 54719 transitions. Word has length 66 [2019-12-26 23:05:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:46,067 INFO L462 AbstractCegarLoop]: Abstraction has 18456 states and 54719 transitions. [2019-12-26 23:05:46,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:05:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 18456 states and 54719 transitions. [2019-12-26 23:05:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:05:46,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:46,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:46,085 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:46,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:46,085 INFO L82 PathProgramCache]: Analyzing trace with hash -357179172, now seen corresponding path program 1 times [2019-12-26 23:05:46,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:46,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841770020] [2019-12-26 23:05:46,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:46,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841770020] [2019-12-26 23:05:46,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:46,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 23:05:46,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576402287] [2019-12-26 23:05:46,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:05:46,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:46,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:05:46,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:05:46,577 INFO L87 Difference]: Start difference. First operand 18456 states and 54719 transitions. Second operand 16 states. [2019-12-26 23:05:50,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:50,019 INFO L93 Difference]: Finished difference Result 25438 states and 74126 transitions. [2019-12-26 23:05:50,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-26 23:05:50,019 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-26 23:05:50,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:50,051 INFO L225 Difference]: With dead ends: 25438 [2019-12-26 23:05:50,051 INFO L226 Difference]: Without dead ends: 23987 [2019-12-26 23:05:50,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 23:05:50,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23987 states. [2019-12-26 23:05:50,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23987 to 18540. [2019-12-26 23:05:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18540 states. [2019-12-26 23:05:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18540 states to 18540 states and 54913 transitions. [2019-12-26 23:05:50,331 INFO L78 Accepts]: Start accepts. Automaton has 18540 states and 54913 transitions. Word has length 67 [2019-12-26 23:05:50,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:50,331 INFO L462 AbstractCegarLoop]: Abstraction has 18540 states and 54913 transitions. [2019-12-26 23:05:50,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:05:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 18540 states and 54913 transitions. [2019-12-26 23:05:50,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:05:50,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:50,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:50,349 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:50,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:50,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1972634574, now seen corresponding path program 2 times [2019-12-26 23:05:50,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:50,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603083282] [2019-12-26 23:05:50,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:50,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603083282] [2019-12-26 23:05:50,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:50,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:05:50,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067532094] [2019-12-26 23:05:50,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:05:50,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:50,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:05:50,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:05:50,453 INFO L87 Difference]: Start difference. First operand 18540 states and 54913 transitions. Second operand 6 states. [2019-12-26 23:05:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:51,257 INFO L93 Difference]: Finished difference Result 26107 states and 76299 transitions. [2019-12-26 23:05:51,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:05:51,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-26 23:05:51,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:51,293 INFO L225 Difference]: With dead ends: 26107 [2019-12-26 23:05:51,294 INFO L226 Difference]: Without dead ends: 26107 [2019-12-26 23:05:51,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:05:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26107 states. [2019-12-26 23:05:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26107 to 19489. [2019-12-26 23:05:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19489 states. [2019-12-26 23:05:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19489 states to 19489 states and 57609 transitions. [2019-12-26 23:05:51,616 INFO L78 Accepts]: Start accepts. Automaton has 19489 states and 57609 transitions. Word has length 67 [2019-12-26 23:05:51,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:51,616 INFO L462 AbstractCegarLoop]: Abstraction has 19489 states and 57609 transitions. [2019-12-26 23:05:51,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:05:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 19489 states and 57609 transitions. [2019-12-26 23:05:51,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:05:51,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:51,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:51,634 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:51,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:51,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1909717286, now seen corresponding path program 1 times [2019-12-26 23:05:51,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:51,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403023532] [2019-12-26 23:05:51,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:51,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403023532] [2019-12-26 23:05:51,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:51,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:05:51,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416952750] [2019-12-26 23:05:51,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:05:51,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:05:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:05:51,773 INFO L87 Difference]: Start difference. First operand 19489 states and 57609 transitions. Second operand 9 states. [2019-12-26 23:05:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:54,372 INFO L93 Difference]: Finished difference Result 44257 states and 127470 transitions. [2019-12-26 23:05:54,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 23:05:54,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-26 23:05:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:54,432 INFO L225 Difference]: With dead ends: 44257 [2019-12-26 23:05:54,432 INFO L226 Difference]: Without dead ends: 44257 [2019-12-26 23:05:54,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2019-12-26 23:05:54,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44257 states. [2019-12-26 23:05:54,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44257 to 19774. [2019-12-26 23:05:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19774 states. [2019-12-26 23:05:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19774 states to 19774 states and 58440 transitions. [2019-12-26 23:05:54,899 INFO L78 Accepts]: Start accepts. Automaton has 19774 states and 58440 transitions. Word has length 67 [2019-12-26 23:05:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:54,899 INFO L462 AbstractCegarLoop]: Abstraction has 19774 states and 58440 transitions. [2019-12-26 23:05:54,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:05:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 19774 states and 58440 transitions. [2019-12-26 23:05:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:05:54,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:54,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:54,921 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:54,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:54,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1455928856, now seen corresponding path program 3 times [2019-12-26 23:05:54,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:54,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121300350] [2019-12-26 23:05:54,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:55,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121300350] [2019-12-26 23:05:55,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:55,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:05:55,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476453767] [2019-12-26 23:05:55,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:05:55,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:55,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:05:55,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:05:55,234 INFO L87 Difference]: Start difference. First operand 19774 states and 58440 transitions. Second operand 7 states. [2019-12-26 23:05:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:56,797 INFO L93 Difference]: Finished difference Result 26987 states and 78709 transitions. [2019-12-26 23:05:56,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 23:05:56,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-26 23:05:56,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:56,835 INFO L225 Difference]: With dead ends: 26987 [2019-12-26 23:05:56,835 INFO L226 Difference]: Without dead ends: 26987 [2019-12-26 23:05:56,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:05:56,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26987 states. [2019-12-26 23:05:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26987 to 17986. [2019-12-26 23:05:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17986 states. [2019-12-26 23:05:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17986 states to 17986 states and 53358 transitions. [2019-12-26 23:05:57,159 INFO L78 Accepts]: Start accepts. Automaton has 17986 states and 53358 transitions. Word has length 67 [2019-12-26 23:05:57,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:57,159 INFO L462 AbstractCegarLoop]: Abstraction has 17986 states and 53358 transitions. [2019-12-26 23:05:57,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:05:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 17986 states and 53358 transitions. [2019-12-26 23:05:57,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:05:57,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:57,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:57,178 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:57,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:57,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1145475155, now seen corresponding path program 1 times [2019-12-26 23:05:57,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:57,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343381657] [2019-12-26 23:05:57,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:57,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:57,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343381657] [2019-12-26 23:05:57,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:57,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 23:05:57,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196317108] [2019-12-26 23:05:57,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:05:57,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:57,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:05:57,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:05:57,630 INFO L87 Difference]: Start difference. First operand 17986 states and 53358 transitions. Second operand 16 states. [2019-12-26 23:06:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:02,031 INFO L93 Difference]: Finished difference Result 35022 states and 102809 transitions. [2019-12-26 23:06:02,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-26 23:06:02,032 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-26 23:06:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:02,076 INFO L225 Difference]: With dead ends: 35022 [2019-12-26 23:06:02,076 INFO L226 Difference]: Without dead ends: 33967 [2019-12-26 23:06:02,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=472, Invalid=2498, Unknown=0, NotChecked=0, Total=2970 [2019-12-26 23:06:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33967 states. [2019-12-26 23:06:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33967 to 17998. [2019-12-26 23:06:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17998 states. [2019-12-26 23:06:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17998 states to 17998 states and 53366 transitions. [2019-12-26 23:06:02,432 INFO L78 Accepts]: Start accepts. Automaton has 17998 states and 53366 transitions. Word has length 67 [2019-12-26 23:06:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:02,432 INFO L462 AbstractCegarLoop]: Abstraction has 17998 states and 53366 transitions. [2019-12-26 23:06:02,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:06:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 17998 states and 53366 transitions. [2019-12-26 23:06:02,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:06:02,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:02,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:02,451 INFO L410 AbstractCegarLoop]: === Iteration 50 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:06:02,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:02,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1689948735, now seen corresponding path program 2 times [2019-12-26 23:06:02,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:02,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500974276] [2019-12-26 23:06:02,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:03,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500974276] [2019-12-26 23:06:03,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:03,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 23:06:03,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448760198] [2019-12-26 23:06:03,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:06:03,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:03,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:06:03,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:06:03,094 INFO L87 Difference]: Start difference. First operand 17998 states and 53366 transitions. Second operand 16 states. [2019-12-26 23:06:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:07,079 INFO L93 Difference]: Finished difference Result 34044 states and 100063 transitions. [2019-12-26 23:06:07,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-26 23:06:07,079 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-26 23:06:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:07,124 INFO L225 Difference]: With dead ends: 34044 [2019-12-26 23:06:07,124 INFO L226 Difference]: Without dead ends: 33601 [2019-12-26 23:06:07,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=455, Invalid=2407, Unknown=0, NotChecked=0, Total=2862 [2019-12-26 23:06:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33601 states. [2019-12-26 23:06:07,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33601 to 17822. [2019-12-26 23:06:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17822 states. [2019-12-26 23:06:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17822 states to 17822 states and 52902 transitions. [2019-12-26 23:06:07,485 INFO L78 Accepts]: Start accepts. Automaton has 17822 states and 52902 transitions. Word has length 67 [2019-12-26 23:06:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:07,486 INFO L462 AbstractCegarLoop]: Abstraction has 17822 states and 52902 transitions. [2019-12-26 23:06:07,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:06:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 17822 states and 52902 transitions. [2019-12-26 23:06:07,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:06:07,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:07,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:07,504 INFO L410 AbstractCegarLoop]: === Iteration 51 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:06:07,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:07,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1559792005, now seen corresponding path program 3 times [2019-12-26 23:06:07,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:07,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335030384] [2019-12-26 23:06:07,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:07,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:07,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335030384] [2019-12-26 23:06:07,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:07,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:06:07,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060080593] [2019-12-26 23:06:07,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:06:07,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:07,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:06:07,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:06:07,686 INFO L87 Difference]: Start difference. First operand 17822 states and 52902 transitions. Second operand 11 states. [2019-12-26 23:06:08,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:08,864 INFO L93 Difference]: Finished difference Result 36715 states and 109379 transitions. [2019-12-26 23:06:08,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 23:06:08,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 23:06:08,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:08,907 INFO L225 Difference]: With dead ends: 36715 [2019-12-26 23:06:08,907 INFO L226 Difference]: Without dead ends: 30160 [2019-12-26 23:06:08,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2019-12-26 23:06:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30160 states. [2019-12-26 23:06:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30160 to 16786. [2019-12-26 23:06:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16786 states. [2019-12-26 23:06:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16786 states to 16786 states and 50182 transitions. [2019-12-26 23:06:09,242 INFO L78 Accepts]: Start accepts. Automaton has 16786 states and 50182 transitions. Word has length 67 [2019-12-26 23:06:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:09,242 INFO L462 AbstractCegarLoop]: Abstraction has 16786 states and 50182 transitions. [2019-12-26 23:06:09,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:06:09,243 INFO L276 IsEmpty]: Start isEmpty. Operand 16786 states and 50182 transitions. [2019-12-26 23:06:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:06:09,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:09,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:09,261 INFO L410 AbstractCegarLoop]: === Iteration 52 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:06:09,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash 190726530, now seen corresponding path program 4 times [2019-12-26 23:06:09,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:09,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553789641] [2019-12-26 23:06:09,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:06:09,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:06:09,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553789641] [2019-12-26 23:06:09,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:06:09,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:06:09,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143634868] [2019-12-26 23:06:09,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:06:09,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:06:09,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:06:09,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:06:09,367 INFO L87 Difference]: Start difference. First operand 16786 states and 50182 transitions. Second operand 5 states. [2019-12-26 23:06:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:06:09,636 INFO L93 Difference]: Finished difference Result 16670 states and 49576 transitions. [2019-12-26 23:06:09,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:06:09,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-26 23:06:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:06:09,657 INFO L225 Difference]: With dead ends: 16670 [2019-12-26 23:06:09,657 INFO L226 Difference]: Without dead ends: 16670 [2019-12-26 23:06:09,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:06:09,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16670 states. [2019-12-26 23:06:09,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16670 to 15263. [2019-12-26 23:06:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15263 states. [2019-12-26 23:06:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15263 states to 15263 states and 45318 transitions. [2019-12-26 23:06:09,905 INFO L78 Accepts]: Start accepts. Automaton has 15263 states and 45318 transitions. Word has length 67 [2019-12-26 23:06:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:06:09,905 INFO L462 AbstractCegarLoop]: Abstraction has 15263 states and 45318 transitions. [2019-12-26 23:06:09,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:06:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 15263 states and 45318 transitions. [2019-12-26 23:06:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:06:09,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:06:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:06:09,922 INFO L410 AbstractCegarLoop]: === Iteration 53 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:06:09,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:06:09,923 INFO L82 PathProgramCache]: Analyzing trace with hash -778064925, now seen corresponding path program 4 times [2019-12-26 23:06:09,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:06:09,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144534664] [2019-12-26 23:06:09,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:06:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:06:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:06:10,038 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:06:10,038 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:06:10,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= v_~z$r_buff0_thd0~0_144 0) (= v_~z$r_buff0_thd1~0_230 0) (= v_~z$w_buff0_used~0_947 0) (= v_~z$r_buff1_thd1~0_185 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_563 0) (= v_~weak$$choice2~0_147 0) (= 0 v_~z$r_buff1_thd3~0_352) (= 0 v_~x~0_159) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed~0_6 0) (= v_~z$mem_tmp~0_24 0) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t1489~0.base_44| 1)) (= v_~z$r_buff0_thd2~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1489~0.base_44| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1489~0.base_44|) |v_ULTIMATE.start_main_~#t1489~0.offset_28| 0)) |v_#memory_int_19|) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_155 0) (= |v_ULTIMATE.start_main_~#t1489~0.offset_28| 0) (= v_~z$r_buff1_thd2~0_201 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1489~0.base_44|)) (= 0 v_~z$r_buff0_thd3~0_371) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1489~0.base_44|) (= v_~main$tmp_guard1~0_38 0) (= v_~z$r_buff1_thd0~0_199 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1489~0.base_44| 4) |v_#length_21|) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_19) (= v_~z$w_buff1~0_328 0) (= v_~z~0_152 0) (= v_~z$w_buff0~0_540 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$flush_delayed~0_35) (= v_~y~0_49 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1490~0.base=|v_ULTIMATE.start_main_~#t1490~0.base_44|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_201, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_59|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_328, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_37|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_99|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_75|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_199, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_126, ULTIMATE.start_main_~#t1491~0.base=|v_ULTIMATE.start_main_~#t1491~0.base_25|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_~#t1489~0.base=|v_ULTIMATE.start_main_~#t1489~0.base_44|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_947, ~z$w_buff0~0=v_~z$w_buff0~0_540, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_352, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_563, ULTIMATE.start_main_~#t1491~0.offset=|v_ULTIMATE.start_main_~#t1491~0.offset_18|, ~z$flush_delayed~0=v_~z$flush_delayed~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t1489~0.offset=|v_ULTIMATE.start_main_~#t1489~0.offset_28|, #NULL.base=|v_#NULL.base_7|, ~weak$$choice0~0=v_~weak$$choice0~0_19, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_80|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_185, #memory_int=|v_#memory_int_19|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, ULTIMATE.start_main_~#t1490~0.offset=|v_ULTIMATE.start_main_~#t1490~0.offset_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~z~0=v_~z~0_152, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_230, ~x~0=v_~x~0_159} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1490~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1491~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1489~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1491~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1489~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t1490~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-26 23:06:10,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1490~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1490~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1490~0.base_13|) |v_ULTIMATE.start_main_~#t1490~0.offset_11| 1)) |v_#memory_int_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1490~0.base_13| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t1490~0.base_13| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1490~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1490~0.base_13| 1) |v_#valid_36|) (= 0 |v_ULTIMATE.start_main_~#t1490~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1490~0.base=|v_ULTIMATE.start_main_~#t1490~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1490~0.offset=|v_ULTIMATE.start_main_~#t1490~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1490~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1490~0.offset, #length] because there is no mapped edge [2019-12-26 23:06:10,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1491~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1491~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1491~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1491~0.base_13| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1491~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1491~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1491~0.base_13|) |v_ULTIMATE.start_main_~#t1491~0.offset_11| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1491~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1491~0.offset=|v_ULTIMATE.start_main_~#t1491~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1491~0.base=|v_ULTIMATE.start_main_~#t1491~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1491~0.offset, #length, ULTIMATE.start_main_~#t1491~0.base] because there is no mapped edge [2019-12-26 23:06:10,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_163 v_~z$w_buff1_used~0_112) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= v_~z$w_buff0~0_38 v_~z$w_buff1~0_37) (= v_P0Thread1of1ForFork0_~arg.base_14 |v_P0Thread1of1ForFork0_#in~arg.base_14|) (= v_~z$w_buff0_used~0_162 1) (= 1 v_~z$w_buff0~0_37) (= v_P0Thread1of1ForFork0_~arg.offset_14 |v_P0Thread1of1ForFork0_#in~arg.offset_14|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= (mod v_~z$w_buff1_used~0_112 256) 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_163, ~z$w_buff0~0=v_~z$w_buff0~0_38, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_162, ~z$w_buff0~0=v_~z$w_buff0~0_37, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|, ~z$w_buff1~0=v_~z$w_buff1~0_37, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_14, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_14} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 23:06:10,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1160618584 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out1160618584| |P2Thread1of1ForFork2_#t~ite21_Out1160618584|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1160618584 256) 0))) (or (and .cse0 (= (mod ~z$r_buff1_thd3~0_In1160618584 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1160618584 256)) (and (= (mod ~z$w_buff1_used~0_In1160618584 256) 0) .cse0))) (= |P2Thread1of1ForFork2_#t~ite20_Out1160618584| ~z$w_buff0~0_In1160618584) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite20_In1160618584| |P2Thread1of1ForFork2_#t~ite20_Out1160618584|) (not .cse1) (= ~z$w_buff0~0_In1160618584 |P2Thread1of1ForFork2_#t~ite21_Out1160618584|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1160618584, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1160618584, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In1160618584|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1160618584, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1160618584, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1160618584, ~weak$$choice2~0=~weak$$choice2~0_In1160618584} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1160618584, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1160618584|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1160618584, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out1160618584|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1160618584, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1160618584, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1160618584, ~weak$$choice2~0=~weak$$choice2~0_In1160618584} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 23:06:10,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L762-2-->L762-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1760992815 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1760992815 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-1760992815| |P1Thread1of1ForFork1_#t~ite10_Out-1760992815|))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1760992815| ~z~0_In-1760992815) .cse2) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1760992815| ~z$w_buff1~0_In-1760992815) (not .cse0) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1760992815, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1760992815, ~z$w_buff1~0=~z$w_buff1~0_In-1760992815, ~z~0=~z~0_In-1760992815} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1760992815|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1760992815, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1760992815, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1760992815|, ~z$w_buff1~0=~z$w_buff1~0_In-1760992815, ~z~0=~z~0_In-1760992815} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-26 23:06:10,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-473056808 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-473056808 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-473056808| ~z$w_buff0_used~0_In-473056808)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-473056808| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-473056808, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-473056808} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-473056808|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-473056808, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-473056808} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:06:10,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In-1930000752 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1930000752 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1930000752 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1930000752 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1930000752|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1930000752| ~z$w_buff1_used~0_In-1930000752)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1930000752, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1930000752, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1930000752, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1930000752} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1930000752|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1930000752, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1930000752, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1930000752, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1930000752} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:06:10,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-397197175 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-397197175 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-397197175) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-397197175 ~z$r_buff0_thd1~0_Out-397197175)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-397197175, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-397197175} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-397197175, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-397197175|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-397197175} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:06:10,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1458240282 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1458240282 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1458240282|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1458240282| ~z$w_buff0_used~0_In-1458240282)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458240282, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1458240282} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458240282, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1458240282|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1458240282} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:06:10,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L764-->L764-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd2~0_In1075652419 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1075652419 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1075652419 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1075652419 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1075652419|)) (and (= ~z$w_buff1_used~0_In1075652419 |P1Thread1of1ForFork1_#t~ite12_Out1075652419|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1075652419, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1075652419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1075652419, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1075652419} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1075652419, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1075652419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1075652419, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1075652419|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1075652419} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:06:10,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In820812910 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In820812910 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out820812910| ~z$r_buff0_thd2~0_In820812910)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out820812910|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In820812910, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In820812910} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In820812910, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out820812910|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In820812910} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 23:06:10,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1611799854 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1611799854 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In1611799854 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1611799854 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In1611799854 |P1Thread1of1ForFork1_#t~ite14_Out1611799854|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1611799854|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1611799854, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1611799854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1611799854, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1611799854} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1611799854, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1611799854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1611799854, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1611799854|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1611799854} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:06:10,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_92) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:06:10,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L788-->L789: Formula: (and (= v_~z$r_buff0_thd3~0_137 v_~z$r_buff0_thd3~0_136) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_12|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 23:06:10,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1192543321 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite36_Out-1192543321| ~z$r_buff1_thd3~0_In-1192543321) (= |P2Thread1of1ForFork2_#t~ite35_In-1192543321| |P2Thread1of1ForFork2_#t~ite35_Out-1192543321|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1192543321 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1192543321 256)) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1192543321 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1192543321 256)))) (= |P2Thread1of1ForFork2_#t~ite35_Out-1192543321| ~z$r_buff1_thd3~0_In-1192543321) .cse0 (= |P2Thread1of1ForFork2_#t~ite36_Out-1192543321| |P2Thread1of1ForFork2_#t~ite35_Out-1192543321|)))) InVars {P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_In-1192543321|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1192543321, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1192543321, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1192543321, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1192543321, ~weak$$choice2~0=~weak$$choice2~0_In-1192543321} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out-1192543321|, P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-1192543321|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1192543321, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1192543321, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1192543321, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1192543321, ~weak$$choice2~0=~weak$$choice2~0_In-1192543321} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35, P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-26 23:06:10,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L791-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_62 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_62} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 23:06:10,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-2-->L795-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite39_Out719164731| |P2Thread1of1ForFork2_#t~ite38_Out719164731|)) (.cse1 (= (mod ~z$w_buff1_used~0_In719164731 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In719164731 256)))) (or (and .cse0 (= ~z~0_In719164731 |P2Thread1of1ForFork2_#t~ite38_Out719164731|) (or .cse1 .cse2)) (and (= ~z$w_buff1~0_In719164731 |P2Thread1of1ForFork2_#t~ite38_Out719164731|) .cse0 (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In719164731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In719164731, ~z$w_buff1~0=~z$w_buff1~0_In719164731, ~z~0=~z~0_In719164731} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In719164731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In719164731, ~z$w_buff1~0=~z$w_buff1~0_In719164731, ~z~0=~z~0_In719164731, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out719164731|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out719164731|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-26 23:06:10,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1196841174 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1196841174 256) 0))) (or (and (= ~z$w_buff0_used~0_In1196841174 |P2Thread1of1ForFork2_#t~ite40_Out1196841174|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out1196841174| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1196841174, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1196841174} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1196841174, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1196841174, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1196841174|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-26 23:06:10,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-943230581 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-943230581 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-943230581 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-943230581 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-943230581 |P2Thread1of1ForFork2_#t~ite41_Out-943230581|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-943230581|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-943230581, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-943230581, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-943230581, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-943230581} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-943230581|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-943230581, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-943230581, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-943230581, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-943230581} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-26 23:06:10,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In698661090 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In698661090 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out698661090| ~z$r_buff0_thd3~0_In698661090) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out698661090| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In698661090, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In698661090} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out698661090|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In698661090, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In698661090} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-26 23:06:10,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In1586366560 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1586366560 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1586366560 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1586366560 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out1586366560| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1586366560 |P2Thread1of1ForFork2_#t~ite43_Out1586366560|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1586366560, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1586366560, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1586366560, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1586366560} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1586366560, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1586366560, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1586366560|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1586366560, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1586366560} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-26 23:06:10,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_167 |v_P2Thread1of1ForFork2_#t~ite43_40|)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_167, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_39|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:06:10,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In497078788 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In497078788 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In497078788 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In497078788 256) 0))) (or (and (= ~z$r_buff1_thd1~0_In497078788 |P0Thread1of1ForFork0_#t~ite8_Out497078788|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out497078788|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In497078788, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In497078788, ~z$w_buff1_used~0=~z$w_buff1_used~0_In497078788, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In497078788} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In497078788, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out497078788|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In497078788, ~z$w_buff1_used~0=~z$w_buff1_used~0_In497078788, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In497078788} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:06:10,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L746-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_159 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_159, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:06:10,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L822-1-->L828: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:06:10,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L828-2-->L828-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1823785237| |ULTIMATE.start_main_#t~ite47_Out-1823785237|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1823785237 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1823785237 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-1823785237 |ULTIMATE.start_main_#t~ite47_Out-1823785237|)) (and (= ~z$w_buff1~0_In-1823785237 |ULTIMATE.start_main_#t~ite47_Out-1823785237|) .cse2 (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1823785237, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1823785237, ~z$w_buff1~0=~z$w_buff1~0_In-1823785237, ~z~0=~z~0_In-1823785237} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1823785237, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1823785237|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1823785237, ~z$w_buff1~0=~z$w_buff1~0_In-1823785237, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1823785237|, ~z~0=~z~0_In-1823785237} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:06:10,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1471549891 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1471549891 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out1471549891|) (not .cse1)) (and (= ~z$w_buff0_used~0_In1471549891 |ULTIMATE.start_main_#t~ite49_Out1471549891|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1471549891, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1471549891} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1471549891, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1471549891, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1471549891|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 23:06:10,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In371161405 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In371161405 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In371161405 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In371161405 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out371161405| ~z$w_buff1_used~0_In371161405) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out371161405|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In371161405, ~z$w_buff0_used~0=~z$w_buff0_used~0_In371161405, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In371161405, ~z$w_buff1_used~0=~z$w_buff1_used~0_In371161405} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out371161405|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In371161405, ~z$w_buff0_used~0=~z$w_buff0_used~0_In371161405, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In371161405, ~z$w_buff1_used~0=~z$w_buff1_used~0_In371161405} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 23:06:10,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In123398912 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In123398912 256)))) (or (and (= ~z$r_buff0_thd0~0_In123398912 |ULTIMATE.start_main_#t~ite51_Out123398912|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out123398912|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In123398912, ~z$w_buff0_used~0=~z$w_buff0_used~0_In123398912} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In123398912, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out123398912|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In123398912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 23:06:10,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In2139464448 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In2139464448 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2139464448 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2139464448 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out2139464448| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out2139464448| ~z$r_buff1_thd0~0_In2139464448)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2139464448, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2139464448, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2139464448, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2139464448} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2139464448|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2139464448, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2139464448, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2139464448, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2139464448} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 23:06:10,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= 2 v_~x~0_130) (= 0 v_~__unbuffered_p2_EAX~0_21) (= v_~z$r_buff1_thd0~0_167 |v_ULTIMATE.start_main_#t~ite52_35|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_23 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:06:10,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:06:10 BasicIcfg [2019-12-26 23:06:10,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:06:10,174 INFO L168 Benchmark]: Toolchain (without parser) took 182754.49 ms. Allocated memory was 137.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 727.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:10,174 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 23:06:10,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.75 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 100.6 MB in the beginning and 156.6 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:10,175 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.39 ms. Allocated memory is still 203.4 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:10,175 INFO L168 Benchmark]: Boogie Preprocessor took 40.94 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 152.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:10,176 INFO L168 Benchmark]: RCFGBuilder took 872.39 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 101.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:10,176 INFO L168 Benchmark]: TraceAbstraction took 180945.98 ms. Allocated memory was 203.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.5 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 663.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:06:10,179 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.54 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.75 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 100.6 MB in the beginning and 156.6 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.39 ms. Allocated memory is still 203.4 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.94 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 152.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 872.39 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 101.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 180945.98 ms. Allocated memory was 203.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.5 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 663.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 174 ProgramPointsBefore, 92 ProgramPointsAfterwards, 211 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 6843 VarBasedMoverChecksPositive, 273 VarBasedMoverChecksNegative, 91 SemBasedMoverChecksPositive, 240 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 77200 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 z$flush_delayed = weak$$choice2 [L782] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L784] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L785] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L786] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L787] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 180.6s, OverallIterations: 53, TraceHistogramMax: 1, AutomataDifference: 95.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 15147 SDtfs, 23162 SDslu, 62625 SDs, 0 SdLazy, 63543 SolverSat, 1227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1239 GetRequests, 174 SyntacticMatches, 54 SemanticMatches, 1011 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12667 ImplicationChecksByTransitivity, 18.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138429occurred 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: 54.0s AutomataMinimizationTime, 52 MinimizatonAttempts, 591796 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2811 NumberOfCodeBlocks, 2811 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2692 ConstructedInterpolants, 0 QuantifiedInterpolants, 725738 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 52 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...