/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:47:47,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:47:47,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:47:47,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:47:47,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:47:47,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:47:47,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:47:47,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:47:47,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:47:47,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:47:47,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:47:47,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:47:47,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:47:47,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:47:47,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:47:47,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:47:47,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:47:47,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:47:47,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:47:47,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:47:47,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:47:47,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:47:47,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:47:47,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:47:47,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:47:47,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:47:47,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:47:47,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:47:47,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:47:47,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:47:47,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:47:47,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:47:47,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:47:47,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:47:47,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:47:47,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:47:47,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:47:47,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:47:47,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:47:47,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:47:47,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:47:47,228 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:47:47,242 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:47:47,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:47:47,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:47:47,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:47:47,244 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:47:47,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:47:47,245 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:47:47,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:47:47,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:47:47,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:47:47,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:47:47,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:47:47,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:47:47,246 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:47:47,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:47:47,246 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:47:47,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:47:47,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:47:47,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:47:47,247 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:47:47,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:47:47,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:47:47,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:47:47,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:47:47,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:47:47,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:47:47,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:47:47,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:47:47,250 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:47:47,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:47:47,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:47:47,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:47:47,534 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:47:47,535 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:47:47,535 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2019-12-27 03:47:47,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4645bff/ca8745fde62f489c9e9f991ae0083b3f/FLAG86367cffc [2019-12-27 03:47:48,169 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:47:48,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2019-12-27 03:47:48,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4645bff/ca8745fde62f489c9e9f991ae0083b3f/FLAG86367cffc [2019-12-27 03:47:48,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4645bff/ca8745fde62f489c9e9f991ae0083b3f [2019-12-27 03:47:48,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:47:48,442 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:47:48,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:47:48,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:47:48,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:47:48,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:47:48" (1/1) ... [2019-12-27 03:47:48,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c9b576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:47:48, skipping insertion in model container [2019-12-27 03:47:48,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:47:48" (1/1) ... [2019-12-27 03:47:48,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:47:48,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:47:49,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:47:49,122 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:47:49,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:47:49,291 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:47:49,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:47:49 WrapperNode [2019-12-27 03:47:49,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:47:49,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:47:49,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:47:49,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:47:49,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:47:49" (1/1) ... [2019-12-27 03:47:49,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:47:49" (1/1) ... [2019-12-27 03:47:49,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:47:49,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:47:49,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:47:49,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:47:49,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:47:49" (1/1) ... [2019-12-27 03:47:49,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:47:49" (1/1) ... [2019-12-27 03:47:49,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:47:49" (1/1) ... [2019-12-27 03:47:49,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:47:49" (1/1) ... [2019-12-27 03:47:49,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:47:49" (1/1) ... [2019-12-27 03:47:49,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:47:49" (1/1) ... [2019-12-27 03:47:49,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:47:49" (1/1) ... [2019-12-27 03:47:49,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:47:49,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:47:49,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:47:49,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:47:49,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:47:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:47:49,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:47:49,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:47:49,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:47:49,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:47:49,471 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:47:49,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:47:49,471 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:47:49,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:47:49,472 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:47:49,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:47:49,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:47:49,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:47:49,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:47:49,474 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:47:50,272 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:47:50,272 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:47:50,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:47:50 BoogieIcfgContainer [2019-12-27 03:47:50,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:47:50,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:47:50,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:47:50,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:47:50,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:47:48" (1/3) ... [2019-12-27 03:47:50,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f657f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:47:50, skipping insertion in model container [2019-12-27 03:47:50,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:47:49" (2/3) ... [2019-12-27 03:47:50,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f657f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:47:50, skipping insertion in model container [2019-12-27 03:47:50,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:47:50" (3/3) ... [2019-12-27 03:47:50,282 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_pso.oepc.i [2019-12-27 03:47:50,291 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:47:50,292 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:47:50,300 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:47:50,301 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:47:50,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,339 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,339 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,340 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,340 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,341 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,349 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,349 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,379 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,381 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,395 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,410 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,418 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,424 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,424 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:47:50,442 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:47:50,465 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:47:50,465 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:47:50,465 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:47:50,465 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:47:50,465 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:47:50,465 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:47:50,465 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:47:50,466 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:47:50,490 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-27 03:47:50,492 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 03:47:50,606 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 03:47:50,606 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:47:50,621 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:47:50,648 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 03:47:50,730 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 03:47:50,730 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:47:50,743 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:47:50,767 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 03:47:50,768 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:47:55,840 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-27 03:47:56,104 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 03:47:56,238 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 03:47:56,267 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78185 [2019-12-27 03:47:56,267 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 03:47:56,271 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 03:48:12,313 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 112926 states. [2019-12-27 03:48:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand 112926 states. [2019-12-27 03:48:12,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:48:12,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:12,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:48:12,321 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 03:48:12,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:12,326 INFO L82 PathProgramCache]: Analyzing trace with hash 844394, now seen corresponding path program 1 times [2019-12-27 03:48:12,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:12,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663362824] [2019-12-27 03:48:12,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:12,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663362824] [2019-12-27 03:48:12,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:12,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:48:12,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934082808] [2019-12-27 03:48:12,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:48:12,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:12,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:48:12,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:48:12,618 INFO L87 Difference]: Start difference. First operand 112926 states. Second operand 3 states. [2019-12-27 03:48:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:15,653 INFO L93 Difference]: Finished difference Result 112536 states and 479624 transitions. [2019-12-27 03:48:15,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:48:15,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:48:15,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:16,575 INFO L225 Difference]: With dead ends: 112536 [2019-12-27 03:48:16,576 INFO L226 Difference]: Without dead ends: 110184 [2019-12-27 03:48:16,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:48:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110184 states. [2019-12-27 03:48:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110184 to 110184. [2019-12-27 03:48:25,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110184 states. [2019-12-27 03:48:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110184 states to 110184 states and 470020 transitions. [2019-12-27 03:48:26,201 INFO L78 Accepts]: Start accepts. Automaton has 110184 states and 470020 transitions. Word has length 3 [2019-12-27 03:48:26,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:26,201 INFO L462 AbstractCegarLoop]: Abstraction has 110184 states and 470020 transitions. [2019-12-27 03:48:26,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:48:26,201 INFO L276 IsEmpty]: Start isEmpty. Operand 110184 states and 470020 transitions. [2019-12-27 03:48:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:48:26,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:26,205 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:48:26,206 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 03:48:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash -418531443, now seen corresponding path program 1 times [2019-12-27 03:48:26,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:26,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125377686] [2019-12-27 03:48:26,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:26,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125377686] [2019-12-27 03:48:26,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:26,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:48:26,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274344653] [2019-12-27 03:48:26,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:48:26,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:26,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:48:26,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:48:26,339 INFO L87 Difference]: Start difference. First operand 110184 states and 470020 transitions. Second operand 4 states. [2019-12-27 03:48:32,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:32,207 INFO L93 Difference]: Finished difference Result 172298 states and 706272 transitions. [2019-12-27 03:48:32,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:48:32,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:48:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:32,775 INFO L225 Difference]: With dead ends: 172298 [2019-12-27 03:48:32,775 INFO L226 Difference]: Without dead ends: 172249 [2019-12-27 03:48:32,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:48:37,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172249 states. [2019-12-27 03:48:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172249 to 156321. [2019-12-27 03:48:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156321 states. [2019-12-27 03:48:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156321 states to 156321 states and 647667 transitions. [2019-12-27 03:48:41,443 INFO L78 Accepts]: Start accepts. Automaton has 156321 states and 647667 transitions. Word has length 11 [2019-12-27 03:48:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:41,444 INFO L462 AbstractCegarLoop]: Abstraction has 156321 states and 647667 transitions. [2019-12-27 03:48:41,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:48:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 156321 states and 647667 transitions. [2019-12-27 03:48:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:48:41,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:41,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:48:41,451 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 03:48:41,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:41,452 INFO L82 PathProgramCache]: Analyzing trace with hash -986312255, now seen corresponding path program 1 times [2019-12-27 03:48:41,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:41,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156882964] [2019-12-27 03:48:41,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:41,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156882964] [2019-12-27 03:48:41,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:41,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:48:41,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248675732] [2019-12-27 03:48:41,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:48:41,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:41,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:48:41,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:48:41,522 INFO L87 Difference]: Start difference. First operand 156321 states and 647667 transitions. Second operand 3 states. [2019-12-27 03:48:41,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:41,632 INFO L93 Difference]: Finished difference Result 32129 states and 104196 transitions. [2019-12-27 03:48:41,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:48:41,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:48:41,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:41,712 INFO L225 Difference]: With dead ends: 32129 [2019-12-27 03:48:41,712 INFO L226 Difference]: Without dead ends: 32129 [2019-12-27 03:48:41,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:48:46,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32129 states. [2019-12-27 03:48:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32129 to 32129. [2019-12-27 03:48:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32129 states. [2019-12-27 03:48:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32129 states to 32129 states and 104196 transitions. [2019-12-27 03:48:47,075 INFO L78 Accepts]: Start accepts. Automaton has 32129 states and 104196 transitions. Word has length 13 [2019-12-27 03:48:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:47,076 INFO L462 AbstractCegarLoop]: Abstraction has 32129 states and 104196 transitions. [2019-12-27 03:48:47,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:48:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 32129 states and 104196 transitions. [2019-12-27 03:48:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:48:47,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:47,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:48:47,078 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 03:48:47,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:47,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1176456771, now seen corresponding path program 1 times [2019-12-27 03:48:47,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:47,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943635409] [2019-12-27 03:48:47,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:47,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943635409] [2019-12-27 03:48:47,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:47,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:48:47,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490219289] [2019-12-27 03:48:47,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:48:47,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:47,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:48:47,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:48:47,146 INFO L87 Difference]: Start difference. First operand 32129 states and 104196 transitions. Second operand 4 states. [2019-12-27 03:48:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:47,572 INFO L93 Difference]: Finished difference Result 43159 states and 136814 transitions. [2019-12-27 03:48:47,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:48:47,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:48:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:47,661 INFO L225 Difference]: With dead ends: 43159 [2019-12-27 03:48:47,661 INFO L226 Difference]: Without dead ends: 43152 [2019-12-27 03:48:47,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:48:47,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43152 states. [2019-12-27 03:48:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43152 to 37631. [2019-12-27 03:48:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37631 states. [2019-12-27 03:48:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37631 states to 37631 states and 121166 transitions. [2019-12-27 03:48:48,879 INFO L78 Accepts]: Start accepts. Automaton has 37631 states and 121166 transitions. Word has length 13 [2019-12-27 03:48:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:48,879 INFO L462 AbstractCegarLoop]: Abstraction has 37631 states and 121166 transitions. [2019-12-27 03:48:48,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:48:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 37631 states and 121166 transitions. [2019-12-27 03:48:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:48:48,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:48,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:48:48,885 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 03:48:48,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:48,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2012510844, now seen corresponding path program 1 times [2019-12-27 03:48:48,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:48,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304110691] [2019-12-27 03:48:48,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:49,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304110691] [2019-12-27 03:48:49,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:49,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:48:49,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025262965] [2019-12-27 03:48:49,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:48:49,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:49,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:48:49,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:48:49,027 INFO L87 Difference]: Start difference. First operand 37631 states and 121166 transitions. Second operand 5 states. [2019-12-27 03:48:49,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:49,818 INFO L93 Difference]: Finished difference Result 50788 states and 160280 transitions. [2019-12-27 03:48:49,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:48:49,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 03:48:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:49,918 INFO L225 Difference]: With dead ends: 50788 [2019-12-27 03:48:49,918 INFO L226 Difference]: Without dead ends: 50775 [2019-12-27 03:48:49,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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 03:48:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50775 states. [2019-12-27 03:48:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50775 to 38059. [2019-12-27 03:48:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38059 states. [2019-12-27 03:48:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38059 states to 38059 states and 122380 transitions. [2019-12-27 03:48:50,718 INFO L78 Accepts]: Start accepts. Automaton has 38059 states and 122380 transitions. Word has length 19 [2019-12-27 03:48:50,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:50,718 INFO L462 AbstractCegarLoop]: Abstraction has 38059 states and 122380 transitions. [2019-12-27 03:48:50,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:48:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 38059 states and 122380 transitions. [2019-12-27 03:48:50,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:48:50,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:50,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:48:50,733 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 03:48:50,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:50,733 INFO L82 PathProgramCache]: Analyzing trace with hash -394195806, now seen corresponding path program 1 times [2019-12-27 03:48:50,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:50,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124070320] [2019-12-27 03:48:50,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:50,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124070320] [2019-12-27 03:48:50,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:50,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:48:50,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504110205] [2019-12-27 03:48:50,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:48:50,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:50,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:48:50,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:48:50,797 INFO L87 Difference]: Start difference. First operand 38059 states and 122380 transitions. Second operand 4 states. [2019-12-27 03:48:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:50,844 INFO L93 Difference]: Finished difference Result 7382 states and 20162 transitions. [2019-12-27 03:48:50,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:48:50,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:48:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:50,857 INFO L225 Difference]: With dead ends: 7382 [2019-12-27 03:48:50,857 INFO L226 Difference]: Without dead ends: 7382 [2019-12-27 03:48:50,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:48:50,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-12-27 03:48:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7270. [2019-12-27 03:48:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7270 states. [2019-12-27 03:48:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 19842 transitions. [2019-12-27 03:48:50,970 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 19842 transitions. Word has length 25 [2019-12-27 03:48:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:50,971 INFO L462 AbstractCegarLoop]: Abstraction has 7270 states and 19842 transitions. [2019-12-27 03:48:50,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:48:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 19842 transitions. [2019-12-27 03:48:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 03:48:50,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:50,983 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] [2019-12-27 03:48:50,983 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 03:48:50,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:50,984 INFO L82 PathProgramCache]: Analyzing trace with hash 56145512, now seen corresponding path program 1 times [2019-12-27 03:48:50,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:50,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522117509] [2019-12-27 03:48:50,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:51,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522117509] [2019-12-27 03:48:51,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:51,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:48:51,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733062097] [2019-12-27 03:48:51,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:48:51,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:51,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:48:51,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:48:51,060 INFO L87 Difference]: Start difference. First operand 7270 states and 19842 transitions. Second operand 5 states. [2019-12-27 03:48:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:51,105 INFO L93 Difference]: Finished difference Result 5311 states and 15265 transitions. [2019-12-27 03:48:51,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:48:51,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 03:48:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:51,115 INFO L225 Difference]: With dead ends: 5311 [2019-12-27 03:48:51,115 INFO L226 Difference]: Without dead ends: 5311 [2019-12-27 03:48:51,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:48:51,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-12-27 03:48:51,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4947. [2019-12-27 03:48:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4947 states. [2019-12-27 03:48:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 14281 transitions. [2019-12-27 03:48:51,247 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 14281 transitions. Word has length 37 [2019-12-27 03:48:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:51,248 INFO L462 AbstractCegarLoop]: Abstraction has 4947 states and 14281 transitions. [2019-12-27 03:48:51,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:48:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 14281 transitions. [2019-12-27 03:48:51,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:48:51,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:51,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, 1] [2019-12-27 03:48:51,264 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 03:48:51,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:51,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1380306829, now seen corresponding path program 1 times [2019-12-27 03:48:51,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:51,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048478233] [2019-12-27 03:48:51,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:51,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048478233] [2019-12-27 03:48:51,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:51,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:48:51,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414339974] [2019-12-27 03:48:51,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:48:51,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:51,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:48:51,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:48:51,393 INFO L87 Difference]: Start difference. First operand 4947 states and 14281 transitions. Second operand 3 states. [2019-12-27 03:48:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:51,451 INFO L93 Difference]: Finished difference Result 4958 states and 14296 transitions. [2019-12-27 03:48:51,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:48:51,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:48:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:51,464 INFO L225 Difference]: With dead ends: 4958 [2019-12-27 03:48:51,465 INFO L226 Difference]: Without dead ends: 4958 [2019-12-27 03:48:51,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:48:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2019-12-27 03:48:51,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4954. [2019-12-27 03:48:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4954 states. [2019-12-27 03:48:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 14292 transitions. [2019-12-27 03:48:51,728 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 14292 transitions. Word has length 65 [2019-12-27 03:48:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:51,729 INFO L462 AbstractCegarLoop]: Abstraction has 4954 states and 14292 transitions. [2019-12-27 03:48:51,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:48:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 14292 transitions. [2019-12-27 03:48:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:48:51,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:51,737 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 03:48:51,737 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 03:48:51,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:51,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1838424094, now seen corresponding path program 1 times [2019-12-27 03:48:51,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:51,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996398563] [2019-12-27 03:48:51,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:51,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996398563] [2019-12-27 03:48:51,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:51,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:48:51,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113543792] [2019-12-27 03:48:51,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:48:51,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:51,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:48:51,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:48:51,881 INFO L87 Difference]: Start difference. First operand 4954 states and 14292 transitions. Second operand 5 states. [2019-12-27 03:48:52,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:52,188 INFO L93 Difference]: Finished difference Result 7545 states and 21557 transitions. [2019-12-27 03:48:52,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:48:52,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 03:48:52,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:52,200 INFO L225 Difference]: With dead ends: 7545 [2019-12-27 03:48:52,200 INFO L226 Difference]: Without dead ends: 7545 [2019-12-27 03:48:52,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:48:52,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7545 states. [2019-12-27 03:48:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7545 to 6351. [2019-12-27 03:48:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6351 states. [2019-12-27 03:48:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6351 states to 6351 states and 18327 transitions. [2019-12-27 03:48:52,293 INFO L78 Accepts]: Start accepts. Automaton has 6351 states and 18327 transitions. Word has length 65 [2019-12-27 03:48:52,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:52,293 INFO L462 AbstractCegarLoop]: Abstraction has 6351 states and 18327 transitions. [2019-12-27 03:48:52,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:48:52,293 INFO L276 IsEmpty]: Start isEmpty. Operand 6351 states and 18327 transitions. [2019-12-27 03:48:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:48:52,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:52,302 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 03:48:52,302 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 03:48:52,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:52,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1320159464, now seen corresponding path program 2 times [2019-12-27 03:48:52,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:52,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253008681] [2019-12-27 03:48:52,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:52,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253008681] [2019-12-27 03:48:52,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:52,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:48:52,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344580939] [2019-12-27 03:48:52,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:48:52,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:52,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:48:52,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:48:52,414 INFO L87 Difference]: Start difference. First operand 6351 states and 18327 transitions. Second operand 6 states. [2019-12-27 03:48:52,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:52,907 INFO L93 Difference]: Finished difference Result 10885 states and 31206 transitions. [2019-12-27 03:48:52,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:48:52,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 03:48:52,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:52,925 INFO L225 Difference]: With dead ends: 10885 [2019-12-27 03:48:52,925 INFO L226 Difference]: Without dead ends: 10885 [2019-12-27 03:48:52,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:48:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10885 states. [2019-12-27 03:48:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10885 to 7013. [2019-12-27 03:48:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7013 states. [2019-12-27 03:48:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7013 states to 7013 states and 20305 transitions. [2019-12-27 03:48:53,106 INFO L78 Accepts]: Start accepts. Automaton has 7013 states and 20305 transitions. Word has length 65 [2019-12-27 03:48:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:53,106 INFO L462 AbstractCegarLoop]: Abstraction has 7013 states and 20305 transitions. [2019-12-27 03:48:53,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:48:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 7013 states and 20305 transitions. [2019-12-27 03:48:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:48:53,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:53,120 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 03:48:53,120 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 03:48:53,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash -518212600, now seen corresponding path program 3 times [2019-12-27 03:48:53,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:53,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680065044] [2019-12-27 03:48:53,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:53,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680065044] [2019-12-27 03:48:53,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:53,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:48:53,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723864671] [2019-12-27 03:48:53,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:48:53,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:53,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:48:53,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:48:53,270 INFO L87 Difference]: Start difference. First operand 7013 states and 20305 transitions. Second operand 7 states. [2019-12-27 03:48:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:54,068 INFO L93 Difference]: Finished difference Result 10692 states and 30648 transitions. [2019-12-27 03:48:54,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:48:54,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 03:48:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:54,084 INFO L225 Difference]: With dead ends: 10692 [2019-12-27 03:48:54,085 INFO L226 Difference]: Without dead ends: 10692 [2019-12-27 03:48:54,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:48:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10692 states. [2019-12-27 03:48:54,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10692 to 6617. [2019-12-27 03:48:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6617 states. [2019-12-27 03:48:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 19142 transitions. [2019-12-27 03:48:54,202 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 19142 transitions. Word has length 65 [2019-12-27 03:48:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:54,202 INFO L462 AbstractCegarLoop]: Abstraction has 6617 states and 19142 transitions. [2019-12-27 03:48:54,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:48:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 19142 transitions. [2019-12-27 03:48:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:48:54,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:54,211 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 03:48:54,211 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 03:48:54,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:54,212 INFO L82 PathProgramCache]: Analyzing trace with hash -61468540, now seen corresponding path program 4 times [2019-12-27 03:48:54,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:54,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126427368] [2019-12-27 03:48:54,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:54,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126427368] [2019-12-27 03:48:54,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:54,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:48:54,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828322914] [2019-12-27 03:48:54,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:48:54,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:54,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:48:54,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:48:54,323 INFO L87 Difference]: Start difference. First operand 6617 states and 19142 transitions. Second operand 6 states. [2019-12-27 03:48:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:54,942 INFO L93 Difference]: Finished difference Result 9281 states and 26360 transitions. [2019-12-27 03:48:54,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:48:54,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 03:48:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:54,954 INFO L225 Difference]: With dead ends: 9281 [2019-12-27 03:48:54,955 INFO L226 Difference]: Without dead ends: 9281 [2019-12-27 03:48:54,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:48:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2019-12-27 03:48:55,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 6874. [2019-12-27 03:48:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2019-12-27 03:48:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 19886 transitions. [2019-12-27 03:48:55,061 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 19886 transitions. Word has length 65 [2019-12-27 03:48:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:55,061 INFO L462 AbstractCegarLoop]: Abstraction has 6874 states and 19886 transitions. [2019-12-27 03:48:55,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:48:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 19886 transitions. [2019-12-27 03:48:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:48:55,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:55,071 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 03:48:55,071 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 03:48:55,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:55,071 INFO L82 PathProgramCache]: Analyzing trace with hash 49095600, now seen corresponding path program 5 times [2019-12-27 03:48:55,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:55,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997905548] [2019-12-27 03:48:55,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:55,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997905548] [2019-12-27 03:48:55,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:55,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:48:55,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895649721] [2019-12-27 03:48:55,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:48:55,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:55,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:48:55,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:48:55,183 INFO L87 Difference]: Start difference. First operand 6874 states and 19886 transitions. Second operand 6 states. [2019-12-27 03:48:55,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:55,764 INFO L93 Difference]: Finished difference Result 11084 states and 31825 transitions. [2019-12-27 03:48:55,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:48:55,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 03:48:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:55,782 INFO L225 Difference]: With dead ends: 11084 [2019-12-27 03:48:55,782 INFO L226 Difference]: Without dead ends: 11084 [2019-12-27 03:48:55,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:48:55,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11084 states. [2019-12-27 03:48:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11084 to 7342. [2019-12-27 03:48:55,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7342 states. [2019-12-27 03:48:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 21312 transitions. [2019-12-27 03:48:55,920 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 21312 transitions. Word has length 65 [2019-12-27 03:48:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:55,920 INFO L462 AbstractCegarLoop]: Abstraction has 7342 states and 21312 transitions. [2019-12-27 03:48:55,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:48:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 21312 transitions. [2019-12-27 03:48:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:48:55,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:55,930 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 03:48:55,931 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 03:48:55,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:55,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1715239754, now seen corresponding path program 6 times [2019-12-27 03:48:55,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:55,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081780132] [2019-12-27 03:48:55,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:56,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 03:48:56,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081780132] [2019-12-27 03:48:56,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:56,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:48:56,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257034133] [2019-12-27 03:48:56,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:48:56,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:56,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:48:56,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:48:56,064 INFO L87 Difference]: Start difference. First operand 7342 states and 21312 transitions. Second operand 8 states. [2019-12-27 03:48:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:57,210 INFO L93 Difference]: Finished difference Result 12664 states and 36288 transitions. [2019-12-27 03:48:57,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:48:57,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 03:48:57,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:57,229 INFO L225 Difference]: With dead ends: 12664 [2019-12-27 03:48:57,229 INFO L226 Difference]: Without dead ends: 12664 [2019-12-27 03:48:57,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:48:57,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12664 states. [2019-12-27 03:48:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12664 to 7366. [2019-12-27 03:48:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7366 states. [2019-12-27 03:48:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7366 states to 7366 states and 21370 transitions. [2019-12-27 03:48:57,365 INFO L78 Accepts]: Start accepts. Automaton has 7366 states and 21370 transitions. Word has length 65 [2019-12-27 03:48:57,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:57,366 INFO L462 AbstractCegarLoop]: Abstraction has 7366 states and 21370 transitions. [2019-12-27 03:48:57,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:48:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 7366 states and 21370 transitions. [2019-12-27 03:48:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:48:57,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:57,377 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 03:48:57,377 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 03:48:57,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:57,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2133950940, now seen corresponding path program 7 times [2019-12-27 03:48:57,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:57,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137820480] [2019-12-27 03:48:57,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:57,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137820480] [2019-12-27 03:48:57,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:57,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:48:57,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106358291] [2019-12-27 03:48:57,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:48:57,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:57,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:48:57,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:48:57,482 INFO L87 Difference]: Start difference. First operand 7366 states and 21370 transitions. Second operand 6 states. [2019-12-27 03:48:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:58,032 INFO L93 Difference]: Finished difference Result 11343 states and 32283 transitions. [2019-12-27 03:48:58,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:48:58,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 03:48:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:58,048 INFO L225 Difference]: With dead ends: 11343 [2019-12-27 03:48:58,049 INFO L226 Difference]: Without dead ends: 11343 [2019-12-27 03:48:58,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:48:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11343 states. [2019-12-27 03:48:58,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11343 to 8250. [2019-12-27 03:48:58,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8250 states. [2019-12-27 03:48:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8250 states to 8250 states and 23904 transitions. [2019-12-27 03:48:58,186 INFO L78 Accepts]: Start accepts. Automaton has 8250 states and 23904 transitions. Word has length 65 [2019-12-27 03:48:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:58,186 INFO L462 AbstractCegarLoop]: Abstraction has 8250 states and 23904 transitions. [2019-12-27 03:48:58,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:48:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 8250 states and 23904 transitions. [2019-12-27 03:48:58,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:48:58,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:58,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:48:58,197 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 03:48:58,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:58,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1019599714, now seen corresponding path program 8 times [2019-12-27 03:48:58,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:58,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387182557] [2019-12-27 03:48:58,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:58,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387182557] [2019-12-27 03:48:58,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:58,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:48:58,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102032546] [2019-12-27 03:48:58,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:48:58,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:58,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:48:58,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:48:58,312 INFO L87 Difference]: Start difference. First operand 8250 states and 23904 transitions. Second operand 7 states. [2019-12-27 03:48:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:59,291 INFO L93 Difference]: Finished difference Result 11821 states and 33657 transitions. [2019-12-27 03:48:59,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 03:48:59,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 03:48:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:59,306 INFO L225 Difference]: With dead ends: 11821 [2019-12-27 03:48:59,306 INFO L226 Difference]: Without dead ends: 11821 [2019-12-27 03:48:59,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-27 03:48:59,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11821 states. [2019-12-27 03:48:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11821 to 7778. [2019-12-27 03:48:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7778 states. [2019-12-27 03:48:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7778 states to 7778 states and 22600 transitions. [2019-12-27 03:48:59,441 INFO L78 Accepts]: Start accepts. Automaton has 7778 states and 22600 transitions. Word has length 65 [2019-12-27 03:48:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:59,441 INFO L462 AbstractCegarLoop]: Abstraction has 7778 states and 22600 transitions. [2019-12-27 03:48:59,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:48:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 7778 states and 22600 transitions. [2019-12-27 03:48:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:48:59,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:59,450 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 03:48:59,450 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 03:48:59,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:59,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1470855674, now seen corresponding path program 9 times [2019-12-27 03:48:59,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:59,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127840604] [2019-12-27 03:48:59,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:59,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127840604] [2019-12-27 03:48:59,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:59,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:48:59,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561005746] [2019-12-27 03:48:59,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:48:59,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:59,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:48:59,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:48:59,512 INFO L87 Difference]: Start difference. First operand 7778 states and 22600 transitions. Second operand 3 states. [2019-12-27 03:48:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:48:59,543 INFO L93 Difference]: Finished difference Result 6638 states and 18930 transitions. [2019-12-27 03:48:59,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:48:59,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:48:59,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:48:59,550 INFO L225 Difference]: With dead ends: 6638 [2019-12-27 03:48:59,550 INFO L226 Difference]: Without dead ends: 6638 [2019-12-27 03:48:59,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:48:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6638 states. [2019-12-27 03:48:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 6638. [2019-12-27 03:48:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6638 states. [2019-12-27 03:48:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6638 states to 6638 states and 18930 transitions. [2019-12-27 03:48:59,642 INFO L78 Accepts]: Start accepts. Automaton has 6638 states and 18930 transitions. Word has length 65 [2019-12-27 03:48:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:48:59,643 INFO L462 AbstractCegarLoop]: Abstraction has 6638 states and 18930 transitions. [2019-12-27 03:48:59,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:48:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 6638 states and 18930 transitions. [2019-12-27 03:48:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:48:59,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:48:59,650 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 03:48:59,650 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 03:48:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:48:59,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1231010579, now seen corresponding path program 1 times [2019-12-27 03:48:59,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:48:59,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008323976] [2019-12-27 03:48:59,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:48:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:48:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:48:59,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008323976] [2019-12-27 03:48:59,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:48:59,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:48:59,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996151458] [2019-12-27 03:48:59,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:48:59,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:48:59,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:48:59,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:48:59,839 INFO L87 Difference]: Start difference. First operand 6638 states and 18930 transitions. Second operand 10 states. [2019-12-27 03:49:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:49:01,162 INFO L93 Difference]: Finished difference Result 13347 states and 38159 transitions. [2019-12-27 03:49:01,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 03:49:01,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 03:49:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:49:01,186 INFO L225 Difference]: With dead ends: 13347 [2019-12-27 03:49:01,186 INFO L226 Difference]: Without dead ends: 13347 [2019-12-27 03:49:01,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-12-27 03:49:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13347 states. [2019-12-27 03:49:01,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13347 to 6902. [2019-12-27 03:49:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6902 states. [2019-12-27 03:49:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6902 states to 6902 states and 19780 transitions. [2019-12-27 03:49:01,333 INFO L78 Accepts]: Start accepts. Automaton has 6902 states and 19780 transitions. Word has length 66 [2019-12-27 03:49:01,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:49:01,334 INFO L462 AbstractCegarLoop]: Abstraction has 6902 states and 19780 transitions. [2019-12-27 03:49:01,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:49:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 6902 states and 19780 transitions. [2019-12-27 03:49:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:49:01,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:49:01,341 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 03:49:01,341 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 03:49:01,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:49:01,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2078646397, now seen corresponding path program 2 times [2019-12-27 03:49:01,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:49:01,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707017370] [2019-12-27 03:49:01,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:49:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:49:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:49:01,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707017370] [2019-12-27 03:49:01,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:49:01,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:49:01,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084535906] [2019-12-27 03:49:01,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:49:01,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:49:01,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:49:01,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:49:01,399 INFO L87 Difference]: Start difference. First operand 6902 states and 19780 transitions. Second operand 3 states. [2019-12-27 03:49:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:49:01,426 INFO L93 Difference]: Finished difference Result 5787 states and 16282 transitions. [2019-12-27 03:49:01,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:49:01,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 03:49:01,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:49:01,601 INFO L225 Difference]: With dead ends: 5787 [2019-12-27 03:49:01,601 INFO L226 Difference]: Without dead ends: 5787 [2019-12-27 03:49:01,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:49:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5787 states. [2019-12-27 03:49:01,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5787 to 5619. [2019-12-27 03:49:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5619 states. [2019-12-27 03:49:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 15766 transitions. [2019-12-27 03:49:01,714 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 15766 transitions. Word has length 66 [2019-12-27 03:49:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:49:01,714 INFO L462 AbstractCegarLoop]: Abstraction has 5619 states and 15766 transitions. [2019-12-27 03:49:01,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:49:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 15766 transitions. [2019-12-27 03:49:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:49:01,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:49:01,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:49:01,723 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 03:49:01,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:49:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1336907617, now seen corresponding path program 1 times [2019-12-27 03:49:01,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:49:01,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884947283] [2019-12-27 03:49:01,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:49:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:49:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:49:01,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884947283] [2019-12-27 03:49:01,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:49:01,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:49:01,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682680608] [2019-12-27 03:49:01,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:49:01,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:49:01,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:49:01,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:49:01,784 INFO L87 Difference]: Start difference. First operand 5619 states and 15766 transitions. Second operand 3 states. [2019-12-27 03:49:01,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:49:01,832 INFO L93 Difference]: Finished difference Result 5619 states and 15765 transitions. [2019-12-27 03:49:01,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:49:01,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 03:49:01,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:49:01,840 INFO L225 Difference]: With dead ends: 5619 [2019-12-27 03:49:01,840 INFO L226 Difference]: Without dead ends: 5619 [2019-12-27 03:49:01,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:49:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5619 states. [2019-12-27 03:49:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5619 to 2989. [2019-12-27 03:49:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-27 03:49:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8461 transitions. [2019-12-27 03:49:01,924 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8461 transitions. Word has length 67 [2019-12-27 03:49:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:49:01,924 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8461 transitions. [2019-12-27 03:49:01,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:49:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8461 transitions. [2019-12-27 03:49:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:49:01,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:49:01,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:49:01,930 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 03:49:01,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:49:01,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1149441136, now seen corresponding path program 1 times [2019-12-27 03:49:01,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:49:01,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921030187] [2019-12-27 03:49:01,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:49:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:49:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:49:02,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921030187] [2019-12-27 03:49:02,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:49:02,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:49:02,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190296829] [2019-12-27 03:49:02,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:49:02,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:49:02,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:49:02,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:49:02,166 INFO L87 Difference]: Start difference. First operand 2989 states and 8461 transitions. Second operand 12 states. [2019-12-27 03:49:02,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:49:02,585 INFO L93 Difference]: Finished difference Result 5702 states and 16070 transitions. [2019-12-27 03:49:02,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 03:49:02,585 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-27 03:49:02,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:49:02,594 INFO L225 Difference]: With dead ends: 5702 [2019-12-27 03:49:02,594 INFO L226 Difference]: Without dead ends: 5670 [2019-12-27 03:49:02,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-27 03:49:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5670 states. [2019-12-27 03:49:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5670 to 4144. [2019-12-27 03:49:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4144 states. [2019-12-27 03:49:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 11624 transitions. [2019-12-27 03:49:02,658 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 11624 transitions. Word has length 68 [2019-12-27 03:49:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:49:02,658 INFO L462 AbstractCegarLoop]: Abstraction has 4144 states and 11624 transitions. [2019-12-27 03:49:02,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:49:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 11624 transitions. [2019-12-27 03:49:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:49:02,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:49:02,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:49:02,662 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 03:49:02,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:49:02,662 INFO L82 PathProgramCache]: Analyzing trace with hash 15770806, now seen corresponding path program 2 times [2019-12-27 03:49:02,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:49:02,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988253822] [2019-12-27 03:49:02,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:49:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:49:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:49:02,784 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:49:02,785 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:49:02,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$mem_tmp~0_39 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2183~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2183~0.base_27|) |v_ULTIMATE.start_main_~#t2183~0.offset_20| 0)) |v_#memory_int_21|) (= 0 v_~y$r_buff0_thd3~0_110) (= (store .cse0 |v_ULTIMATE.start_main_~#t2183~0.base_27| 1) |v_#valid_63|) (= v_~main$tmp_guard0~0_18 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~x~0_147) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1~0_200 0) (= 0 v_~y$w_buff0~0_179) (= v_~y~0_170 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_299 0) (= 0 v_~y$r_buff1_thd2~0_193) (= v_~y$r_buff0_thd1~0_223 0) (= 0 |v_ULTIMATE.start_main_~#t2183~0.offset_20|) (= 0 v_~__unbuffered_p2_EAX~0_33) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2183~0.base_27| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$flush_delayed~0_56) (= |v_#NULL.offset_5| 0) (= v_~y$w_buff1_used~0_482 0) (= 0 v_~y$r_buff1_thd3~0_211) (= 0 v_~y$r_buff0_thd2~0_114) (= v_~__unbuffered_cnt~0_132 0) (= v_~y$w_buff0_used~0_741 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2183~0.base_27|)) (= 0 v_~weak$$choice0~0_34) (= 0 |v_#NULL.base_5|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2183~0.base_27|) (= v_~y$r_buff1_thd1~0_185 0) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ULTIMATE.start_main_~#t2185~0.offset=|v_ULTIMATE.start_main_~#t2185~0.offset_16|, ULTIMATE.start_main_~#t2185~0.base=|v_ULTIMATE.start_main_~#t2185~0.base_19|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_27|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_45|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_41|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_76|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_62|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ~y$mem_tmp~0=v_~y$mem_tmp~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_211, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_223, ~y$flush_delayed~0=v_~y$flush_delayed~0_56, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_82|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_54|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_~#t2183~0.offset=|v_ULTIMATE.start_main_~#t2183~0.offset_20|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_299, ~x~0=v_~x~0_147, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_741, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_73|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_161|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_30|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_76|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_185, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y$w_buff0~0=v_~y$w_buff0~0_179, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ULTIMATE.start_main_~#t2183~0.base=|v_ULTIMATE.start_main_~#t2183~0.base_27|, ~y~0=v_~y~0_170, ULTIMATE.start_main_~#t2184~0.offset=|v_ULTIMATE.start_main_~#t2184~0.offset_18|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_70|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_25|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_50|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_193, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_75|, ULTIMATE.start_main_~#t2184~0.base=|v_ULTIMATE.start_main_~#t2184~0.base_23|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2185~0.offset, ULTIMATE.start_main_~#t2185~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2183~0.offset, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2183~0.base, ~y~0, ULTIMATE.start_main_~#t2184~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2184~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:49:02,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_135 1) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_28) (= (mod v_~y$w_buff1_used~0_63 256) 0) (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_20) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_136) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff0~0=v_~y$w_buff0~0_29, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_28, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:49:02,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L800-1-->L802: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2184~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2184~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2184~0.base_11|) |v_ULTIMATE.start_main_~#t2184~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2184~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2184~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t2184~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2184~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2184~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2184~0.base=|v_ULTIMATE.start_main_~#t2184~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2184~0.offset=|v_ULTIMATE.start_main_~#t2184~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2184~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2184~0.offset] because there is no mapped edge [2019-12-27 03:49:02,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L802-1-->L804: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2185~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2185~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2185~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2185~0.base_13|) |v_ULTIMATE.start_main_~#t2185~0.offset_11| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2185~0.offset_11|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2185~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2185~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2185~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2185~0.offset=|v_ULTIMATE.start_main_~#t2185~0.offset_11|, ULTIMATE.start_main_~#t2185~0.base=|v_ULTIMATE.start_main_~#t2185~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2185~0.offset, ULTIMATE.start_main_~#t2185~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 03:49:02,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1020673082 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1020673082 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1020673082| ~y$w_buff0_used~0_In1020673082) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1020673082| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1020673082, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1020673082} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1020673082|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1020673082, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1020673082} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:49:02,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1332759652 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1332759652 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1332759652| ~y~0_In-1332759652) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In-1332759652 |P1Thread1of1ForFork1_#t~ite9_Out-1332759652|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1332759652, ~y$w_buff1~0=~y$w_buff1~0_In-1332759652, ~y~0=~y~0_In-1332759652, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1332759652} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1332759652, ~y$w_buff1~0=~y$w_buff1~0_In-1332759652, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1332759652|, ~y~0=~y~0_In-1332759652, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1332759652} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 03:49:02,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In2021448879 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2021448879 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2021448879 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In2021448879 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out2021448879|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In2021448879 |P0Thread1of1ForFork0_#t~ite6_Out2021448879|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2021448879, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2021448879, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2021448879, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2021448879} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2021448879|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2021448879, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2021448879, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2021448879, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2021448879} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:49:02,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1990253983 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1990253983 256)))) (or (and (= ~y$r_buff0_thd1~0_Out1990253983 ~y$r_buff0_thd1~0_In1990253983) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out1990253983)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1990253983, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1990253983} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1990253983, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1990253983|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1990253983} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:49:02,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1068550801 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1068550801 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1068550801 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1068550801 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1068550801| ~y$r_buff1_thd1~0_In-1068550801) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1068550801| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1068550801, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068550801, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1068550801, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1068550801} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1068550801, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068550801, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1068550801|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1068550801, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1068550801} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:49:02,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 03:49:02,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In693524582 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In693524582 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In693524582 |P2Thread1of1ForFork2_#t~ite15_Out693524582|) (not .cse1)) (and (= ~y~0_In693524582 |P2Thread1of1ForFork2_#t~ite15_Out693524582|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In693524582, ~y$w_buff1~0=~y$w_buff1~0_In693524582, ~y~0=~y~0_In693524582, ~y$w_buff1_used~0=~y$w_buff1_used~0_In693524582} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In693524582, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out693524582|, ~y$w_buff1~0=~y$w_buff1~0_In693524582, ~y~0=~y~0_In693524582, ~y$w_buff1_used~0=~y$w_buff1_used~0_In693524582} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 03:49:02,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_34) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_34, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 03:49:02,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_38) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 03:49:02,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2094255727 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In2094255727 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out2094255727| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In2094255727 |P1Thread1of1ForFork1_#t~ite11_Out2094255727|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2094255727, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2094255727} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2094255727, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2094255727, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2094255727|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:49:02,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In495447552 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In495447552 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In495447552 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In495447552 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In495447552 |P1Thread1of1ForFork1_#t~ite12_Out495447552|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out495447552|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In495447552, ~y$w_buff0_used~0=~y$w_buff0_used~0_In495447552, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In495447552, ~y$w_buff1_used~0=~y$w_buff1_used~0_In495447552} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In495447552, ~y$w_buff0_used~0=~y$w_buff0_used~0_In495447552, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In495447552, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out495447552|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In495447552} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 03:49:02,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2135990426 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2135990426 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out2135990426| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out2135990426| ~y$r_buff0_thd2~0_In2135990426) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2135990426, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2135990426} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2135990426, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2135990426, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out2135990426|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 03:49:02,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1683896379 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1683896379 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1683896379 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1683896379 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1683896379 |P1Thread1of1ForFork1_#t~ite14_Out-1683896379|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1683896379|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1683896379, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1683896379, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1683896379, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1683896379} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1683896379, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1683896379, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1683896379, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1683896379|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1683896379} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:49:02,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In494990112 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In494990112 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out494990112|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In494990112 |P2Thread1of1ForFork2_#t~ite17_Out494990112|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In494990112, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In494990112} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In494990112, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In494990112, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out494990112|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 03:49:02,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-1938893785 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1938893785 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1938893785 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1938893785 256)))) (or (and (= ~y$w_buff1_used~0_In-1938893785 |P2Thread1of1ForFork2_#t~ite18_Out-1938893785|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1938893785|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1938893785, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1938893785, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1938893785, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1938893785} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1938893785, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1938893785, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1938893785, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1938893785|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1938893785} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 03:49:02,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L761-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_135 |v_P1Thread1of1ForFork1_#t~ite14_42|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:49:02,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1744085973 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1744085973 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out1744085973|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In1744085973 |P2Thread1of1ForFork2_#t~ite19_Out1744085973|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1744085973, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1744085973} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1744085973, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1744085973, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1744085973|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 03:49:02,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1079689926 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1079689926 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1079689926 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1079689926 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1079689926| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1079689926| ~y$r_buff1_thd3~0_In-1079689926) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1079689926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1079689926, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1079689926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1079689926} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1079689926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1079689926, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1079689926|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1079689926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1079689926} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 03:49:02,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L781-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= |v_P2Thread1of1ForFork2_#t~ite20_36| v_~y$r_buff1_thd3~0_132) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_132, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 03:49:02,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:49:02,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out555468923| |ULTIMATE.start_main_#t~ite24_Out555468923|)) (.cse2 (= (mod ~y$w_buff1_used~0_In555468923 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In555468923 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite24_Out555468923| ~y~0_In555468923)) (and .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite24_Out555468923| ~y$w_buff1~0_In555468923) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In555468923, ~y~0=~y~0_In555468923, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In555468923, ~y$w_buff1_used~0=~y$w_buff1_used~0_In555468923} OutVars{~y$w_buff1~0=~y$w_buff1~0_In555468923, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out555468923|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out555468923|, ~y~0=~y~0_In555468923, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In555468923, ~y$w_buff1_used~0=~y$w_buff1_used~0_In555468923} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 03:49:02,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In706031240 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In706031240 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out706031240| ~y$w_buff0_used~0_In706031240)) (and (= |ULTIMATE.start_main_#t~ite26_Out706031240| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In706031240, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In706031240} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In706031240, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In706031240, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out706031240|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 03:49:02,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In2127866592 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In2127866592 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2127866592 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In2127866592 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In2127866592 |ULTIMATE.start_main_#t~ite27_Out2127866592|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite27_Out2127866592|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2127866592, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2127866592, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2127866592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127866592} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2127866592, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2127866592, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out2127866592|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2127866592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127866592} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 03:49:02,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1695845897 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1695845897 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out-1695845897|)) (and (= ~y$r_buff0_thd0~0_In-1695845897 |ULTIMATE.start_main_#t~ite28_Out-1695845897|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1695845897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1695845897} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1695845897|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1695845897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1695845897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 03:49:02,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-998987123 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-998987123 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-998987123 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-998987123 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite29_Out-998987123| ~y$r_buff1_thd0~0_In-998987123) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite29_Out-998987123| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-998987123, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-998987123, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-998987123, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-998987123} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-998987123, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-998987123|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-998987123, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-998987123, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-998987123} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 03:49:02,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L823-->L823-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-352412401 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-352412401 |ULTIMATE.start_main_#t~ite39_Out-352412401|) (= |ULTIMATE.start_main_#t~ite38_In-352412401| |ULTIMATE.start_main_#t~ite38_Out-352412401|)) (and (= |ULTIMATE.start_main_#t~ite38_Out-352412401| |ULTIMATE.start_main_#t~ite39_Out-352412401|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-352412401 256) 0))) (or (and (= (mod ~y$r_buff1_thd0~0_In-352412401 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-352412401 256) 0) (and (= (mod ~y$w_buff1_used~0_In-352412401 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite38_Out-352412401| ~y$w_buff1~0_In-352412401)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-352412401, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-352412401, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-352412401, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-352412401|, ~weak$$choice2~0=~weak$$choice2~0_In-352412401, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-352412401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-352412401} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-352412401, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-352412401, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-352412401|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-352412401, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-352412401|, ~weak$$choice2~0=~weak$$choice2~0_In-352412401, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-352412401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-352412401} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 03:49:02,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L824-->L824-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2033296035 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-2033296035| ~y$w_buff0_used~0_In-2033296035) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-2033296035 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-2033296035 256) 0) (and .cse0 (= (mod ~y$r_buff1_thd0~0_In-2033296035 256) 0)) (and (= 0 (mod ~y$w_buff1_used~0_In-2033296035 256)) .cse0))) (= |ULTIMATE.start_main_#t~ite41_Out-2033296035| |ULTIMATE.start_main_#t~ite42_Out-2033296035|) .cse1) (and (= |ULTIMATE.start_main_#t~ite41_In-2033296035| |ULTIMATE.start_main_#t~ite41_Out-2033296035|) (= ~y$w_buff0_used~0_In-2033296035 |ULTIMATE.start_main_#t~ite42_Out-2033296035|) (not .cse1)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In-2033296035|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2033296035, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2033296035, ~weak$$choice2~0=~weak$$choice2~0_In-2033296035, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2033296035, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2033296035} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2033296035|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2033296035, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2033296035, ~weak$$choice2~0=~weak$$choice2~0_In-2033296035, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2033296035|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2033296035, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2033296035} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 03:49:02,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (= v_~y$r_buff0_thd0~0_133 v_~y$r_buff0_thd0~0_132) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_133, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 03:49:02,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L829-->L832-1: Formula: (and (not (= (mod v_~y$flush_delayed~0_45 256) 0)) (= 0 v_~y$flush_delayed~0_44) (= v_~y~0_135 v_~y$mem_tmp~0_33) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y~0=v_~y~0_135, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:49:02,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:49:02,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:49:02 BasicIcfg [2019-12-27 03:49:02,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:49:02,922 INFO L168 Benchmark]: Toolchain (without parser) took 74479.66 ms. Allocated memory was 145.2 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 100.2 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 03:49:02,923 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 03:49:02,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.42 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 100.0 MB in the beginning and 157.1 MB in the end (delta: -57.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:49:02,924 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.91 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:49:02,924 INFO L168 Benchmark]: Boogie Preprocessor took 38.14 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:49:02,925 INFO L168 Benchmark]: RCFGBuilder took 873.96 ms. Allocated memory is still 203.9 MB. Free memory was 151.8 MB in the beginning and 102.4 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:49:02,926 INFO L168 Benchmark]: TraceAbstraction took 72644.58 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 03:49:02,929 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 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 849.42 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 100.0 MB in the beginning and 157.1 MB in the end (delta: -57.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.91 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.14 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 873.96 ms. Allocated memory is still 203.9 MB. Free memory was 151.8 MB in the beginning and 102.4 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 72644.58 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 173 ProgramPointsBefore, 94 ProgramPointsAfterwards, 210 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 31 ChoiceCompositions, 5882 VarBasedMoverChecksPositive, 246 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 253 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78185 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2183, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2184, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2185, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 72.3s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3568 SDtfs, 3000 SDslu, 7677 SDs, 0 SdLazy, 6148 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 63 SyntacticMatches, 25 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156321occurred 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: 27.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 73138 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1106 NumberOfCodeBlocks, 1106 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1017 ConstructedInterpolants, 0 QuantifiedInterpolants, 185475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...