/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:24:44,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:24:44,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:24:44,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:24:44,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:24:44,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:24:44,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:24:44,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:24:44,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:24:44,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:24:44,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:24:44,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:24:44,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:24:44,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:24:44,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:24:44,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:24:44,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:24:44,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:24:44,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:24:44,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:24:44,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:24:44,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:24:44,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:24:44,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:24:44,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:24:44,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:24:44,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:24:44,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:24:44,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:24:44,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:24:44,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:24:44,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:24:44,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:24:44,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:24:44,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:24:44,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:24:44,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:24:44,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:24:44,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:24:44,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:24:44,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:24:44,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:24:44,234 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:24:44,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:24:44,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:24:44,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:24:44,237 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:24:44,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:24:44,237 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:24:44,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:24:44,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:24:44,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:24:44,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:24:44,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:24:44,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:24:44,240 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:24:44,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:24:44,240 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:24:44,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:24:44,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:24:44,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:24:44,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:24:44,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:24:44,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:24:44,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:24:44,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:24:44,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:24:44,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:24:44,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:24:44,243 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:24:44,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:24:44,243 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:24:44,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:24:44,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:24:44,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:24:44,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:24:44,541 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:24:44,541 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:24:44,542 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc.i [2019-12-27 16:24:44,602 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d08b876/2d74ab1dab3f42a3871adec01ac697c0/FLAG850630dfa [2019-12-27 16:24:45,192 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:24:45,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.oepc.i [2019-12-27 16:24:45,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d08b876/2d74ab1dab3f42a3871adec01ac697c0/FLAG850630dfa [2019-12-27 16:24:45,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d08b876/2d74ab1dab3f42a3871adec01ac697c0 [2019-12-27 16:24:45,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:24:45,455 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:24:45,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:24:45,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:24:45,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:24:45,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:24:45" (1/1) ... [2019-12-27 16:24:45,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b0d5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:45, skipping insertion in model container [2019-12-27 16:24:45,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:24:45" (1/1) ... [2019-12-27 16:24:45,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:24:45,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:24:46,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:24:46,054 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:24:46,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:24:46,209 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:24:46,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:46 WrapperNode [2019-12-27 16:24:46,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:24:46,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:24:46,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:24:46,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:24:46,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:46" (1/1) ... [2019-12-27 16:24:46,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:46" (1/1) ... [2019-12-27 16:24:46,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:24:46,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:24:46,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:24:46,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:24:46,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:46" (1/1) ... [2019-12-27 16:24:46,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:46" (1/1) ... [2019-12-27 16:24:46,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:46" (1/1) ... [2019-12-27 16:24:46,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:46" (1/1) ... [2019-12-27 16:24:46,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:46" (1/1) ... [2019-12-27 16:24:46,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:46" (1/1) ... [2019-12-27 16:24:46,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:46" (1/1) ... [2019-12-27 16:24:46,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:24:46,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:24:46,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:24:46,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:24:46,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:24:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:24:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:24:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:24:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:24:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:24:46,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:24:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:24:46,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:24:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:24:46,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:24:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:24:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:24:46,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:24:46,427 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:24:47,248 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:24:47,249 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:24:47,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:24:47 BoogieIcfgContainer [2019-12-27 16:24:47,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:24:47,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:24:47,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:24:47,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:24:47,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:24:45" (1/3) ... [2019-12-27 16:24:47,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7336d486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:24:47, skipping insertion in model container [2019-12-27 16:24:47,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:46" (2/3) ... [2019-12-27 16:24:47,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7336d486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:24:47, skipping insertion in model container [2019-12-27 16:24:47,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:24:47" (3/3) ... [2019-12-27 16:24:47,259 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc.i [2019-12-27 16:24:47,269 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:24:47,269 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:24:47,276 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:24:47,277 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:24:47,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,327 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,327 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,327 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,328 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,328 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,336 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,336 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,361 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,361 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,389 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,391 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,401 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,402 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:47,418 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:24:47,439 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:24:47,439 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:24:47,439 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:24:47,439 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:24:47,439 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:24:47,440 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:24:47,440 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:24:47,440 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:24:47,457 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 16:24:47,459 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 16:24:47,564 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 16:24:47,565 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:24:47,583 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:24:47,611 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 16:24:47,680 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 16:24:47,680 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:24:47,691 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:24:47,715 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:24:47,716 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:24:52,793 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-27 16:24:53,245 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 16:24:53,405 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 16:24:53,676 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-27 16:24:53,676 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 16:24:53,680 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-27 16:25:13,590 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-27 16:25:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-27 16:25:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:25:13,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:13,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:25:13,600 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:13,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:13,605 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-27 16:25:13,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:13,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080437596] [2019-12-27 16:25:13,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:13,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080437596] [2019-12-27 16:25:13,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:13,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:25:13,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [599855164] [2019-12-27 16:25:13,828 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:13,833 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:13,846 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:25:13,847 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:13,850 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:13,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:25:13,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:13,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:25:13,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:13,870 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-27 16:25:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:17,230 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-27 16:25:17,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:25:17,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:25:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:17,918 INFO L225 Difference]: With dead ends: 121140 [2019-12-27 16:25:17,918 INFO L226 Difference]: Without dead ends: 107958 [2019-12-27 16:25:17,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-27 16:25:26,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-27 16:25:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-27 16:25:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-27 16:25:27,146 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-27 16:25:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:27,146 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-27 16:25:27,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:25:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-27 16:25:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:25:27,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:27,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:27,151 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:27,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:27,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-27 16:25:27,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:27,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655356103] [2019-12-27 16:25:27,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:27,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655356103] [2019-12-27 16:25:27,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:27,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:25:27,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [872426452] [2019-12-27 16:25:27,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:27,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:27,249 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:25:27,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:27,249 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:27,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:25:27,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:27,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:25:27,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:25:27,252 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-27 16:25:31,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:31,949 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-27 16:25:31,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:25:31,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:25:31,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:32,589 INFO L225 Difference]: With dead ends: 172022 [2019-12-27 16:25:32,590 INFO L226 Difference]: Without dead ends: 171924 [2019-12-27 16:25:32,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:41,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-27 16:25:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-27 16:25:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-27 16:25:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-27 16:25:45,833 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-27 16:25:45,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:45,834 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-27 16:25:45,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:25:45,834 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-27 16:25:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:25:45,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:45,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:45,841 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:45,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:45,842 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-27 16:25:45,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:45,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375898632] [2019-12-27 16:25:45,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:45,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:45,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375898632] [2019-12-27 16:25:45,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:45,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:25:45,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [577426599] [2019-12-27 16:25:45,913 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:45,914 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:45,916 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:25:45,916 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:45,916 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:45,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:25:45,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:45,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:25:45,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:45,918 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-27 16:25:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:46,098 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-27 16:25:46,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:25:46,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:25:46,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:46,155 INFO L225 Difference]: With dead ends: 33388 [2019-12-27 16:25:46,155 INFO L226 Difference]: Without dead ends: 33388 [2019-12-27 16:25:46,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-27 16:25:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-27 16:25:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-27 16:25:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-27 16:25:51,557 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-27 16:25:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:51,557 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-27 16:25:51,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:25:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-27 16:25:51,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:25:51,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:51,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:51,561 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:51,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:51,561 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-27 16:25:51,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:51,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521737201] [2019-12-27 16:25:51,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:51,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521737201] [2019-12-27 16:25:51,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:51,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:25:51,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [374340636] [2019-12-27 16:25:51,664 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:51,667 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:51,669 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:25:51,669 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:51,670 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:51,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:25:51,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:51,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:25:51,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:51,671 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-27 16:25:51,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:51,893 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-27 16:25:51,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:25:51,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 16:25:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:51,994 INFO L225 Difference]: With dead ends: 52822 [2019-12-27 16:25:51,995 INFO L226 Difference]: Without dead ends: 52822 [2019-12-27 16:25:51,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-27 16:25:52,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-27 16:25:52,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-27 16:25:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-27 16:25:52,779 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-27 16:25:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:52,780 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-27 16:25:52,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:25:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-27 16:25:52,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:25:52,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:52,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:52,784 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:52,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:52,784 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-27 16:25:52,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:52,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404658734] [2019-12-27 16:25:52,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:52,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404658734] [2019-12-27 16:25:52,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:52,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:25:52,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1828641582] [2019-12-27 16:25:52,885 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:52,888 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:52,893 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:25:52,893 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:52,893 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:52,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:25:52,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:52,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:25:52,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:25:52,894 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-27 16:25:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:53,735 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-27 16:25:53,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:25:53,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:25:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:53,811 INFO L225 Difference]: With dead ends: 46903 [2019-12-27 16:25:53,811 INFO L226 Difference]: Without dead ends: 46903 [2019-12-27 16:25:53,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-27 16:25:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-27 16:25:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 16:25:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-27 16:25:54,505 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-27 16:25:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:54,505 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-27 16:25:54,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:25:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-27 16:25:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:25:54,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:54,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:54,509 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:54,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:54,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-27 16:25:54,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:54,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114608511] [2019-12-27 16:25:54,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:54,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114608511] [2019-12-27 16:25:54,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:54,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:25:54,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [251517786] [2019-12-27 16:25:54,583 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:54,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:54,591 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:25:54,591 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:54,591 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:54,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:25:54,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:54,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:25:54,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:25:54,593 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-27 16:25:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:54,969 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-27 16:25:54,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:25:54,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:25:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:55,052 INFO L225 Difference]: With dead ends: 51478 [2019-12-27 16:25:55,052 INFO L226 Difference]: Without dead ends: 51478 [2019-12-27 16:25:55,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-27 16:25:56,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-27 16:25:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-27 16:25:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-27 16:25:56,406 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-27 16:25:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:56,407 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-27 16:25:56,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:25:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-27 16:25:56,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:25:56,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:56,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:56,417 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:56,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:56,418 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-27 16:25:56,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:56,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368332277] [2019-12-27 16:25:56,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:56,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368332277] [2019-12-27 16:25:56,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:56,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:25:56,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [629076205] [2019-12-27 16:25:56,509 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:56,512 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:56,522 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 16:25:56,523 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:56,526 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:25:56,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:25:56,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:56,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:25:56,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:56,527 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-27 16:25:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:57,170 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-27 16:25:57,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:25:57,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:25:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:57,272 INFO L225 Difference]: With dead ends: 61264 [2019-12-27 16:25:57,272 INFO L226 Difference]: Without dead ends: 61250 [2019-12-27 16:25:57,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:25:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-27 16:25:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-27 16:25:58,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-27 16:25:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-27 16:25:58,178 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-27 16:25:58,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:58,179 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-27 16:25:58,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:25:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-27 16:25:58,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:25:58,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:58,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:58,188 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:58,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:58,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-27 16:25:58,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:58,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874601769] [2019-12-27 16:25:58,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:58,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-27 16:25:58,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874601769] [2019-12-27 16:25:58,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:58,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:25:58,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [22795324] [2019-12-27 16:25:58,250 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:58,253 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:58,261 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 16:25:58,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:58,263 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:25:58,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:25:58,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:58,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:25:58,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:58,264 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-27 16:25:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:58,905 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-27 16:25:58,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:25:58,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:25:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:59,011 INFO L225 Difference]: With dead ends: 63752 [2019-12-27 16:25:59,012 INFO L226 Difference]: Without dead ends: 63738 [2019-12-27 16:25:59,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:25:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-27 16:26:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-27 16:26:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-27 16:26:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-27 16:26:00,271 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-27 16:26:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:00,271 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-27 16:26:00,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:26:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-27 16:26:00,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:26:00,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:00,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:00,283 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:00,284 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-27 16:26:00,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:00,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789238135] [2019-12-27 16:26:00,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:00,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789238135] [2019-12-27 16:26:00,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:00,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:00,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [427351755] [2019-12-27 16:26:00,334 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:00,337 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:00,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:26:00,347 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:00,380 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:26:00,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:26:00,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:00,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:26:00,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:00,382 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 5 states. [2019-12-27 16:26:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:00,491 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-27 16:26:00,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:26:00,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:26:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:00,520 INFO L225 Difference]: With dead ends: 17193 [2019-12-27 16:26:00,520 INFO L226 Difference]: Without dead ends: 17193 [2019-12-27 16:26:00,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:00,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-27 16:26:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-27 16:26:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-27 16:26:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-27 16:26:00,777 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-27 16:26:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:00,778 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-27 16:26:00,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:26:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-27 16:26:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:26:00,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:00,794 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] [2019-12-27 16:26:00,794 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:00,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-27 16:26:00,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:00,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689947214] [2019-12-27 16:26:00,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:00,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689947214] [2019-12-27 16:26:00,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:00,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:00,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1086752873] [2019-12-27 16:26:00,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:00,877 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:00,883 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 16:26:00,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:00,884 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:00,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:26:00,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:00,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:26:00,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:00,885 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-27 16:26:01,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:01,325 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-27 16:26:01,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:26:01,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:26:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:01,367 INFO L225 Difference]: With dead ends: 21613 [2019-12-27 16:26:01,367 INFO L226 Difference]: Without dead ends: 21613 [2019-12-27 16:26:01,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:01,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-27 16:26:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-27 16:26:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-27 16:26:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-27 16:26:01,704 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-27 16:26:01,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:01,704 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-27 16:26:01,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:26:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-27 16:26:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:26:01,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:01,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] [2019-12-27 16:26:01,719 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:01,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-27 16:26:01,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:01,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307029650] [2019-12-27 16:26:01,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:01,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307029650] [2019-12-27 16:26:01,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:01,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:01,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1701214671] [2019-12-27 16:26:01,792 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:01,797 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:01,804 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:26:01,804 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:01,805 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:01,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:26:01,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:01,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:26:01,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:01,806 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-27 16:26:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:02,132 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-27 16:26:02,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:26:02,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 16:26:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:02,164 INFO L225 Difference]: With dead ends: 23624 [2019-12-27 16:26:02,165 INFO L226 Difference]: Without dead ends: 23624 [2019-12-27 16:26:02,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:02,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-27 16:26:02,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-27 16:26:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-27 16:26:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-27 16:26:02,706 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-27 16:26:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:02,707 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-27 16:26:02,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:26:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-27 16:26:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:26:02,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:02,726 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] [2019-12-27 16:26:02,726 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:02,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:02,727 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-27 16:26:02,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:02,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072070809] [2019-12-27 16:26:02,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:02,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072070809] [2019-12-27 16:26:02,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:02,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:26:02,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1522374065] [2019-12-27 16:26:02,838 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:02,844 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:02,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 88 transitions. [2019-12-27 16:26:02,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:02,862 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:26:02,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:26:02,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:02,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:26:02,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:26:02,863 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-27 16:26:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:03,576 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-27 16:26:03,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:26:03,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 16:26:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:03,615 INFO L225 Difference]: With dead ends: 27031 [2019-12-27 16:26:03,615 INFO L226 Difference]: Without dead ends: 27031 [2019-12-27 16:26:03,616 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-27 16:26:03,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-27 16:26:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-27 16:26:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-27 16:26:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-27 16:26:03,941 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-27 16:26:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:03,941 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-27 16:26:03,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:26:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-27 16:26:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:26:03,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:03,963 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:03,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:03,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-27 16:26:03,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:03,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579840229] [2019-12-27 16:26:03,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:04,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579840229] [2019-12-27 16:26:04,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:04,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:26:04,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924076951] [2019-12-27 16:26:04,102 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:04,109 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:04,134 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 94 transitions. [2019-12-27 16:26:04,134 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:04,135 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:26:04,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:26:04,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:04,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:26:04,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:04,140 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 7 states. [2019-12-27 16:26:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:04,955 INFO L93 Difference]: Finished difference Result 29297 states and 87381 transitions. [2019-12-27 16:26:04,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 16:26:04,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 16:26:04,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:04,995 INFO L225 Difference]: With dead ends: 29297 [2019-12-27 16:26:04,996 INFO L226 Difference]: Without dead ends: 29297 [2019-12-27 16:26:04,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:26:05,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29297 states. [2019-12-27 16:26:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29297 to 20970. [2019-12-27 16:26:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20970 states. [2019-12-27 16:26:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20970 states to 20970 states and 63763 transitions. [2019-12-27 16:26:05,330 INFO L78 Accepts]: Start accepts. Automaton has 20970 states and 63763 transitions. Word has length 34 [2019-12-27 16:26:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:05,330 INFO L462 AbstractCegarLoop]: Abstraction has 20970 states and 63763 transitions. [2019-12-27 16:26:05,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:26:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand 20970 states and 63763 transitions. [2019-12-27 16:26:05,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 16:26:05,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:05,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] [2019-12-27 16:26:05,349 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:05,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:05,350 INFO L82 PathProgramCache]: Analyzing trace with hash -475634225, now seen corresponding path program 1 times [2019-12-27 16:26:05,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:05,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429046953] [2019-12-27 16:26:05,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:05,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429046953] [2019-12-27 16:26:05,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:05,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:26:05,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1163535992] [2019-12-27 16:26:05,506 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:05,525 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:05,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 144 transitions. [2019-12-27 16:26:05,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:05,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:05,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:26:05,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:05,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:05,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:26:05,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 16:26:05,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:05,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 16:26:05,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:26:05,967 INFO L87 Difference]: Start difference. First operand 20970 states and 63763 transitions. Second operand 15 states. [2019-12-27 16:26:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:12,342 INFO L93 Difference]: Finished difference Result 63687 states and 189059 transitions. [2019-12-27 16:26:12,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 16:26:12,343 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2019-12-27 16:26:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:12,455 INFO L225 Difference]: With dead ends: 63687 [2019-12-27 16:26:12,455 INFO L226 Difference]: Without dead ends: 63687 [2019-12-27 16:26:12,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=500, Invalid=1662, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 16:26:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63687 states. [2019-12-27 16:26:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63687 to 20516. [2019-12-27 16:26:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20516 states. [2019-12-27 16:26:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20516 states to 20516 states and 62674 transitions. [2019-12-27 16:26:13,024 INFO L78 Accepts]: Start accepts. Automaton has 20516 states and 62674 transitions. Word has length 38 [2019-12-27 16:26:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:13,024 INFO L462 AbstractCegarLoop]: Abstraction has 20516 states and 62674 transitions. [2019-12-27 16:26:13,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 16:26:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 20516 states and 62674 transitions. [2019-12-27 16:26:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 16:26:13,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:13,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:13,046 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:13,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:13,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1454822857, now seen corresponding path program 2 times [2019-12-27 16:26:13,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:13,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051598924] [2019-12-27 16:26:13,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:13,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051598924] [2019-12-27 16:26:13,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:13,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:26:13,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [970058016] [2019-12-27 16:26:13,143 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:13,151 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:13,181 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 126 transitions. [2019-12-27 16:26:13,182 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:13,301 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:26:13,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:26:13,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:13,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:26:13,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:26:13,303 INFO L87 Difference]: Start difference. First operand 20516 states and 62674 transitions. Second operand 9 states. [2019-12-27 16:26:15,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:15,533 INFO L93 Difference]: Finished difference Result 52750 states and 157225 transitions. [2019-12-27 16:26:15,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 16:26:15,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 16:26:15,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:15,607 INFO L225 Difference]: With dead ends: 52750 [2019-12-27 16:26:15,607 INFO L226 Difference]: Without dead ends: 52750 [2019-12-27 16:26:15,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:26:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52750 states. [2019-12-27 16:26:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52750 to 20005. [2019-12-27 16:26:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20005 states. [2019-12-27 16:26:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20005 states to 20005 states and 61459 transitions. [2019-12-27 16:26:16,080 INFO L78 Accepts]: Start accepts. Automaton has 20005 states and 61459 transitions. Word has length 38 [2019-12-27 16:26:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:16,080 INFO L462 AbstractCegarLoop]: Abstraction has 20005 states and 61459 transitions. [2019-12-27 16:26:16,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:26:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 20005 states and 61459 transitions. [2019-12-27 16:26:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:26:16,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:16,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:16,105 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:16,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-27 16:26:16,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:16,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068036054] [2019-12-27 16:26:16,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:16,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068036054] [2019-12-27 16:26:16,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:16,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:26:16,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2010259613] [2019-12-27 16:26:16,167 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:16,175 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:16,244 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 411 transitions. [2019-12-27 16:26:16,245 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:16,246 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:16,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:26:16,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:16,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:26:16,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:16,247 INFO L87 Difference]: Start difference. First operand 20005 states and 61459 transitions. Second operand 3 states. [2019-12-27 16:26:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:16,329 INFO L93 Difference]: Finished difference Result 20004 states and 61457 transitions. [2019-12-27 16:26:16,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:26:16,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:26:16,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:16,358 INFO L225 Difference]: With dead ends: 20004 [2019-12-27 16:26:16,359 INFO L226 Difference]: Without dead ends: 20004 [2019-12-27 16:26:16,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:16,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20004 states. [2019-12-27 16:26:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20004 to 20004. [2019-12-27 16:26:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20004 states. [2019-12-27 16:26:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20004 states to 20004 states and 61457 transitions. [2019-12-27 16:26:16,640 INFO L78 Accepts]: Start accepts. Automaton has 20004 states and 61457 transitions. Word has length 39 [2019-12-27 16:26:16,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:16,640 INFO L462 AbstractCegarLoop]: Abstraction has 20004 states and 61457 transitions. [2019-12-27 16:26:16,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:26:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 20004 states and 61457 transitions. [2019-12-27 16:26:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:26:16,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:16,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:16,669 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:16,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:16,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-27 16:26:16,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:16,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428709654] [2019-12-27 16:26:16,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:16,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428709654] [2019-12-27 16:26:16,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:16,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:26:16,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1902270249] [2019-12-27 16:26:16,765 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:16,775 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:16,876 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 475 transitions. [2019-12-27 16:26:16,876 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:16,915 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:26:16,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:26:16,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:16,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:26:16,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:16,918 INFO L87 Difference]: Start difference. First operand 20004 states and 61457 transitions. Second operand 7 states. [2019-12-27 16:26:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:17,790 INFO L93 Difference]: Finished difference Result 28482 states and 86547 transitions. [2019-12-27 16:26:17,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:26:17,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:26:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:17,837 INFO L225 Difference]: With dead ends: 28482 [2019-12-27 16:26:17,837 INFO L226 Difference]: Without dead ends: 28482 [2019-12-27 16:26:17,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:26:17,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28482 states. [2019-12-27 16:26:18,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28482 to 26228. [2019-12-27 16:26:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26228 states. [2019-12-27 16:26:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26228 states to 26228 states and 80336 transitions. [2019-12-27 16:26:18,255 INFO L78 Accepts]: Start accepts. Automaton has 26228 states and 80336 transitions. Word has length 40 [2019-12-27 16:26:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:18,255 INFO L462 AbstractCegarLoop]: Abstraction has 26228 states and 80336 transitions. [2019-12-27 16:26:18,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:26:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 26228 states and 80336 transitions. [2019-12-27 16:26:18,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:26:18,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:18,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:18,282 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:18,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:18,282 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-27 16:26:18,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:18,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909992265] [2019-12-27 16:26:18,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:18,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909992265] [2019-12-27 16:26:18,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:18,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:26:18,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2120686168] [2019-12-27 16:26:18,345 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:18,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:18,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 16:26:18,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:18,731 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:26:18,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:26:18,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:18,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:26:18,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:18,732 INFO L87 Difference]: Start difference. First operand 26228 states and 80336 transitions. Second operand 7 states. [2019-12-27 16:26:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:18,856 INFO L93 Difference]: Finished difference Result 24811 states and 77029 transitions. [2019-12-27 16:26:18,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:26:18,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:26:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:18,891 INFO L225 Difference]: With dead ends: 24811 [2019-12-27 16:26:18,892 INFO L226 Difference]: Without dead ends: 24811 [2019-12-27 16:26:18,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:18,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24811 states. [2019-12-27 16:26:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24811 to 23423. [2019-12-27 16:26:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23423 states. [2019-12-27 16:26:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23423 states to 23423 states and 73256 transitions. [2019-12-27 16:26:19,249 INFO L78 Accepts]: Start accepts. Automaton has 23423 states and 73256 transitions. Word has length 40 [2019-12-27 16:26:19,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:19,249 INFO L462 AbstractCegarLoop]: Abstraction has 23423 states and 73256 transitions. [2019-12-27 16:26:19,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:26:19,249 INFO L276 IsEmpty]: Start isEmpty. Operand 23423 states and 73256 transitions. [2019-12-27 16:26:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:26:19,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:19,277 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] [2019-12-27 16:26:19,277 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:19,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:19,277 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-27 16:26:19,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:19,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857214880] [2019-12-27 16:26:19,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:19,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857214880] [2019-12-27 16:26:19,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:19,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:26:19,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1261261327] [2019-12-27 16:26:19,364 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:19,385 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:19,587 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 262 states and 476 transitions. [2019-12-27 16:26:19,588 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:19,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:26:19,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:26:19,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:19,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:26:19,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:19,612 INFO L87 Difference]: Start difference. First operand 23423 states and 73256 transitions. Second operand 7 states. [2019-12-27 16:26:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:20,177 INFO L93 Difference]: Finished difference Result 70604 states and 218411 transitions. [2019-12-27 16:26:20,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 16:26:20,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 16:26:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:20,256 INFO L225 Difference]: With dead ends: 70604 [2019-12-27 16:26:20,257 INFO L226 Difference]: Without dead ends: 52771 [2019-12-27 16:26:20,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:26:20,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52771 states. [2019-12-27 16:26:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52771 to 27498. [2019-12-27 16:26:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27498 states. [2019-12-27 16:26:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27498 states to 27498 states and 86420 transitions. [2019-12-27 16:26:20,899 INFO L78 Accepts]: Start accepts. Automaton has 27498 states and 86420 transitions. Word has length 63 [2019-12-27 16:26:20,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:20,899 INFO L462 AbstractCegarLoop]: Abstraction has 27498 states and 86420 transitions. [2019-12-27 16:26:20,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:26:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 27498 states and 86420 transitions. [2019-12-27 16:26:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:26:20,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:20,933 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] [2019-12-27 16:26:20,933 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:20,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:20,933 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-27 16:26:20,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:20,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983612501] [2019-12-27 16:26:20,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:21,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983612501] [2019-12-27 16:26:21,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:21,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:26:21,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1328044020] [2019-12-27 16:26:21,028 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:21,049 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:21,695 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 297 states and 553 transitions. [2019-12-27 16:26:21,696 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:21,751 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:26:21,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:26:21,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:21,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:26:21,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:26:21,752 INFO L87 Difference]: Start difference. First operand 27498 states and 86420 transitions. Second operand 9 states. [2019-12-27 16:26:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:23,857 INFO L93 Difference]: Finished difference Result 87900 states and 272021 transitions. [2019-12-27 16:26:23,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:26:23,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-27 16:26:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:23,971 INFO L225 Difference]: With dead ends: 87900 [2019-12-27 16:26:23,972 INFO L226 Difference]: Without dead ends: 65916 [2019-12-27 16:26:23,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:26:24,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65916 states. [2019-12-27 16:26:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65916 to 31401. [2019-12-27 16:26:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31401 states. [2019-12-27 16:26:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31401 states to 31401 states and 98240 transitions. [2019-12-27 16:26:24,726 INFO L78 Accepts]: Start accepts. Automaton has 31401 states and 98240 transitions. Word has length 63 [2019-12-27 16:26:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:24,726 INFO L462 AbstractCegarLoop]: Abstraction has 31401 states and 98240 transitions. [2019-12-27 16:26:24,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:26:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 31401 states and 98240 transitions. [2019-12-27 16:26:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:26:24,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:24,765 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] [2019-12-27 16:26:24,766 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:24,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:24,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-27 16:26:24,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:24,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484598537] [2019-12-27 16:26:24,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:24,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484598537] [2019-12-27 16:26:24,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:24,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:26:24,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [310092604] [2019-12-27 16:26:24,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:24,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:25,098 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 398 transitions. [2019-12-27 16:26:25,099 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:25,142 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:26:25,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:26:25,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:25,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:26:25,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:26:25,144 INFO L87 Difference]: Start difference. First operand 31401 states and 98240 transitions. Second operand 8 states. [2019-12-27 16:26:25,613 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-12-27 16:26:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:27,451 INFO L93 Difference]: Finished difference Result 92834 states and 282846 transitions. [2019-12-27 16:26:27,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:26:27,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 16:26:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:27,581 INFO L225 Difference]: With dead ends: 92834 [2019-12-27 16:26:27,582 INFO L226 Difference]: Without dead ends: 79917 [2019-12-27 16:26:27,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:26:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79917 states. [2019-12-27 16:26:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79917 to 31709. [2019-12-27 16:26:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31709 states. [2019-12-27 16:26:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31709 states to 31709 states and 99191 transitions. [2019-12-27 16:26:28,471 INFO L78 Accepts]: Start accepts. Automaton has 31709 states and 99191 transitions. Word has length 63 [2019-12-27 16:26:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:28,472 INFO L462 AbstractCegarLoop]: Abstraction has 31709 states and 99191 transitions. [2019-12-27 16:26:28,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:26:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 31709 states and 99191 transitions. [2019-12-27 16:26:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:26:28,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:28,508 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] [2019-12-27 16:26:28,508 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:28,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:28,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-27 16:26:28,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:28,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418839821] [2019-12-27 16:26:28,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:28,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418839821] [2019-12-27 16:26:28,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:28,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:26:28,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2134999507] [2019-12-27 16:26:28,656 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:28,677 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:28,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 403 transitions. [2019-12-27 16:26:28,984 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:29,067 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 16:26:29,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:26:29,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:29,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:26:29,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:26:29,068 INFO L87 Difference]: Start difference. First operand 31709 states and 99191 transitions. Second operand 9 states. [2019-12-27 16:26:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:30,315 INFO L93 Difference]: Finished difference Result 41704 states and 127546 transitions. [2019-12-27 16:26:30,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 16:26:30,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-27 16:26:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:30,383 INFO L225 Difference]: With dead ends: 41704 [2019-12-27 16:26:30,383 INFO L226 Difference]: Without dead ends: 41480 [2019-12-27 16:26:30,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:26:30,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41480 states. [2019-12-27 16:26:31,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41480 to 34321. [2019-12-27 16:26:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34321 states. [2019-12-27 16:26:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34321 states to 34321 states and 106867 transitions. [2019-12-27 16:26:31,289 INFO L78 Accepts]: Start accepts. Automaton has 34321 states and 106867 transitions. Word has length 63 [2019-12-27 16:26:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:31,289 INFO L462 AbstractCegarLoop]: Abstraction has 34321 states and 106867 transitions. [2019-12-27 16:26:31,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:26:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 34321 states and 106867 transitions. [2019-12-27 16:26:31,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:26:31,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:31,328 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] [2019-12-27 16:26:31,328 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:31,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:31,329 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-27 16:26:31,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:31,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563178220] [2019-12-27 16:26:31,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:31,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563178220] [2019-12-27 16:26:31,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:31,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:26:31,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [348297124] [2019-12-27 16:26:31,391 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:31,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:31,585 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 357 transitions. [2019-12-27 16:26:31,585 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:31,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:31,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:26:31,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:31,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:26:31,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:31,586 INFO L87 Difference]: Start difference. First operand 34321 states and 106867 transitions. Second operand 3 states. [2019-12-27 16:26:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:31,691 INFO L93 Difference]: Finished difference Result 34320 states and 106865 transitions. [2019-12-27 16:26:31,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:26:31,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 16:26:31,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:31,742 INFO L225 Difference]: With dead ends: 34320 [2019-12-27 16:26:31,742 INFO L226 Difference]: Without dead ends: 34320 [2019-12-27 16:26:31,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34320 states. [2019-12-27 16:26:32,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34320 to 29481. [2019-12-27 16:26:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29481 states. [2019-12-27 16:26:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29481 states to 29481 states and 92872 transitions. [2019-12-27 16:26:32,230 INFO L78 Accepts]: Start accepts. Automaton has 29481 states and 92872 transitions. Word has length 63 [2019-12-27 16:26:32,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:32,230 INFO L462 AbstractCegarLoop]: Abstraction has 29481 states and 92872 transitions. [2019-12-27 16:26:32,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:26:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 29481 states and 92872 transitions. [2019-12-27 16:26:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:26:32,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:32,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:32,264 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:32,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:32,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2010713375, now seen corresponding path program 1 times [2019-12-27 16:26:32,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:32,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763131780] [2019-12-27 16:26:32,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:32,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763131780] [2019-12-27 16:26:32,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:32,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:26:32,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602836886] [2019-12-27 16:26:32,341 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:32,360 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:32,533 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 341 transitions. [2019-12-27 16:26:32,533 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:32,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:26:32,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:26:32,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:32,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:26:32,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:26:32,541 INFO L87 Difference]: Start difference. First operand 29481 states and 92872 transitions. Second operand 4 states. [2019-12-27 16:26:32,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:32,808 INFO L93 Difference]: Finished difference Result 33543 states and 103106 transitions. [2019-12-27 16:26:32,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:26:32,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 16:26:32,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:33,176 INFO L225 Difference]: With dead ends: 33543 [2019-12-27 16:26:33,176 INFO L226 Difference]: Without dead ends: 33543 [2019-12-27 16:26:33,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33543 states. [2019-12-27 16:26:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33543 to 23046. [2019-12-27 16:26:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23046 states. [2019-12-27 16:26:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23046 states to 23046 states and 71219 transitions. [2019-12-27 16:26:33,563 INFO L78 Accepts]: Start accepts. Automaton has 23046 states and 71219 transitions. Word has length 64 [2019-12-27 16:26:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:33,563 INFO L462 AbstractCegarLoop]: Abstraction has 23046 states and 71219 transitions. [2019-12-27 16:26:33,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:26:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 23046 states and 71219 transitions. [2019-12-27 16:26:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:26:33,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:33,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:33,590 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:33,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:33,590 INFO L82 PathProgramCache]: Analyzing trace with hash -668679299, now seen corresponding path program 1 times [2019-12-27 16:26:33,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:33,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466441376] [2019-12-27 16:26:33,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:33,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-27 16:26:33,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466441376] [2019-12-27 16:26:33,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:33,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:26:33,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1278858094] [2019-12-27 16:26:33,673 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:33,692 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:34,114 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 323 states and 654 transitions. [2019-12-27 16:26:34,114 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:34,176 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:26:34,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:26:34,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:34,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:26:34,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:26:34,177 INFO L87 Difference]: Start difference. First operand 23046 states and 71219 transitions. Second operand 8 states. [2019-12-27 16:26:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:35,255 INFO L93 Difference]: Finished difference Result 31216 states and 95014 transitions. [2019-12-27 16:26:35,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:26:35,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 16:26:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:35,299 INFO L225 Difference]: With dead ends: 31216 [2019-12-27 16:26:35,299 INFO L226 Difference]: Without dead ends: 31216 [2019-12-27 16:26:35,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:26:35,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31216 states. [2019-12-27 16:26:35,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31216 to 24124. [2019-12-27 16:26:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24124 states. [2019-12-27 16:26:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24124 states to 24124 states and 74402 transitions. [2019-12-27 16:26:35,734 INFO L78 Accepts]: Start accepts. Automaton has 24124 states and 74402 transitions. Word has length 65 [2019-12-27 16:26:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:35,734 INFO L462 AbstractCegarLoop]: Abstraction has 24124 states and 74402 transitions. [2019-12-27 16:26:35,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:26:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 24124 states and 74402 transitions. [2019-12-27 16:26:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:26:35,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:35,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:35,766 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:35,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:35,766 INFO L82 PathProgramCache]: Analyzing trace with hash 339295601, now seen corresponding path program 2 times [2019-12-27 16:26:35,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:35,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119147064] [2019-12-27 16:26:35,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:36,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119147064] [2019-12-27 16:26:36,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:36,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:26:36,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [201792602] [2019-12-27 16:26:36,064 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:36,097 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:36,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 392 states and 829 transitions. [2019-12-27 16:26:36,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:37,075 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 16:26:37,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:26:37,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:37,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:26:37,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:26:37,076 INFO L87 Difference]: Start difference. First operand 24124 states and 74402 transitions. Second operand 13 states. [2019-12-27 16:26:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:38,875 INFO L93 Difference]: Finished difference Result 51336 states and 158660 transitions. [2019-12-27 16:26:38,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 16:26:38,876 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 16:26:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:38,951 INFO L225 Difference]: With dead ends: 51336 [2019-12-27 16:26:38,951 INFO L226 Difference]: Without dead ends: 48773 [2019-12-27 16:26:38,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=911, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 16:26:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48773 states. [2019-12-27 16:26:39,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48773 to 29223. [2019-12-27 16:26:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29223 states. [2019-12-27 16:26:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29223 states to 29223 states and 90008 transitions. [2019-12-27 16:26:39,546 INFO L78 Accepts]: Start accepts. Automaton has 29223 states and 90008 transitions. Word has length 65 [2019-12-27 16:26:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:39,546 INFO L462 AbstractCegarLoop]: Abstraction has 29223 states and 90008 transitions. [2019-12-27 16:26:39,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:26:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 29223 states and 90008 transitions. [2019-12-27 16:26:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:26:39,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:39,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:39,578 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:39,579 INFO L82 PathProgramCache]: Analyzing trace with hash 51203325, now seen corresponding path program 3 times [2019-12-27 16:26:39,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:39,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571692924] [2019-12-27 16:26:39,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:39,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571692924] [2019-12-27 16:26:39,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:39,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:26:39,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2116700818] [2019-12-27 16:26:39,644 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:39,667 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:40,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 396 states and 834 transitions. [2019-12-27 16:26:40,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:40,044 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:26:40,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:26:40,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:40,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:26:40,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:40,045 INFO L87 Difference]: Start difference. First operand 29223 states and 90008 transitions. Second operand 3 states. [2019-12-27 16:26:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:40,184 INFO L93 Difference]: Finished difference Result 34030 states and 104047 transitions. [2019-12-27 16:26:40,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:26:40,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 16:26:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:40,230 INFO L225 Difference]: With dead ends: 34030 [2019-12-27 16:26:40,230 INFO L226 Difference]: Without dead ends: 34030 [2019-12-27 16:26:40,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34030 states. [2019-12-27 16:26:40,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34030 to 29228. [2019-12-27 16:26:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29228 states. [2019-12-27 16:26:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29228 states to 29228 states and 90254 transitions. [2019-12-27 16:26:41,026 INFO L78 Accepts]: Start accepts. Automaton has 29228 states and 90254 transitions. Word has length 65 [2019-12-27 16:26:41,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:41,026 INFO L462 AbstractCegarLoop]: Abstraction has 29228 states and 90254 transitions. [2019-12-27 16:26:41,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:26:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 29228 states and 90254 transitions. [2019-12-27 16:26:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:41,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:41,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:41,059 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:41,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:41,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1239159877, now seen corresponding path program 1 times [2019-12-27 16:26:41,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:41,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206449359] [2019-12-27 16:26:41,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:41,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206449359] [2019-12-27 16:26:41,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:41,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 16:26:41,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1641895146] [2019-12-27 16:26:41,510 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:41,531 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:41,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 397 states and 834 transitions. [2019-12-27 16:26:41,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:42,508 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 16:26:42,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 16:26:42,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:42,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 16:26:42,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:26:42,509 INFO L87 Difference]: Start difference. First operand 29228 states and 90254 transitions. Second operand 22 states. [2019-12-27 16:26:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:50,675 INFO L93 Difference]: Finished difference Result 79509 states and 240452 transitions. [2019-12-27 16:26:50,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-27 16:26:50,676 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2019-12-27 16:26:50,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:50,768 INFO L225 Difference]: With dead ends: 79509 [2019-12-27 16:26:50,768 INFO L226 Difference]: Without dead ends: 67006 [2019-12-27 16:26:50,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 15 SyntacticMatches, 19 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=831, Invalid=4571, Unknown=0, NotChecked=0, Total=5402 [2019-12-27 16:26:50,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67006 states. [2019-12-27 16:26:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67006 to 28803. [2019-12-27 16:26:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28803 states. [2019-12-27 16:26:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28803 states to 28803 states and 88481 transitions. [2019-12-27 16:26:51,455 INFO L78 Accepts]: Start accepts. Automaton has 28803 states and 88481 transitions. Word has length 66 [2019-12-27 16:26:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:51,456 INFO L462 AbstractCegarLoop]: Abstraction has 28803 states and 88481 transitions. [2019-12-27 16:26:51,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 16:26:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 28803 states and 88481 transitions. [2019-12-27 16:26:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:51,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:51,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:51,489 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:51,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash 38318619, now seen corresponding path program 2 times [2019-12-27 16:26:51,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:51,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628517114] [2019-12-27 16:26:51,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:51,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628517114] [2019-12-27 16:26:51,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:51,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:26:51,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1089504764] [2019-12-27 16:26:51,677 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:51,694 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:51,953 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 328 states and 668 transitions. [2019-12-27 16:26:51,953 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:52,273 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 16:26:52,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 16:26:52,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:52,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 16:26:52,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:26:52,274 INFO L87 Difference]: Start difference. First operand 28803 states and 88481 transitions. Second operand 15 states. [2019-12-27 16:26:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:56,096 INFO L93 Difference]: Finished difference Result 70115 states and 213162 transitions. [2019-12-27 16:26:56,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 16:26:56,096 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 16:26:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:56,193 INFO L225 Difference]: With dead ends: 70115 [2019-12-27 16:26:56,193 INFO L226 Difference]: Without dead ends: 62082 [2019-12-27 16:26:56,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=614, Invalid=3292, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 16:26:56,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62082 states. [2019-12-27 16:26:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62082 to 23899. [2019-12-27 16:26:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23899 states. [2019-12-27 16:26:57,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23899 states to 23899 states and 73276 transitions. [2019-12-27 16:26:57,147 INFO L78 Accepts]: Start accepts. Automaton has 23899 states and 73276 transitions. Word has length 66 [2019-12-27 16:26:57,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:57,148 INFO L462 AbstractCegarLoop]: Abstraction has 23899 states and 73276 transitions. [2019-12-27 16:26:57,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 16:26:57,148 INFO L276 IsEmpty]: Start isEmpty. Operand 23899 states and 73276 transitions. [2019-12-27 16:26:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:57,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26: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] [2019-12-27 16:26:57,178 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:57,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:57,178 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 3 times [2019-12-27 16:26:57,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:57,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590418432] [2019-12-27 16:26:57,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:26:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:26:57,310 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:26:57,311 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:26:57,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= 0 |v_ULTIMATE.start_main_~#t657~0.offset_16|) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t657~0.base_22|) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= v_~z$w_buff1_used~0_500 0) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t657~0.base_22| 4)) (= v_~z$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t657~0.base_22| 1) |v_#valid_69|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t657~0.base_22|)) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t657~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t657~0.base_22|) |v_ULTIMATE.start_main_~#t657~0.offset_16| 0)) |v_#memory_int_19|) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t658~0.offset=|v_ULTIMATE.start_main_~#t658~0.offset_14|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, ULTIMATE.start_main_~#t659~0.base=|v_ULTIMATE.start_main_~#t659~0.base_17|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_~#t658~0.base=|v_ULTIMATE.start_main_~#t658~0.base_19|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, ULTIMATE.start_main_~#t657~0.base=|v_ULTIMATE.start_main_~#t657~0.base_22|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t657~0.offset=|v_ULTIMATE.start_main_~#t657~0.offset_16|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~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_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_133, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ULTIMATE.start_main_~#t659~0.offset=|v_ULTIMATE.start_main_~#t659~0.offset_14|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t658~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t659~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t658~0.base, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t657~0.base, ULTIMATE.start_main_~#t657~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t659~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:26:57,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:26:57,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t658~0.base_11| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t658~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t658~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t658~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t658~0.base_11|) |v_ULTIMATE.start_main_~#t658~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t658~0.base_11| 1) |v_#valid_31|) (= 0 |v_ULTIMATE.start_main_~#t658~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t658~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t658~0.offset=|v_ULTIMATE.start_main_~#t658~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t658~0.base=|v_ULTIMATE.start_main_~#t658~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t658~0.offset, ULTIMATE.start_main_~#t658~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 16:26:57,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t659~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t659~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t659~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t659~0.base_12|) |v_ULTIMATE.start_main_~#t659~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t659~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t659~0.base_12| 0)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t659~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t659~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t659~0.offset=|v_ULTIMATE.start_main_~#t659~0.offset_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t659~0.base=|v_ULTIMATE.start_main_~#t659~0.base_12|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t659~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t659~0.base, #length] because there is no mapped edge [2019-12-27 16:26:57,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1364343136 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1364343136 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out-1364343136| |P1Thread1of1ForFork2_#t~ite9_Out-1364343136|))) (or (and (= ~z~0_In-1364343136 |P1Thread1of1ForFork2_#t~ite9_Out-1364343136|) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1364343136 |P1Thread1of1ForFork2_#t~ite9_Out-1364343136|) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1364343136, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1364343136, ~z$w_buff1~0=~z$w_buff1~0_In-1364343136, ~z~0=~z~0_In-1364343136} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1364343136|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1364343136, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1364343136|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1364343136, ~z$w_buff1~0=~z$w_buff1~0_In-1364343136, ~z~0=~z~0_In-1364343136} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 16:26:57,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1874283540 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1874283540 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-1874283540 256) 0) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-1874283540 256)) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-1874283540 256) 0)))) .cse1 (= |P2Thread1of1ForFork0_#t~ite24_Out-1874283540| |P2Thread1of1ForFork0_#t~ite23_Out-1874283540|) (= ~z$w_buff1~0_In-1874283540 |P2Thread1of1ForFork0_#t~ite23_Out-1874283540|)) (and (= |P2Thread1of1ForFork0_#t~ite23_In-1874283540| |P2Thread1of1ForFork0_#t~ite23_Out-1874283540|) (not .cse1) (= ~z$w_buff1~0_In-1874283540 |P2Thread1of1ForFork0_#t~ite24_Out-1874283540|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1874283540, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1874283540, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1874283540|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1874283540, ~z$w_buff1~0=~z$w_buff1~0_In-1874283540, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1874283540, ~weak$$choice2~0=~weak$$choice2~0_In-1874283540} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1874283540, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1874283540|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1874283540, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1874283540|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1874283540, ~z$w_buff1~0=~z$w_buff1~0_In-1874283540, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1874283540, ~weak$$choice2~0=~weak$$choice2~0_In-1874283540} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 16:26:57,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-607041446 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-607041446 256))) (.cse6 (= (mod ~z$r_buff0_thd3~0_In-607041446 256) 0)) (.cse5 (= 0 (mod ~z$w_buff1_used~0_In-607041446 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite30_Out-607041446| |P2Thread1of1ForFork0_#t~ite29_Out-607041446|)) (.cse1 (= (mod ~weak$$choice2~0_In-607041446 256) 0))) (or (let ((.cse4 (not .cse6))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out-607041446| 0) .cse1 .cse2 (= |P2Thread1of1ForFork0_#t~ite28_Out-607041446| |P2Thread1of1ForFork0_#t~ite29_Out-607041446|) (or (not .cse3) .cse4) (or (not .cse5) .cse4))) (and (= |P2Thread1of1ForFork0_#t~ite28_In-607041446| |P2Thread1of1ForFork0_#t~ite28_Out-607041446|) (or (and (or (and .cse6 .cse3) .cse0 (and .cse6 .cse5)) .cse1 .cse2 (= |P2Thread1of1ForFork0_#t~ite29_Out-607041446| ~z$w_buff1_used~0_In-607041446)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite30_Out-607041446| ~z$w_buff1_used~0_In-607041446) (= |P2Thread1of1ForFork0_#t~ite29_In-607041446| |P2Thread1of1ForFork0_#t~ite29_Out-607041446|)))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-607041446|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-607041446, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-607041446, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-607041446, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-607041446, ~weak$$choice2~0=~weak$$choice2~0_In-607041446, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-607041446|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-607041446|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-607041446, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-607041446, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-607041446, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-607041446, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-607041446|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-607041446|, ~weak$$choice2~0=~weak$$choice2~0_In-607041446} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:26:57,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:26:57,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 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{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:26:57,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2117009777 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2117009777 256))) (.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out-2117009777| |P2Thread1of1ForFork0_#t~ite38_Out-2117009777|))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-2117009777| ~z$w_buff1~0_In-2117009777) .cse0 (not .cse1) (not .cse2)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-2117009777| ~z~0_In-2117009777) (or .cse2 .cse1) .cse0))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2117009777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2117009777, ~z$w_buff1~0=~z$w_buff1~0_In-2117009777, ~z~0=~z~0_In-2117009777} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-2117009777|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-2117009777|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2117009777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2117009777, ~z$w_buff1~0=~z$w_buff1~0_In-2117009777, ~z~0=~z~0_In-2117009777} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:26:57,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1698430879 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1698430879 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1698430879| ~z$w_buff0_used~0_In-1698430879) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1698430879| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1698430879, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1698430879} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1698430879, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1698430879|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1698430879} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:26:57,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1906166664 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1906166664 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1906166664 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1906166664 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-1906166664| ~z$w_buff1_used~0_In-1906166664)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1906166664|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1906166664, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1906166664, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1906166664, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1906166664} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1906166664, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1906166664, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1906166664, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1906166664, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1906166664|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:26:57,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-2044505109 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2044505109 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-2044505109|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-2044505109| ~z$r_buff0_thd3~0_In-2044505109)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2044505109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2044505109} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2044505109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2044505109, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-2044505109|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:26:57,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In443878647 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In443878647 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In443878647 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In443878647 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out443878647| ~z$r_buff1_thd3~0_In443878647) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out443878647| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In443878647, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In443878647, ~z$w_buff1_used~0=~z$w_buff1_used~0_In443878647, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In443878647} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out443878647|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In443878647, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In443878647, ~z$w_buff1_used~0=~z$w_buff1_used~0_In443878647, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In443878647} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:26:57,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:26:57,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1537533854 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1537533854 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1537533854|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1537533854 |P0Thread1of1ForFork1_#t~ite5_Out-1537533854|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1537533854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1537533854} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1537533854|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1537533854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1537533854} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:26:57,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1451567527 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1451567527 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1451567527 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In1451567527 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1451567527|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1451567527 |P0Thread1of1ForFork1_#t~ite6_Out1451567527|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1451567527, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1451567527, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1451567527, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1451567527} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1451567527, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1451567527|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1451567527, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1451567527, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1451567527} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:26:57,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-500044260 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-500044260 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-500044260)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In-500044260 ~z$r_buff0_thd1~0_Out-500044260)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-500044260, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-500044260} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-500044260, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-500044260|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-500044260} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:26:57,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In-1002797458 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1002797458 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1002797458 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1002797458 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-1002797458| ~z$r_buff1_thd1~0_In-1002797458) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite8_Out-1002797458| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1002797458, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1002797458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1002797458, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1002797458} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1002797458|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1002797458, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1002797458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1002797458, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1002797458} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:26:57,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:26:57,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-675516016 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-675516016 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-675516016| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-675516016| ~z$w_buff0_used~0_In-675516016)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-675516016, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-675516016} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-675516016, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-675516016|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-675516016} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:26:57,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In707898043 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In707898043 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In707898043 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In707898043 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out707898043| ~z$w_buff1_used~0_In707898043) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out707898043| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In707898043, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In707898043, ~z$w_buff1_used~0=~z$w_buff1_used~0_In707898043, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In707898043} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In707898043, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In707898043, ~z$w_buff1_used~0=~z$w_buff1_used~0_In707898043, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out707898043|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In707898043} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:26:57,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-72789785 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-72789785 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-72789785| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-72789785 |P1Thread1of1ForFork2_#t~ite13_Out-72789785|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-72789785, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-72789785} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-72789785, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-72789785|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-72789785} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:26:57,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In311550866 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In311550866 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In311550866 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In311550866 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out311550866|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In311550866 |P1Thread1of1ForFork2_#t~ite14_Out311550866|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In311550866, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In311550866, ~z$w_buff1_used~0=~z$w_buff1_used~0_In311550866, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In311550866} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In311550866, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In311550866, ~z$w_buff1_used~0=~z$w_buff1_used~0_In311550866, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out311550866|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In311550866} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:26:57,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:26:57,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: 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-27 16:26:57,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In952974901 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In952974901 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out952974901| ~z~0_In952974901) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out952974901| ~z$w_buff1~0_In952974901) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In952974901, ~z$w_buff1_used~0=~z$w_buff1_used~0_In952974901, ~z$w_buff1~0=~z$w_buff1~0_In952974901, ~z~0=~z~0_In952974901} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In952974901, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out952974901|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In952974901, ~z$w_buff1~0=~z$w_buff1~0_In952974901, ~z~0=~z~0_In952974901} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:26:57,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 16:26:57,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-88199484 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-88199484 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-88199484|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-88199484 |ULTIMATE.start_main_#t~ite49_Out-88199484|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-88199484, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-88199484} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-88199484, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-88199484, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-88199484|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:26:57,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1221059725 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1221059725 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1221059725 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1221059725 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1221059725| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out1221059725| ~z$w_buff1_used~0_In1221059725) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1221059725, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1221059725, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1221059725, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1221059725} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1221059725|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1221059725, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1221059725, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1221059725, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1221059725} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:26:57,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1749079058 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1749079058 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In1749079058 |ULTIMATE.start_main_#t~ite51_Out1749079058|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1749079058|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1749079058, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1749079058} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1749079058, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1749079058|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1749079058} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:26:57,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In463533007 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In463533007 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In463533007 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In463533007 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out463533007| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In463533007 |ULTIMATE.start_main_#t~ite52_Out463533007|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In463533007, ~z$w_buff0_used~0=~z$w_buff0_used~0_In463533007, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In463533007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In463533007} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out463533007|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In463533007, ~z$w_buff0_used~0=~z$w_buff0_used~0_In463533007, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In463533007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In463533007} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:26:57,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:26:57,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:26:57 BasicIcfg [2019-12-27 16:26:57,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:26:57,444 INFO L168 Benchmark]: Toolchain (without parser) took 131989.81 ms. Allocated memory was 138.4 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 101.7 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 16:26:57,445 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 16:26:57,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.89 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 156.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:26:57,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.27 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:26:57,446 INFO L168 Benchmark]: Boogie Preprocessor took 42.59 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:26:57,446 INFO L168 Benchmark]: RCFGBuilder took 915.59 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 101.1 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:26:57,446 INFO L168 Benchmark]: TraceAbstraction took 130191.03 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 16:26:57,448 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.89 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 156.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.27 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.59 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 915.59 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 101.1 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 130191.03 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] 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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L827] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L766] 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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L829] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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] [L790] 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_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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] [L790] 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) [L766] 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) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, 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] [L791] 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)) [L792] 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)) [L793] 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_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_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=1, 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] [L793] 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)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, 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] [L796] 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)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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] [L802] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 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) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 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 [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 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) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 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 [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 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 [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 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_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 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 [L838] 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, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 129.8s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 48.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7685 SDtfs, 10549 SDslu, 28647 SDs, 0 SdLazy, 22501 SolverSat, 664 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 621 GetRequests, 149 SyntacticMatches, 85 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3764 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 44.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 414213 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1231 NumberOfCodeBlocks, 1231 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1136 ConstructedInterpolants, 0 QuantifiedInterpolants, 218365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...