/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/mix051_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:51:26,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:51:26,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:51:26,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:51:26,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:51:26,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:51:26,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:51:26,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:51:26,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:51:26,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:51:26,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:51:26,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:51:26,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:51:26,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:51:26,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:51:26,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:51:26,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:51:26,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:51:26,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:51:26,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:51:26,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:51:26,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:51:26,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:51:26,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:51:26,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:51:26,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:51:26,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:51:26,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:51:26,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:51:26,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:51:26,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:51:26,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:51:26,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:51:26,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:51:26,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:51:26,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:51:26,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:51:26,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:51:26,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:51:26,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:51:26,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:51:26,353 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 02:51:26,367 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:51:26,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:51:26,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:51:26,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:51:26,368 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:51:26,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:51:26,369 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:51:26,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:51:26,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:51:26,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:51:26,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:51:26,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:51:26,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:51:26,370 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:51:26,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:51:26,371 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:51:26,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:51:26,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:51:26,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:51:26,372 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:51:26,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:51:26,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:51:26,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:51:26,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:51:26,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:51:26,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:51:26,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:51:26,373 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:51:26,373 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:51:26,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:51:26,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:51:26,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:51:26,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:51:26,677 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:51:26,678 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt.i [2019-12-27 02:51:26,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a5b37cc/3616485d51604b6d9728916bfefa0193/FLAG0b3f89d9e [2019-12-27 02:51:27,322 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:51:27,323 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_pso.opt.i [2019-12-27 02:51:27,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a5b37cc/3616485d51604b6d9728916bfefa0193/FLAG0b3f89d9e [2019-12-27 02:51:27,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a5b37cc/3616485d51604b6d9728916bfefa0193 [2019-12-27 02:51:27,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:51:27,592 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:51:27,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:51:27,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:51:27,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:51:27,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:51:27" (1/1) ... [2019-12-27 02:51:27,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb8f213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:27, skipping insertion in model container [2019-12-27 02:51:27,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:51:27" (1/1) ... [2019-12-27 02:51:27,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:51:27,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:51:28,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:51:28,245 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:51:28,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:51:28,410 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:51:28,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:28 WrapperNode [2019-12-27 02:51:28,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:51:28,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:51:28,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:51:28,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:51:28,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:28" (1/1) ... [2019-12-27 02:51:28,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:28" (1/1) ... [2019-12-27 02:51:28,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:51:28,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:51:28,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:51:28,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:51:28,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:28" (1/1) ... [2019-12-27 02:51:28,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:28" (1/1) ... [2019-12-27 02:51:28,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:28" (1/1) ... [2019-12-27 02:51:28,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:28" (1/1) ... [2019-12-27 02:51:28,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:28" (1/1) ... [2019-12-27 02:51:28,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:28" (1/1) ... [2019-12-27 02:51:28,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:28" (1/1) ... [2019-12-27 02:51:28,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:51:28,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:51:28,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:51:28,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:51:28,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:28" (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 02:51:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:51:28,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:51:28,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:51:28,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:51:28,579 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:51:28,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:51:28,579 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:51:28,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:51:28,579 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:51:28,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:51:28,580 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:51:28,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:51:28,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:51:28,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:51:28,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:51:28,582 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 02:51:29,299 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:51:29,300 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:51:29,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:51:29 BoogieIcfgContainer [2019-12-27 02:51:29,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:51:29,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:51:29,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:51:29,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:51:29,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:51:27" (1/3) ... [2019-12-27 02:51:29,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cc4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:51:29, skipping insertion in model container [2019-12-27 02:51:29,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:28" (2/3) ... [2019-12-27 02:51:29,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cc4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:51:29, skipping insertion in model container [2019-12-27 02:51:29,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:51:29" (3/3) ... [2019-12-27 02:51:29,311 INFO L109 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt.i [2019-12-27 02:51:29,322 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:51:29,322 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:51:29,333 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:51:29,334 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:51:29,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,392 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,394 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,395 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,399 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,399 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,446 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,446 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,446 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,446 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,448 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,448 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,449 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,450 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,450 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,450 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,451 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,452 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,452 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,452 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,452 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,453 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,453 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,453 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,453 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,454 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,454 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,454 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,454 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,455 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,455 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,455 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,455 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,456 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,456 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,457 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,457 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,457 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,457 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,458 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,464 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,480 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,488 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,488 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,490 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,490 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,490 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,490 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,491 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,491 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,491 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,491 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,491 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,491 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,497 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,498 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,502 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,502 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:29,517 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:51:29,537 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:51:29,537 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:51:29,538 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:51:29,538 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:51:29,538 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:51:29,538 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:51:29,538 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:51:29,538 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:51:29,555 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 190 transitions [2019-12-27 02:51:29,557 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-27 02:51:29,654 INFO L132 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-27 02:51:29,655 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:51:29,669 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:51:29,690 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-27 02:51:29,754 INFO L132 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-27 02:51:29,754 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:51:29,763 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:51:29,782 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 02:51:29,783 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:51:35,076 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 02:51:35,213 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 02:51:35,273 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46836 [2019-12-27 02:51:35,273 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 02:51:35,278 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 84 transitions [2019-12-27 02:51:36,870 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 24606 states. [2019-12-27 02:51:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 24606 states. [2019-12-27 02:51:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:51:36,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:36,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:51:36,879 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:36,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:36,885 INFO L82 PathProgramCache]: Analyzing trace with hash -112021246, now seen corresponding path program 1 times [2019-12-27 02:51:36,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:36,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368469186] [2019-12-27 02:51:36,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:37,171 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 02:51:37,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368469186] [2019-12-27 02:51:37,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:37,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:51:37,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469510213] [2019-12-27 02:51:37,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:51:37,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:51:37,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:51:37,197 INFO L87 Difference]: Start difference. First operand 24606 states. Second operand 3 states. [2019-12-27 02:51:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:37,713 INFO L93 Difference]: Finished difference Result 23966 states and 104480 transitions. [2019-12-27 02:51:37,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:51:37,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:51:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:37,971 INFO L225 Difference]: With dead ends: 23966 [2019-12-27 02:51:37,971 INFO L226 Difference]: Without dead ends: 22574 [2019-12-27 02:51:37,973 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 02:51:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22574 states. [2019-12-27 02:51:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22574 to 22574. [2019-12-27 02:51:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22574 states. [2019-12-27 02:51:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22574 states to 22574 states and 98268 transitions. [2019-12-27 02:51:40,200 INFO L78 Accepts]: Start accepts. Automaton has 22574 states and 98268 transitions. Word has length 9 [2019-12-27 02:51:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:40,201 INFO L462 AbstractCegarLoop]: Abstraction has 22574 states and 98268 transitions. [2019-12-27 02:51:40,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:51:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 22574 states and 98268 transitions. [2019-12-27 02:51:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:51:40,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:40,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:51:40,219 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:40,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:40,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1478915767, now seen corresponding path program 1 times [2019-12-27 02:51:40,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:40,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777770186] [2019-12-27 02:51:40,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:40,392 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 02:51:40,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777770186] [2019-12-27 02:51:40,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:40,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:51:40,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145154233] [2019-12-27 02:51:40,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:51:40,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:40,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:51:40,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:51:40,398 INFO L87 Difference]: Start difference. First operand 22574 states and 98268 transitions. Second operand 4 states. [2019-12-27 02:51:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:41,158 INFO L93 Difference]: Finished difference Result 34006 states and 143332 transitions. [2019-12-27 02:51:41,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:51:41,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:51:41,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:41,313 INFO L225 Difference]: With dead ends: 34006 [2019-12-27 02:51:41,313 INFO L226 Difference]: Without dead ends: 33954 [2019-12-27 02:51:41,314 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 02:51:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33954 states. [2019-12-27 02:51:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33954 to 30266. [2019-12-27 02:51:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30266 states. [2019-12-27 02:51:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30266 states to 30266 states and 129516 transitions. [2019-12-27 02:51:44,063 INFO L78 Accepts]: Start accepts. Automaton has 30266 states and 129516 transitions. Word has length 15 [2019-12-27 02:51:44,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:44,063 INFO L462 AbstractCegarLoop]: Abstraction has 30266 states and 129516 transitions. [2019-12-27 02:51:44,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:51:44,064 INFO L276 IsEmpty]: Start isEmpty. Operand 30266 states and 129516 transitions. [2019-12-27 02:51:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:51:44,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:44,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:51:44,073 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1507356133, now seen corresponding path program 1 times [2019-12-27 02:51:44,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:44,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544026742] [2019-12-27 02:51:44,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:44,175 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 02:51:44,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544026742] [2019-12-27 02:51:44,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:44,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:51:44,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370544905] [2019-12-27 02:51:44,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:51:44,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:44,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:51:44,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:51:44,181 INFO L87 Difference]: Start difference. First operand 30266 states and 129516 transitions. Second operand 3 states. [2019-12-27 02:51:44,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:44,451 INFO L93 Difference]: Finished difference Result 39490 states and 165892 transitions. [2019-12-27 02:51:44,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:51:44,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 02:51:44,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:44,595 INFO L225 Difference]: With dead ends: 39490 [2019-12-27 02:51:44,595 INFO L226 Difference]: Without dead ends: 39490 [2019-12-27 02:51:44,595 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 02:51:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39490 states. [2019-12-27 02:51:47,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39490 to 32622. [2019-12-27 02:51:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32622 states. [2019-12-27 02:51:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32622 states to 32622 states and 139128 transitions. [2019-12-27 02:51:47,391 INFO L78 Accepts]: Start accepts. Automaton has 32622 states and 139128 transitions. Word has length 18 [2019-12-27 02:51:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:47,392 INFO L462 AbstractCegarLoop]: Abstraction has 32622 states and 139128 transitions. [2019-12-27 02:51:47,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:51:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 32622 states and 139128 transitions. [2019-12-27 02:51:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:51:47,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:47,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:51:47,401 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:47,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:47,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1390873323, now seen corresponding path program 1 times [2019-12-27 02:51:47,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:47,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973660864] [2019-12-27 02:51:47,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:47,456 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 02:51:47,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973660864] [2019-12-27 02:51:47,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:47,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:51:47,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587972352] [2019-12-27 02:51:47,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:51:47,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:47,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:51:47,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:51:47,458 INFO L87 Difference]: Start difference. First operand 32622 states and 139128 transitions. Second operand 4 states. [2019-12-27 02:51:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:48,065 INFO L93 Difference]: Finished difference Result 39306 states and 164888 transitions. [2019-12-27 02:51:48,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:51:48,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 02:51:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:48,208 INFO L225 Difference]: With dead ends: 39306 [2019-12-27 02:51:48,209 INFO L226 Difference]: Without dead ends: 39270 [2019-12-27 02:51:48,209 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 02:51:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39270 states. [2019-12-27 02:51:49,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39270 to 34278. [2019-12-27 02:51:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34278 states. [2019-12-27 02:51:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34278 states to 34278 states and 145700 transitions. [2019-12-27 02:51:49,526 INFO L78 Accepts]: Start accepts. Automaton has 34278 states and 145700 transitions. Word has length 18 [2019-12-27 02:51:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:49,526 INFO L462 AbstractCegarLoop]: Abstraction has 34278 states and 145700 transitions. [2019-12-27 02:51:49,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:51:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 34278 states and 145700 transitions. [2019-12-27 02:51:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:51:49,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:49,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:51:49,536 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:49,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:49,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1775846621, now seen corresponding path program 1 times [2019-12-27 02:51:49,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:49,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438114305] [2019-12-27 02:51:49,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:49,598 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 02:51:49,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438114305] [2019-12-27 02:51:49,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:49,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:51:49,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006686698] [2019-12-27 02:51:49,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:51:49,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:49,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:51:49,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:51:49,600 INFO L87 Difference]: Start difference. First operand 34278 states and 145700 transitions. Second operand 4 states. [2019-12-27 02:51:49,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:49,981 INFO L93 Difference]: Finished difference Result 43030 states and 180576 transitions. [2019-12-27 02:51:49,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:51:49,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 02:51:49,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:50,093 INFO L225 Difference]: With dead ends: 43030 [2019-12-27 02:51:50,093 INFO L226 Difference]: Without dead ends: 42978 [2019-12-27 02:51:50,093 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 02:51:52,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42978 states. [2019-12-27 02:51:52,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42978 to 35550. [2019-12-27 02:51:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35550 states. [2019-12-27 02:51:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35550 states to 35550 states and 151224 transitions. [2019-12-27 02:51:53,085 INFO L78 Accepts]: Start accepts. Automaton has 35550 states and 151224 transitions. Word has length 18 [2019-12-27 02:51:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:53,086 INFO L462 AbstractCegarLoop]: Abstraction has 35550 states and 151224 transitions. [2019-12-27 02:51:53,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:51:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 35550 states and 151224 transitions. [2019-12-27 02:51:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 02:51:53,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:53,101 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] [2019-12-27 02:51:53,101 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:53,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:53,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1801202898, now seen corresponding path program 1 times [2019-12-27 02:51:53,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:53,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195181484] [2019-12-27 02:51:53,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:53,145 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 02:51:53,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195181484] [2019-12-27 02:51:53,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:53,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:51:53,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527896871] [2019-12-27 02:51:53,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:51:53,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:53,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:51:53,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:51:53,147 INFO L87 Difference]: Start difference. First operand 35550 states and 151224 transitions. Second operand 3 states. [2019-12-27 02:51:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:53,616 INFO L93 Difference]: Finished difference Result 34861 states and 147588 transitions. [2019-12-27 02:51:53,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:51:53,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 02:51:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:53,708 INFO L225 Difference]: With dead ends: 34861 [2019-12-27 02:51:53,708 INFO L226 Difference]: Without dead ends: 34861 [2019-12-27 02:51:53,708 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 02:51:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34861 states. [2019-12-27 02:51:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34861 to 34861. [2019-12-27 02:51:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34861 states. [2019-12-27 02:51:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34861 states to 34861 states and 147588 transitions. [2019-12-27 02:51:54,930 INFO L78 Accepts]: Start accepts. Automaton has 34861 states and 147588 transitions. Word has length 20 [2019-12-27 02:51:54,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:54,931 INFO L462 AbstractCegarLoop]: Abstraction has 34861 states and 147588 transitions. [2019-12-27 02:51:54,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:51:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 34861 states and 147588 transitions. [2019-12-27 02:51:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:51:54,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:54,945 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] [2019-12-27 02:51:54,945 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:54,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:54,946 INFO L82 PathProgramCache]: Analyzing trace with hash -348621301, now seen corresponding path program 1 times [2019-12-27 02:51:54,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:54,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3357593] [2019-12-27 02:51:54,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:54,994 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 02:51:54,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3357593] [2019-12-27 02:51:54,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:54,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:51:54,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99314500] [2019-12-27 02:51:54,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:51:54,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:54,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:51:54,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:51:54,997 INFO L87 Difference]: Start difference. First operand 34861 states and 147588 transitions. Second operand 3 states. [2019-12-27 02:51:55,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:55,215 INFO L93 Difference]: Finished difference Result 43058 states and 172870 transitions. [2019-12-27 02:51:55,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:51:55,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 02:51:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:55,303 INFO L225 Difference]: With dead ends: 43058 [2019-12-27 02:51:55,304 INFO L226 Difference]: Without dead ends: 35385 [2019-12-27 02:51:55,304 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 02:51:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35385 states. [2019-12-27 02:51:56,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35385 to 34652. [2019-12-27 02:51:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34652 states. [2019-12-27 02:51:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34652 states to 34652 states and 138117 transitions. [2019-12-27 02:51:56,578 INFO L78 Accepts]: Start accepts. Automaton has 34652 states and 138117 transitions. Word has length 21 [2019-12-27 02:51:56,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:56,578 INFO L462 AbstractCegarLoop]: Abstraction has 34652 states and 138117 transitions. [2019-12-27 02:51:56,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:51:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 34652 states and 138117 transitions. [2019-12-27 02:51:56,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:51:56,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:56,591 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] [2019-12-27 02:51:56,591 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:56,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:56,591 INFO L82 PathProgramCache]: Analyzing trace with hash 281464718, now seen corresponding path program 1 times [2019-12-27 02:51:56,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:56,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330178503] [2019-12-27 02:51:56,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:56,669 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 02:51:56,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330178503] [2019-12-27 02:51:56,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:56,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:51:56,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138463404] [2019-12-27 02:51:56,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:51:56,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:56,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:51:56,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:51:56,674 INFO L87 Difference]: Start difference. First operand 34652 states and 138117 transitions. Second operand 5 states. [2019-12-27 02:51:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:56,825 INFO L93 Difference]: Finished difference Result 15467 states and 50655 transitions. [2019-12-27 02:51:56,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:51:56,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 02:51:56,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:56,847 INFO L225 Difference]: With dead ends: 15467 [2019-12-27 02:51:56,847 INFO L226 Difference]: Without dead ends: 13028 [2019-12-27 02:51:56,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:51:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13028 states. [2019-12-27 02:51:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13028 to 13028. [2019-12-27 02:51:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13028 states. [2019-12-27 02:51:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13028 states to 13028 states and 41754 transitions. [2019-12-27 02:51:57,056 INFO L78 Accepts]: Start accepts. Automaton has 13028 states and 41754 transitions. Word has length 21 [2019-12-27 02:51:57,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:57,056 INFO L462 AbstractCegarLoop]: Abstraction has 13028 states and 41754 transitions. [2019-12-27 02:51:57,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:51:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 13028 states and 41754 transitions. [2019-12-27 02:51:57,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:51:57,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:57,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:51:57,061 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:57,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:57,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1933146031, now seen corresponding path program 1 times [2019-12-27 02:51:57,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:57,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703545601] [2019-12-27 02:51:57,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:57,149 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 02:51:57,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703545601] [2019-12-27 02:51:57,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:57,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:51:57,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029836588] [2019-12-27 02:51:57,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:51:57,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:57,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:51:57,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:51:57,153 INFO L87 Difference]: Start difference. First operand 13028 states and 41754 transitions. Second operand 6 states. [2019-12-27 02:51:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:57,263 INFO L93 Difference]: Finished difference Result 4493 states and 12952 transitions. [2019-12-27 02:51:57,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:51:57,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 02:51:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:57,269 INFO L225 Difference]: With dead ends: 4493 [2019-12-27 02:51:57,269 INFO L226 Difference]: Without dead ends: 3671 [2019-12-27 02:51:57,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:51:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2019-12-27 02:51:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3631. [2019-12-27 02:51:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3631 states. [2019-12-27 02:51:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3631 states to 3631 states and 10398 transitions. [2019-12-27 02:51:57,925 INFO L78 Accepts]: Start accepts. Automaton has 3631 states and 10398 transitions. Word has length 22 [2019-12-27 02:51:57,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:57,925 INFO L462 AbstractCegarLoop]: Abstraction has 3631 states and 10398 transitions. [2019-12-27 02:51:57,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:51:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3631 states and 10398 transitions. [2019-12-27 02:51:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 02:51:57,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:57,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] [2019-12-27 02:51:57,931 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:57,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:57,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1547062574, now seen corresponding path program 1 times [2019-12-27 02:51:57,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:57,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695974601] [2019-12-27 02:51:57,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:58,012 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 02:51:58,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695974601] [2019-12-27 02:51:58,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:58,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:51:58,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705148189] [2019-12-27 02:51:58,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:51:58,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:58,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:51:58,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:51:58,014 INFO L87 Difference]: Start difference. First operand 3631 states and 10398 transitions. Second operand 5 states. [2019-12-27 02:51:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:58,227 INFO L93 Difference]: Finished difference Result 4581 states and 12744 transitions. [2019-12-27 02:51:58,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:51:58,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 02:51:58,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:58,237 INFO L225 Difference]: With dead ends: 4581 [2019-12-27 02:51:58,237 INFO L226 Difference]: Without dead ends: 4518 [2019-12-27 02:51:58,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:51:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2019-12-27 02:51:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 3815. [2019-12-27 02:51:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3815 states. [2019-12-27 02:51:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 10890 transitions. [2019-12-27 02:51:58,306 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 10890 transitions. Word has length 31 [2019-12-27 02:51:58,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:58,307 INFO L462 AbstractCegarLoop]: Abstraction has 3815 states and 10890 transitions. [2019-12-27 02:51:58,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:51:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 10890 transitions. [2019-12-27 02:51:58,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 02:51:58,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:58,312 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] [2019-12-27 02:51:58,312 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:58,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:58,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1138439690, now seen corresponding path program 1 times [2019-12-27 02:51:58,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:58,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867990438] [2019-12-27 02:51:58,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:58,347 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 02:51:58,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867990438] [2019-12-27 02:51:58,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:58,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:51:58,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558125202] [2019-12-27 02:51:58,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:51:58,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:58,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:51:58,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:51:58,349 INFO L87 Difference]: Start difference. First operand 3815 states and 10890 transitions. Second operand 3 states. [2019-12-27 02:51:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:58,396 INFO L93 Difference]: Finished difference Result 4631 states and 12615 transitions. [2019-12-27 02:51:58,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:51:58,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-27 02:51:58,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:58,404 INFO L225 Difference]: With dead ends: 4631 [2019-12-27 02:51:58,404 INFO L226 Difference]: Without dead ends: 4631 [2019-12-27 02:51:58,405 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 02:51:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2019-12-27 02:51:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 3773. [2019-12-27 02:51:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3773 states. [2019-12-27 02:51:58,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3773 states to 3773 states and 10352 transitions. [2019-12-27 02:51:58,475 INFO L78 Accepts]: Start accepts. Automaton has 3773 states and 10352 transitions. Word has length 31 [2019-12-27 02:51:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:58,476 INFO L462 AbstractCegarLoop]: Abstraction has 3773 states and 10352 transitions. [2019-12-27 02:51:58,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:51:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3773 states and 10352 transitions. [2019-12-27 02:51:58,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:51:58,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:58,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:51:58,483 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:58,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:58,483 INFO L82 PathProgramCache]: Analyzing trace with hash -402711057, now seen corresponding path program 1 times [2019-12-27 02:51:58,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:58,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521282460] [2019-12-27 02:51:58,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:58,533 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 02:51:58,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521282460] [2019-12-27 02:51:58,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:58,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:51:58,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707909911] [2019-12-27 02:51:58,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:51:58,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:58,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:51:58,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:51:58,536 INFO L87 Difference]: Start difference. First operand 3773 states and 10352 transitions. Second operand 4 states. [2019-12-27 02:51:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:58,573 INFO L93 Difference]: Finished difference Result 5634 states and 15079 transitions. [2019-12-27 02:51:58,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:51:58,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-27 02:51:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:58,582 INFO L225 Difference]: With dead ends: 5634 [2019-12-27 02:51:58,582 INFO L226 Difference]: Without dead ends: 3795 [2019-12-27 02:51:58,582 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 02:51:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states. [2019-12-27 02:51:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 3761. [2019-12-27 02:51:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3761 states. [2019-12-27 02:51:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 10166 transitions. [2019-12-27 02:51:58,654 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 10166 transitions. Word has length 32 [2019-12-27 02:51:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:58,655 INFO L462 AbstractCegarLoop]: Abstraction has 3761 states and 10166 transitions. [2019-12-27 02:51:58,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:51:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 10166 transitions. [2019-12-27 02:51:58,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:51:58,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:58,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:51:58,665 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:58,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:58,665 INFO L82 PathProgramCache]: Analyzing trace with hash 924309407, now seen corresponding path program 2 times [2019-12-27 02:51:58,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:58,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253795641] [2019-12-27 02:51:58,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:51:58,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253795641] [2019-12-27 02:51:58,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:58,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:51:58,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666861705] [2019-12-27 02:51:58,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:51:58,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:58,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:51:58,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:51:58,792 INFO L87 Difference]: Start difference. First operand 3761 states and 10166 transitions. Second operand 5 states. [2019-12-27 02:51:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:59,173 INFO L93 Difference]: Finished difference Result 5566 states and 14943 transitions. [2019-12-27 02:51:59,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:51:59,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 02:51:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:59,182 INFO L225 Difference]: With dead ends: 5566 [2019-12-27 02:51:59,182 INFO L226 Difference]: Without dead ends: 5566 [2019-12-27 02:51:59,182 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 02:51:59,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5566 states. [2019-12-27 02:51:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5566 to 4775. [2019-12-27 02:51:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4775 states. [2019-12-27 02:51:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 13018 transitions. [2019-12-27 02:51:59,269 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 13018 transitions. Word has length 32 [2019-12-27 02:51:59,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:59,270 INFO L462 AbstractCegarLoop]: Abstraction has 4775 states and 13018 transitions. [2019-12-27 02:51:59,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:51:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 13018 transitions. [2019-12-27 02:51:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:51:59,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:59,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:51:59,280 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:59,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1471954053, now seen corresponding path program 1 times [2019-12-27 02:51:59,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:59,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935422500] [2019-12-27 02:51:59,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:59,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 02:51:59,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935422500] [2019-12-27 02:51:59,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:59,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:51:59,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599716911] [2019-12-27 02:51:59,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:51:59,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:59,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:51:59,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:51:59,338 INFO L87 Difference]: Start difference. First operand 4775 states and 13018 transitions. Second operand 5 states. [2019-12-27 02:51:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:59,546 INFO L93 Difference]: Finished difference Result 5558 states and 14896 transitions. [2019-12-27 02:51:59,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:51:59,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 02:51:59,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:59,554 INFO L225 Difference]: With dead ends: 5558 [2019-12-27 02:51:59,554 INFO L226 Difference]: Without dead ends: 5475 [2019-12-27 02:51:59,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:51:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2019-12-27 02:51:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 4607. [2019-12-27 02:51:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2019-12-27 02:51:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 12605 transitions. [2019-12-27 02:51:59,612 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 12605 transitions. Word has length 33 [2019-12-27 02:51:59,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:59,612 INFO L462 AbstractCegarLoop]: Abstraction has 4607 states and 12605 transitions. [2019-12-27 02:51:59,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:51:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 12605 transitions. [2019-12-27 02:51:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:51:59,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:59,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:51:59,619 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:59,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:59,620 INFO L82 PathProgramCache]: Analyzing trace with hash 905925005, now seen corresponding path program 1 times [2019-12-27 02:51:59,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:59,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545976360] [2019-12-27 02:51:59,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:51:59,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545976360] [2019-12-27 02:51:59,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:59,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:51:59,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614658433] [2019-12-27 02:51:59,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:51:59,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:59,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:51:59,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:51:59,705 INFO L87 Difference]: Start difference. First operand 4607 states and 12605 transitions. Second operand 7 states. [2019-12-27 02:51:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:59,839 INFO L93 Difference]: Finished difference Result 3755 states and 10518 transitions. [2019-12-27 02:51:59,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:51:59,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:51:59,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:59,845 INFO L225 Difference]: With dead ends: 3755 [2019-12-27 02:51:59,845 INFO L226 Difference]: Without dead ends: 2551 [2019-12-27 02:51:59,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:51:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2019-12-27 02:51:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2185. [2019-12-27 02:51:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2185 states. [2019-12-27 02:51:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 5946 transitions. [2019-12-27 02:51:59,894 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 5946 transitions. Word has length 33 [2019-12-27 02:51:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:59,896 INFO L462 AbstractCegarLoop]: Abstraction has 2185 states and 5946 transitions. [2019-12-27 02:51:59,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:51:59,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 5946 transitions. [2019-12-27 02:51:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 02:51:59,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:59,902 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] [2019-12-27 02:51:59,902 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:59,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:59,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1054276201, now seen corresponding path program 1 times [2019-12-27 02:51:59,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:59,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573348483] [2019-12-27 02:51:59,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:59,999 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 02:51:59,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573348483] [2019-12-27 02:51:59,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:00,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:52:00,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869642186] [2019-12-27 02:52:00,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:52:00,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:00,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:52:00,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:52:00,003 INFO L87 Difference]: Start difference. First operand 2185 states and 5946 transitions. Second operand 4 states. [2019-12-27 02:52:00,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:00,030 INFO L93 Difference]: Finished difference Result 2809 states and 7264 transitions. [2019-12-27 02:52:00,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:52:00,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-27 02:52:00,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:00,032 INFO L225 Difference]: With dead ends: 2809 [2019-12-27 02:52:00,032 INFO L226 Difference]: Without dead ends: 696 [2019-12-27 02:52:00,033 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 02:52:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-12-27 02:52:00,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2019-12-27 02:52:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-12-27 02:52:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1448 transitions. [2019-12-27 02:52:00,044 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1448 transitions. Word has length 46 [2019-12-27 02:52:00,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:00,044 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1448 transitions. [2019-12-27 02:52:00,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:52:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1448 transitions. [2019-12-27 02:52:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 02:52:00,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:00,046 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] [2019-12-27 02:52:00,046 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:00,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:00,047 INFO L82 PathProgramCache]: Analyzing trace with hash 401636329, now seen corresponding path program 2 times [2019-12-27 02:52:00,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:00,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678799289] [2019-12-27 02:52:00,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:00,127 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 02:52:00,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678799289] [2019-12-27 02:52:00,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:00,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:52:00,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075426514] [2019-12-27 02:52:00,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:52:00,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:00,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:52:00,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:52:00,130 INFO L87 Difference]: Start difference. First operand 696 states and 1448 transitions. Second operand 7 states. [2019-12-27 02:52:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:00,296 INFO L93 Difference]: Finished difference Result 1132 states and 2298 transitions. [2019-12-27 02:52:00,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:52:00,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-12-27 02:52:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:00,297 INFO L225 Difference]: With dead ends: 1132 [2019-12-27 02:52:00,297 INFO L226 Difference]: Without dead ends: 737 [2019-12-27 02:52:00,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:52:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-12-27 02:52:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 693. [2019-12-27 02:52:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-12-27 02:52:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1419 transitions. [2019-12-27 02:52:00,308 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1419 transitions. Word has length 46 [2019-12-27 02:52:00,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:00,309 INFO L462 AbstractCegarLoop]: Abstraction has 693 states and 1419 transitions. [2019-12-27 02:52:00,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:52:00,309 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1419 transitions. [2019-12-27 02:52:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 02:52:00,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:00,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:52:00,311 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:00,311 INFO L82 PathProgramCache]: Analyzing trace with hash -683037313, now seen corresponding path program 3 times [2019-12-27 02:52:00,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:00,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404428147] [2019-12-27 02:52:00,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:00,424 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 02:52:00,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404428147] [2019-12-27 02:52:00,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:00,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:52:00,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859241627] [2019-12-27 02:52:00,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:52:00,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:00,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:52:00,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:00,432 INFO L87 Difference]: Start difference. First operand 693 states and 1419 transitions. Second operand 3 states. [2019-12-27 02:52:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:00,448 INFO L93 Difference]: Finished difference Result 691 states and 1414 transitions. [2019-12-27 02:52:00,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:52:00,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-27 02:52:00,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:00,450 INFO L225 Difference]: With dead ends: 691 [2019-12-27 02:52:00,450 INFO L226 Difference]: Without dead ends: 691 [2019-12-27 02:52:00,450 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 02:52:00,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-12-27 02:52:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 576. [2019-12-27 02:52:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 02:52:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1194 transitions. [2019-12-27 02:52:00,460 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1194 transitions. Word has length 46 [2019-12-27 02:52:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:00,461 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1194 transitions. [2019-12-27 02:52:00,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:52:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1194 transitions. [2019-12-27 02:52:00,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:52:00,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:00,463 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] [2019-12-27 02:52:00,463 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:00,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:00,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1677183059, now seen corresponding path program 1 times [2019-12-27 02:52:00,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:00,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911042369] [2019-12-27 02:52:00,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:52:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:52:00,645 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:52:00,645 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:52:00,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= 0 v_~z$r_buff0_thd4~0_184) (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~z$mem_tmp~0_33 0) (= 0 v_~z$r_buff0_thd3~0_318) (= 0 v_~z$r_buff1_thd4~0_160) (= v_~weak$$choice2~0_130 0) (= v_~z$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1365~0.base_36|)) (= 0 v_~z$r_buff1_thd1~0_92) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p1_EAX~0_54) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t1365~0.base_36| 4) |v_#length_27|) (= v_~z$r_buff1_thd0~0_160 0) (= 0 v_~z$r_buff1_thd2~0_92) (= 0 v_~weak$$choice0~0_21) (= (store .cse0 |v_ULTIMATE.start_main_~#t1365~0.base_36| 1) |v_#valid_83|) (= 0 v_~z$r_buff1_thd3~0_237) (= v_~__unbuffered_p3_EAX~0_110 0) (= 0 v_~z$flush_delayed~0_68) (= v_~z$w_buff1_used~0_386 0) (= v_~x~0_77 0) (= v_~z~0_154 0) (= v_~y~0_44 0) (= |v_#NULL.offset_5| 0) (= v_~a~0_69 0) (= v_~__unbuffered_cnt~0_186 0) (= 0 |v_ULTIMATE.start_main_~#t1365~0.offset_23|) (= v_~z$r_buff0_thd1~0_47 0) (= v_~z$w_buff0~0_354 0) (= v_~z$w_buff1~0_215 0) (= v_~z$w_buff0_used~0_630 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1365~0.base_36|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1365~0.base_36| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1365~0.base_36|) |v_ULTIMATE.start_main_~#t1365~0.offset_23| 0))) (= v_~z$r_buff0_thd2~0_47 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_122 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_20|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ULTIMATE.start_main_~#t1367~0.offset=|v_ULTIMATE.start_main_~#t1367~0.offset_24|, ULTIMATE.start_main_~#t1366~0.base=|v_ULTIMATE.start_main_~#t1366~0.base_37|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_69, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_122, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_184, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_110, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~z$mem_tmp~0=v_~z$mem_tmp~0_33, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ULTIMATE.start_main_~#t1365~0.offset=|v_ULTIMATE.start_main_~#t1365~0.offset_23|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_54|, ~z$flush_delayed~0=v_~z$flush_delayed~0_68, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_92, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_318, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_186, ~x~0=v_~x~0_77, ULTIMATE.start_main_~#t1365~0.base=|v_ULTIMATE.start_main_~#t1365~0.base_36|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_160, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_14|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_215, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_160, ULTIMATE.start_main_~#t1366~0.offset=|v_ULTIMATE.start_main_~#t1366~0.offset_24|, ~y~0=v_~y~0_44, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_630, ~z$w_buff0~0=v_~z$w_buff0~0_354, ULTIMATE.start_main_~#t1368~0.base=|v_ULTIMATE.start_main_~#t1368~0.base_17|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1367~0.base=|v_ULTIMATE.start_main_~#t1367~0.base_37|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_72|, ULTIMATE.start_main_~#t1368~0.offset=|v_ULTIMATE.start_main_~#t1368~0.offset_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_154, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_47} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1367~0.offset, ULTIMATE.start_main_~#t1366~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1365~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1365~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1366~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1368~0.base, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1367~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1368~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:52:00,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L833-1-->L835: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1366~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1366~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1366~0.base_11|) |v_ULTIMATE.start_main_~#t1366~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t1366~0.base_11| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1366~0.base_11| 4) |v_#length_21|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t1366~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1366~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1366~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_6|, ULTIMATE.start_main_~#t1366~0.base=|v_ULTIMATE.start_main_~#t1366~0.base_11|, ULTIMATE.start_main_~#t1366~0.offset=|v_ULTIMATE.start_main_~#t1366~0.offset_10|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1366~0.base, ULTIMATE.start_main_~#t1366~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:52:00,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t1367~0.offset_10| 0) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1367~0.base_11| 1) |v_#valid_41|) (not (= |v_ULTIMATE.start_main_~#t1367~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1367~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1367~0.base_11|) |v_ULTIMATE.start_main_~#t1367~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1367~0.base_11|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1367~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1367~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1367~0.offset=|v_ULTIMATE.start_main_~#t1367~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1367~0.base=|v_ULTIMATE.start_main_~#t1367~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1367~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1367~0.base] because there is no mapped edge [2019-12-27 02:52:00,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-1-->L839: Formula: (and (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1368~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1368~0.offset_11| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1368~0.base_13|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1368~0.base_13| 1) |v_#valid_50|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1368~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1368~0.base_13|) |v_ULTIMATE.start_main_~#t1368~0.offset_11| 3)) |v_#memory_int_15|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1368~0.base_13| 4) |v_#length_23|) (not (= |v_ULTIMATE.start_main_~#t1368~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t1368~0.base=|v_ULTIMATE.start_main_~#t1368~0.base_13|, ULTIMATE.start_main_~#t1368~0.offset=|v_ULTIMATE.start_main_~#t1368~0.offset_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1368~0.base, ULTIMATE.start_main_~#t1368~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:52:00,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_40 v_~z$r_buff1_thd0~0_25) (= v_~z$r_buff1_thd2~0_6 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22)) (= v_~a~0_15 v_~__unbuffered_p3_EAX~0_9) (= v_~z$r_buff0_thd4~0_25 1) (= v_~z$r_buff0_thd4~0_26 v_~z$r_buff1_thd4~0_17) (= v_~z$r_buff0_thd3~0_59 v_~z$r_buff1_thd3~0_33)) InVars {~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_6, ~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_25, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 02:52:00,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_44 1) (= v_P0Thread1of1ForFork2_~arg.base_23 |v_P0Thread1of1ForFork2_#in~arg.base_23|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_23| v_P0Thread1of1ForFork2_~arg.offset_23) (= 0 |v_P0Thread1of1ForFork2_#res.offset_13|) (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= v_~x~0_51 1) (= |v_P0Thread1of1ForFork2_#res.base_13| 0)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|} OutVars{~a~0=v_~a~0_44, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_23, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_13|, ~x~0=v_~x~0_51, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 02:52:00,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_7|) (= |v_P1Thread1of1ForFork3_#in~arg.offset_17| v_P1Thread1of1ForFork3_~arg.offset_17) (= |v_P1Thread1of1ForFork3_#in~arg.base_17| v_P1Thread1of1ForFork3_~arg.base_17) (= v_~y~0_22 v_~__unbuffered_p1_EAX~0_21) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= 0 |v_P1Thread1of1ForFork3_#res.offset_7|) (= v_~x~0_33 2)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_17, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 02:52:00,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In948697397 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In948697397 256)))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite28_Out948697397|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In948697397 |P3Thread1of1ForFork1_#t~ite28_Out948697397|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In948697397, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In948697397} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In948697397, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out948697397|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In948697397} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 02:52:00,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1779490658 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1779490658 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1779490658 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1779490658 256)))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite29_Out-1779490658|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1779490658 |P3Thread1of1ForFork1_#t~ite29_Out-1779490658|) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1779490658, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1779490658, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1779490658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1779490658} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1779490658, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-1779490658|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1779490658, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1779490658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1779490658} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 02:52:00,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L813-->L814: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1682557408 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1682557408 256)))) (or (and (= ~z$r_buff0_thd4~0_Out-1682557408 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out-1682557408 ~z$r_buff0_thd4~0_In-1682557408) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1682557408, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1682557408} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1682557408, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1682557408, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1682557408|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 02:52:00,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-552761387 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-552761387 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-552761387 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-552761387 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork1_#t~ite31_Out-552761387| ~z$r_buff1_thd4~0_In-552761387) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork1_#t~ite31_Out-552761387| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-552761387, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-552761387, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-552761387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-552761387} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-552761387, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-552761387, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-552761387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-552761387, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out-552761387|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 02:52:00,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= |v_P3Thread1of1ForFork1_#t~ite31_62| v_~z$r_buff1_thd4~0_109) (= v_~__unbuffered_cnt~0_133 (+ v_~__unbuffered_cnt~0_134 1)) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_62|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_109, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_61|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 02:52:00,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L778-->L779-8: Formula: (and (= |v_P2Thread1of1ForFork0_#t~ite22_31| |v_P2Thread1of1ForFork0_#t~ite22_30|) (= |v_P2Thread1of1ForFork0_#t~ite23_33| |v_P2Thread1of1ForFork0_#t~ite23_32|) (= v_~z$r_buff0_thd3~0_290 v_~z$r_buff0_thd3~0_289) (not (= (mod v_~weak$$choice2~0_121 256) 0)) (= v_~z$r_buff1_thd3~0_210 |v_P2Thread1of1ForFork0_#t~ite24_46|)) InVars {P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_31|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_290, ~weak$$choice2~0=v_~weak$$choice2~0_121} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_15|, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_30|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_32|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_46|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_289, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_31|, ~weak$$choice2~0=v_~weak$$choice2~0_121, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_29|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 02:52:00,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L781-->L789: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:52:00,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L843-->L845-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_106 256)) (= (mod v_~z$r_buff0_thd0~0_21 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:52:00,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L845-2-->L845-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1553090579 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1553090579 256) 0))) (or (and (= ~z$w_buff1~0_In1553090579 |ULTIMATE.start_main_#t~ite36_Out1553090579|) (not .cse0) (not .cse1)) (and (= ~z~0_In1553090579 |ULTIMATE.start_main_#t~ite36_Out1553090579|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1553090579, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1553090579, ~z$w_buff1~0=~z$w_buff1~0_In1553090579, ~z~0=~z~0_In1553090579} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1553090579, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1553090579, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1553090579|, ~z$w_buff1~0=~z$w_buff1~0_In1553090579, ~z~0=~z~0_In1553090579} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 02:52:00,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-27 02:52:00,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In960831379 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In960831379 256)))) (or (and (= ~z$w_buff0_used~0_In960831379 |ULTIMATE.start_main_#t~ite38_Out960831379|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out960831379|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In960831379, ~z$w_buff0_used~0=~z$w_buff0_used~0_In960831379} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In960831379, ~z$w_buff0_used~0=~z$w_buff0_used~0_In960831379, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out960831379|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:52:00,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1420740719 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1420740719 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1420740719 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1420740719 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out1420740719| ~z$w_buff1_used~0_In1420740719)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out1420740719|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1420740719, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1420740719, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1420740719, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1420740719} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1420740719, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1420740719|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1420740719, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1420740719, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1420740719} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:52:00,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1115059346 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1115059346 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1115059346| 0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1115059346 |ULTIMATE.start_main_#t~ite40_Out-1115059346|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1115059346, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1115059346} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1115059346, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1115059346|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1115059346} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:52:00,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-533690289 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-533690289 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-533690289 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-533690289 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-533690289 |ULTIMATE.start_main_#t~ite41_Out-533690289|)) (and (= |ULTIMATE.start_main_#t~ite41_Out-533690289| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-533690289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-533690289, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-533690289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-533690289} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-533690289|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-533690289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-533690289, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-533690289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-533690289} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 02:52:00,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_27) (= v_~x~0_63 2) (= v_~main$tmp_guard1~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~z$r_buff1_thd0~0_120 |v_ULTIMATE.start_main_#t~ite41_44|) (= 0 v_~__unbuffered_p3_EAX~0_80) (= 0 v_~__unbuffered_p1_EAX~0_40) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_120, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:52:00,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:52:00 BasicIcfg [2019-12-27 02:52:00,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:52:00,828 INFO L168 Benchmark]: Toolchain (without parser) took 33236.71 ms. Allocated memory was 144.2 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 100.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 793.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:00,832 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 02:52:00,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.56 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 154.8 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:00,834 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.52 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:00,836 INFO L168 Benchmark]: Boogie Preprocessor took 42.94 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:00,838 INFO L168 Benchmark]: RCFGBuilder took 787.24 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 104.7 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:00,838 INFO L168 Benchmark]: TraceAbstraction took 31523.95 ms. Allocated memory was 201.3 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 104.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 739.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:00,848 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.48 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.56 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 154.8 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.52 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.94 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 787.24 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 104.7 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31523.95 ms. Allocated memory was 201.3 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 104.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 739.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 168 ProgramPointsBefore, 77 ProgramPointsAfterwards, 190 TransitionsBefore, 84 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 20 ChoiceCompositions, 5577 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 168 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 46836 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 4 z$w_buff1 = z$w_buff0 [L795] 4 z$w_buff0 = 1 [L796] 4 z$w_buff1_used = z$w_buff0_used [L797] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 1 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L773] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L774] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L779] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 31.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2064 SDtfs, 2515 SDslu, 3164 SDs, 0 SdLazy, 1219 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35550occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 27528 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 539 NumberOfCodeBlocks, 539 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 474 ConstructedInterpolants, 0 QuantifiedInterpolants, 58834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...