/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/mix041_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:26:07,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:26:07,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:26:07,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:26:07,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:26:07,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:26:07,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:26:07,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:26:07,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:26:07,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:26:07,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:26:07,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:26:07,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:26:07,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:26:07,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:26:07,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:26:07,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:26:07,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:26:07,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:26:07,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:26:07,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:26:07,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:26:07,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:26:07,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:26:07,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:26:07,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:26:07,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:26:07,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:26:07,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:26:07,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:26:07,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:26:07,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:26:07,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:26:07,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:26:07,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:26:07,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:26:07,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:26:07,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:26:07,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:26:07,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:26:07,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:26:07,401 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-18 17:26:07,415 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:26:07,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:26:07,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:26:07,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:26:07,417 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:26:07,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:26:07,417 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:26:07,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:26:07,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:26:07,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:26:07,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:26:07,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:26:07,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:26:07,419 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:26:07,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:26:07,419 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:26:07,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:26:07,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:26:07,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:26:07,420 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:26:07,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:26:07,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:26:07,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:26:07,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:26:07,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:26:07,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:26:07,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:26:07,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:26:07,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:26:07,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:26:07,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:26:07,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:26:07,733 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:26:07,733 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:26:07,734 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i [2019-12-18 17:26:07,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2e878b11/e592299fb742488da84a429feffe5883/FLAG1c750d43b [2019-12-18 17:26:08,333 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:26:08,334 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i [2019-12-18 17:26:08,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2e878b11/e592299fb742488da84a429feffe5883/FLAG1c750d43b [2019-12-18 17:26:08,609 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2e878b11/e592299fb742488da84a429feffe5883 [2019-12-18 17:26:08,623 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:26:08,625 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:26:08,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:26:08,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:26:08,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:26:08,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:26:08" (1/1) ... [2019-12-18 17:26:08,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f0f0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:08, skipping insertion in model container [2019-12-18 17:26:08,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:26:08" (1/1) ... [2019-12-18 17:26:08,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:26:08,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:26:09,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:26:09,262 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:26:09,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:26:09,421 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:26:09,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:09 WrapperNode [2019-12-18 17:26:09,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:26:09,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:26:09,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:26:09,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:26:09,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:09" (1/1) ... [2019-12-18 17:26:09,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:09" (1/1) ... [2019-12-18 17:26:09,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:26:09,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:26:09,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:26:09,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:26:09,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:09" (1/1) ... [2019-12-18 17:26:09,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:09" (1/1) ... [2019-12-18 17:26:09,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:09" (1/1) ... [2019-12-18 17:26:09,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:09" (1/1) ... [2019-12-18 17:26:09,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:09" (1/1) ... [2019-12-18 17:26:09,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:09" (1/1) ... [2019-12-18 17:26:09,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:09" (1/1) ... [2019-12-18 17:26:09,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:26:09,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:26:09,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:26:09,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:26:09,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:09" (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-18 17:26:09,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:26:09,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:26:09,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:26:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:26:09,600 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:26:09,600 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:26:09,601 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:26:09,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:26:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:26:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:26:09,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:26:09,607 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:26:10,350 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:26:10,350 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:26:10,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:26:10 BoogieIcfgContainer [2019-12-18 17:26:10,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:26:10,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:26:10,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:26:10,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:26:10,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:26:08" (1/3) ... [2019-12-18 17:26:10,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edc9f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:26:10, skipping insertion in model container [2019-12-18 17:26:10,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:09" (2/3) ... [2019-12-18 17:26:10,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edc9f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:26:10, skipping insertion in model container [2019-12-18 17:26:10,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:26:10" (3/3) ... [2019-12-18 17:26:10,361 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_pso.opt.i [2019-12-18 17:26:10,372 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:26:10,372 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:26:10,380 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:26:10,381 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:26:10,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,417 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,418 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,427 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,427 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,428 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,428 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,441 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,441 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,444 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,445 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,445 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:10,463 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 17:26:10,484 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:26:10,485 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:26:10,485 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:26:10,485 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:26:10,485 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:26:10,485 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:26:10,486 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:26:10,486 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:26:10,503 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 17:26:10,506 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 17:26:10,608 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 17:26:10,609 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:26:10,622 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 17:26:10,640 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 17:26:10,678 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 17:26:10,679 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:26:10,684 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 17:26:10,697 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 17:26:10,698 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:26:15,367 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 17:26:15,472 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 17:26:15,507 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45620 [2019-12-18 17:26:15,508 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 17:26:15,512 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-12-18 17:26:16,063 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8218 states. [2019-12-18 17:26:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 8218 states. [2019-12-18 17:26:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 17:26:16,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:16,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 17:26:16,074 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:16,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash 699456563, now seen corresponding path program 1 times [2019-12-18 17:26:16,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:16,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647182121] [2019-12-18 17:26:16,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:26:16,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647182121] [2019-12-18 17:26:16,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:16,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:26:16,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208141711] [2019-12-18 17:26:16,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:26:16,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:16,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:26:16,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:26:16,447 INFO L87 Difference]: Start difference. First operand 8218 states. Second operand 3 states. [2019-12-18 17:26:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:16,716 INFO L93 Difference]: Finished difference Result 8170 states and 26597 transitions. [2019-12-18 17:26:16,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:26:16,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 17:26:16,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:16,819 INFO L225 Difference]: With dead ends: 8170 [2019-12-18 17:26:16,820 INFO L226 Difference]: Without dead ends: 8001 [2019-12-18 17:26:16,821 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-18 17:26:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2019-12-18 17:26:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 8001. [2019-12-18 17:26:17,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8001 states. [2019-12-18 17:26:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 26077 transitions. [2019-12-18 17:26:17,300 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 26077 transitions. Word has length 5 [2019-12-18 17:26:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:26:17,300 INFO L462 AbstractCegarLoop]: Abstraction has 8001 states and 26077 transitions. [2019-12-18 17:26:17,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:26:17,301 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 26077 transitions. [2019-12-18 17:26:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:26:17,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:17,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:26:17,304 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:17,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:17,304 INFO L82 PathProgramCache]: Analyzing trace with hash 336736415, now seen corresponding path program 1 times [2019-12-18 17:26:17,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:17,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911601648] [2019-12-18 17:26:17,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:17,414 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-18 17:26:17,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911601648] [2019-12-18 17:26:17,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:17,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:26:17,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939849619] [2019-12-18 17:26:17,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:26:17,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:17,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:26:17,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:26:17,419 INFO L87 Difference]: Start difference. First operand 8001 states and 26077 transitions. Second operand 4 states. [2019-12-18 17:26:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:17,788 INFO L93 Difference]: Finished difference Result 12769 states and 39815 transitions. [2019-12-18 17:26:17,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:26:17,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:26:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:17,861 INFO L225 Difference]: With dead ends: 12769 [2019-12-18 17:26:17,861 INFO L226 Difference]: Without dead ends: 12762 [2019-12-18 17:26:17,862 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-18 17:26:17,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2019-12-18 17:26:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 11253. [2019-12-18 17:26:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11253 states. [2019-12-18 17:26:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11253 states to 11253 states and 35607 transitions. [2019-12-18 17:26:18,895 INFO L78 Accepts]: Start accepts. Automaton has 11253 states and 35607 transitions. Word has length 11 [2019-12-18 17:26:18,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:26:18,896 INFO L462 AbstractCegarLoop]: Abstraction has 11253 states and 35607 transitions. [2019-12-18 17:26:18,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:26:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 11253 states and 35607 transitions. [2019-12-18 17:26:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:26:18,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:18,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:26:18,899 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:18,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:18,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1460182026, now seen corresponding path program 1 times [2019-12-18 17:26:18,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:18,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495078538] [2019-12-18 17:26:18,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:19,022 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-18 17:26:19,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495078538] [2019-12-18 17:26:19,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:19,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:26:19,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408991666] [2019-12-18 17:26:19,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:26:19,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:26:19,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:26:19,024 INFO L87 Difference]: Start difference. First operand 11253 states and 35607 transitions. Second operand 4 states. [2019-12-18 17:26:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:19,066 INFO L93 Difference]: Finished difference Result 1887 states and 4356 transitions. [2019-12-18 17:26:19,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:26:19,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:26:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:19,071 INFO L225 Difference]: With dead ends: 1887 [2019-12-18 17:26:19,072 INFO L226 Difference]: Without dead ends: 1601 [2019-12-18 17:26:19,072 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-18 17:26:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2019-12-18 17:26:19,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2019-12-18 17:26:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-12-18 17:26:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 3565 transitions. [2019-12-18 17:26:19,107 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 3565 transitions. Word has length 11 [2019-12-18 17:26:19,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:26:19,107 INFO L462 AbstractCegarLoop]: Abstraction has 1601 states and 3565 transitions. [2019-12-18 17:26:19,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:26:19,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 3565 transitions. [2019-12-18 17:26:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 17:26:19,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:19,110 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] [2019-12-18 17:26:19,110 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:19,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1717219497, now seen corresponding path program 1 times [2019-12-18 17:26:19,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:19,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383192648] [2019-12-18 17:26:19,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:19,238 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-18 17:26:19,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383192648] [2019-12-18 17:26:19,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:19,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:26:19,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324400868] [2019-12-18 17:26:19,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:26:19,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:19,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:26:19,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:26:19,241 INFO L87 Difference]: Start difference. First operand 1601 states and 3565 transitions. Second operand 5 states. [2019-12-18 17:26:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:19,286 INFO L93 Difference]: Finished difference Result 401 states and 747 transitions. [2019-12-18 17:26:19,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:26:19,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-18 17:26:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:19,288 INFO L225 Difference]: With dead ends: 401 [2019-12-18 17:26:19,288 INFO L226 Difference]: Without dead ends: 355 [2019-12-18 17:26:19,288 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-18 17:26:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-12-18 17:26:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 320. [2019-12-18 17:26:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-18 17:26:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 592 transitions. [2019-12-18 17:26:19,296 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 592 transitions. Word has length 23 [2019-12-18 17:26:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:26:19,296 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 592 transitions. [2019-12-18 17:26:19,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:26:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 592 transitions. [2019-12-18 17:26:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 17:26:19,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:19,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:26:19,298 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:19,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1915125863, now seen corresponding path program 1 times [2019-12-18 17:26:19,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:19,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029385841] [2019-12-18 17:26:19,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:19,378 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-18 17:26:19,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029385841] [2019-12-18 17:26:19,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:19,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:26:19,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357852237] [2019-12-18 17:26:19,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:26:19,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:19,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:26:19,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:26:19,381 INFO L87 Difference]: Start difference. First operand 320 states and 592 transitions. Second operand 3 states. [2019-12-18 17:26:19,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:19,424 INFO L93 Difference]: Finished difference Result 331 states and 607 transitions. [2019-12-18 17:26:19,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:26:19,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 17:26:19,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:19,426 INFO L225 Difference]: With dead ends: 331 [2019-12-18 17:26:19,426 INFO L226 Difference]: Without dead ends: 331 [2019-12-18 17:26:19,426 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-18 17:26:19,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-18 17:26:19,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-12-18 17:26:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-18 17:26:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 603 transitions. [2019-12-18 17:26:19,433 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 603 transitions. Word has length 52 [2019-12-18 17:26:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:26:19,434 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 603 transitions. [2019-12-18 17:26:19,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:26:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 603 transitions. [2019-12-18 17:26:19,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 17:26:19,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:19,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:26:19,436 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:19,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:19,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1804822393, now seen corresponding path program 1 times [2019-12-18 17:26:19,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:19,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754090649] [2019-12-18 17:26:19,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:19,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:26:19,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754090649] [2019-12-18 17:26:19,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:19,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:26:19,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869012688] [2019-12-18 17:26:19,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:26:19,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:19,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:26:19,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:26:19,585 INFO L87 Difference]: Start difference. First operand 327 states and 603 transitions. Second operand 3 states. [2019-12-18 17:26:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:19,599 INFO L93 Difference]: Finished difference Result 327 states and 590 transitions. [2019-12-18 17:26:19,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:26:19,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 17:26:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:19,601 INFO L225 Difference]: With dead ends: 327 [2019-12-18 17:26:19,601 INFO L226 Difference]: Without dead ends: 327 [2019-12-18 17:26:19,602 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-18 17:26:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-18 17:26:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2019-12-18 17:26:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-18 17:26:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 590 transitions. [2019-12-18 17:26:19,609 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 590 transitions. Word has length 52 [2019-12-18 17:26:19,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:26:19,609 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 590 transitions. [2019-12-18 17:26:19,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:26:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 590 transitions. [2019-12-18 17:26:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 17:26:19,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:19,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:26:19,611 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:19,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:19,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1986059885, now seen corresponding path program 1 times [2019-12-18 17:26:19,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:19,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074705077] [2019-12-18 17:26:19,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:19,739 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-18 17:26:19,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074705077] [2019-12-18 17:26:19,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:19,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:26:19,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796400881] [2019-12-18 17:26:19,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:26:19,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:19,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:26:19,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:26:19,742 INFO L87 Difference]: Start difference. First operand 327 states and 590 transitions. Second operand 5 states. [2019-12-18 17:26:20,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:20,020 INFO L93 Difference]: Finished difference Result 458 states and 824 transitions. [2019-12-18 17:26:20,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:26:20,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-18 17:26:20,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:20,023 INFO L225 Difference]: With dead ends: 458 [2019-12-18 17:26:20,023 INFO L226 Difference]: Without dead ends: 458 [2019-12-18 17:26:20,024 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-18 17:26:20,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-18 17:26:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 362. [2019-12-18 17:26:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-12-18 17:26:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 657 transitions. [2019-12-18 17:26:20,032 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 657 transitions. Word has length 53 [2019-12-18 17:26:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:26:20,032 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 657 transitions. [2019-12-18 17:26:20,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:26:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 657 transitions. [2019-12-18 17:26:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 17:26:20,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:20,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:26:20,034 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:20,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:20,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2130042739, now seen corresponding path program 2 times [2019-12-18 17:26:20,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:20,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128525434] [2019-12-18 17:26:20,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:20,109 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-18 17:26:20,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128525434] [2019-12-18 17:26:20,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:20,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:26:20,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294915700] [2019-12-18 17:26:20,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:26:20,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:20,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:26:20,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:26:20,111 INFO L87 Difference]: Start difference. First operand 362 states and 657 transitions. Second operand 3 states. [2019-12-18 17:26:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:20,153 INFO L93 Difference]: Finished difference Result 361 states and 655 transitions. [2019-12-18 17:26:20,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:26:20,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 17:26:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:20,155 INFO L225 Difference]: With dead ends: 361 [2019-12-18 17:26:20,155 INFO L226 Difference]: Without dead ends: 361 [2019-12-18 17:26:20,155 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-18 17:26:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-12-18 17:26:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 272. [2019-12-18 17:26:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-12-18 17:26:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 494 transitions. [2019-12-18 17:26:20,162 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 494 transitions. Word has length 53 [2019-12-18 17:26:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:26:20,162 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 494 transitions. [2019-12-18 17:26:20,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:26:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 494 transitions. [2019-12-18 17:26:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 17:26:20,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:20,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:26:20,164 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:20,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:20,164 INFO L82 PathProgramCache]: Analyzing trace with hash -752439480, now seen corresponding path program 1 times [2019-12-18 17:26:20,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:20,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390506888] [2019-12-18 17:26:20,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:20,400 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-18 17:26:20,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390506888] [2019-12-18 17:26:20,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:20,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:26:20,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083254476] [2019-12-18 17:26:20,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:26:20,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:20,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:26:20,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:26:20,409 INFO L87 Difference]: Start difference. First operand 272 states and 494 transitions. Second operand 10 states. [2019-12-18 17:26:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:20,697 INFO L93 Difference]: Finished difference Result 496 states and 897 transitions. [2019-12-18 17:26:20,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:26:20,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-18 17:26:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:26:20,698 INFO L225 Difference]: With dead ends: 496 [2019-12-18 17:26:20,699 INFO L226 Difference]: Without dead ends: 232 [2019-12-18 17:26:20,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:26:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-12-18 17:26:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 208. [2019-12-18 17:26:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-12-18 17:26:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 367 transitions. [2019-12-18 17:26:20,706 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 367 transitions. Word has length 54 [2019-12-18 17:26:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:26:20,707 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 367 transitions. [2019-12-18 17:26:20,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:26:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 367 transitions. [2019-12-18 17:26:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 17:26:20,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:20,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:26:20,708 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:20,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:20,709 INFO L82 PathProgramCache]: Analyzing trace with hash 516281010, now seen corresponding path program 2 times [2019-12-18 17:26:20,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:20,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991813919] [2019-12-18 17:26:20,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:26:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:26:20,929 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:26:20,929 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:26:20,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$r_buff1_thd2~0_157) (= 0 v_~weak$$choice0~0_14) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1095~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1095~0.base_20|) |v_ULTIMATE.start_main_~#t1095~0.offset_15| 0)) |v_#memory_int_17|) (= |v_#NULL.offset_6| 0) (= v_~x$mem_tmp~0_21 0) (= 0 v_~x$w_buff0~0_235) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~x$w_buff1~0_175) (= 0 v_~x$w_buff1_used~0_360) (= v_~weak$$choice2~0_113 0) (= 0 v_~x$read_delayed~0_5) (= 0 v_~x$r_buff0_thd2~0_211) (= (store .cse0 |v_ULTIMATE.start_main_~#t1095~0.base_20| 1) |v_#valid_44|) (= v_~main$tmp_guard1~0_26 0) (= v_~x$r_buff0_thd0~0_331 0) (= |v_ULTIMATE.start_main_~#t1095~0.offset_15| 0) (= v_~x$r_buff1_thd0~0_268 0) (= v_~__unbuffered_p1_EAX~0_126 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~x$r_buff1_thd1~0_198 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1095~0.base_20|)) (= 0 v_~__unbuffered_cnt~0_64) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p1_EBX~0_126) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1095~0.base_20| 4) |v_#length_17|) (= 0 v_~x$w_buff0_used~0_638) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1095~0.base_20|) (= 0 v_~x~0_158) (= v_~x$flush_delayed~0_38 0) (= v_~z~0_80 0) (= v_~y~0_115 0) (= v_~x$r_buff0_thd1~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_235, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ~x$flush_delayed~0=v_~x$flush_delayed~0_38, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_30|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_34|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_~#t1096~0.offset=|v_ULTIMATE.start_main_~#t1096~0.offset_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_126, ULTIMATE.start_main_~#t1096~0.base=|v_ULTIMATE.start_main_~#t1096~0.base_17|, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_331, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_35|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ~x$w_buff1~0=v_~x$w_buff1~0_175, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_24|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_360, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_157, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_29|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_30|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~x~0=v_~x~0_158, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_118, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_26|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_45|, ~x$mem_tmp~0=v_~x$mem_tmp~0_21, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_36|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_26|, ULTIMATE.start_main_~#t1095~0.offset=|v_ULTIMATE.start_main_~#t1095~0.offset_15|, ~y~0=v_~y~0_115, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_126, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_34|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_24|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_268, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_638, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_17|, ~z~0=v_~z~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_113, ULTIMATE.start_main_~#t1095~0.base=|v_ULTIMATE.start_main_~#t1095~0.base_20|, ~x$read_delayed~0=v_~x$read_delayed~0_5} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1096~0.offset, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1096~0.base, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1095~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1095~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 17:26:20,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L789-1-->L791: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1096~0.base_11|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1096~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1096~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1096~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1096~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1096~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1096~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1096~0.base_11|) |v_ULTIMATE.start_main_~#t1096~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1096~0.base=|v_ULTIMATE.start_main_~#t1096~0.base_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1096~0.offset=|v_ULTIMATE.start_main_~#t1096~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1096~0.base, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1096~0.offset] because there is no mapped edge [2019-12-18 17:26:20,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= 1 v_~x$w_buff0_used~0_78) (= (mod v_~x$w_buff1_used~0_47 256) 0) (= 2 v_~x$w_buff0~0_19) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= v_~x$w_buff1_used~0_47 v_~x$w_buff0_used~0_79) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_79} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 17:26:20,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out1970540513| |P0Thread1of1ForFork0_#t~ite3_Out1970540513|)) (.cse1 (= (mod ~x$w_buff1_used~0_In1970540513 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1970540513 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In1970540513 |P0Thread1of1ForFork0_#t~ite3_Out1970540513|) .cse2) (and (= ~x$w_buff1~0_In1970540513 |P0Thread1of1ForFork0_#t~ite3_Out1970540513|) .cse2 (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1970540513, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1970540513, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1970540513, ~x~0=~x~0_In1970540513} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1970540513|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1970540513|, ~x$w_buff1~0=~x$w_buff1~0_In1970540513, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1970540513, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1970540513, ~x~0=~x~0_In1970540513} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 17:26:20,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1940748725 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1940748725 256)))) (or (and (= ~x$w_buff0_used~0_In1940748725 |P0Thread1of1ForFork0_#t~ite5_Out1940748725|) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1940748725| 0) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1940748725, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1940748725} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1940748725|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1940748725, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1940748725} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:26:20,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In1174141955 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1174141955 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1174141955 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1174141955 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1174141955| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out1174141955| ~x$w_buff1_used~0_In1174141955) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1174141955, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1174141955, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1174141955, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1174141955} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1174141955|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1174141955, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1174141955, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1174141955, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1174141955} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:26:20,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1095717682 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1095717682 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1095717682|)) (and (= ~x$r_buff0_thd1~0_In1095717682 |P0Thread1of1ForFork0_#t~ite7_Out1095717682|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1095717682, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1095717682} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1095717682, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1095717682|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1095717682} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 17:26:20,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In1664297081 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1664297081 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1664297081 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1664297081 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1664297081| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out1664297081| ~x$r_buff1_thd1~0_In1664297081) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1664297081, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1664297081, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1664297081, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1664297081} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1664297081, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1664297081|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1664297081, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1664297081, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1664297081} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:26:20,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_144 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_144} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 17:26:20,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In206079108 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In206079108 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out206079108| ~x$w_buff0_used~0_In206079108)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out206079108| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In206079108, ~x$w_buff0_used~0=~x$w_buff0_used~0_In206079108} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out206079108|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In206079108, ~x$w_buff0_used~0=~x$w_buff0_used~0_In206079108} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 17:26:20,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In627863480 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In627863480 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In627863480 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In627863480 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out627863480| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite12_Out627863480| ~x$w_buff1_used~0_In627863480)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In627863480, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In627863480, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In627863480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In627863480} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In627863480, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In627863480, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out627863480|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In627863480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In627863480} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:26:20,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-12787736 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-12787736 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-12787736 ~x$r_buff0_thd2~0_In-12787736)) (and (= ~x$r_buff0_thd2~0_Out-12787736 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-12787736, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-12787736} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-12787736|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-12787736, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-12787736} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 17:26:20,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In467562952 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In467562952 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In467562952 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In467562952 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out467562952| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out467562952| ~x$r_buff1_thd2~0_In467562952)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In467562952, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In467562952, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In467562952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In467562952} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In467562952, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In467562952, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In467562952, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out467562952|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In467562952} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 17:26:20,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L770-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_134 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_134, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:26:20,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_128 256) 0) (= 0 (mod v_~x$w_buff0_used~0_232 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 17:26:20,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In691351279 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In691351279 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out691351279| ~x~0_In691351279) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite17_Out691351279| ~x$w_buff1~0_In691351279) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In691351279, ~x$w_buff1_used~0=~x$w_buff1_used~0_In691351279, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In691351279, ~x~0=~x~0_In691351279} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out691351279|, ~x$w_buff1~0=~x$w_buff1~0_In691351279, ~x$w_buff1_used~0=~x$w_buff1_used~0_In691351279, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In691351279, ~x~0=~x~0_In691351279} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 17:26:20,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_43 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~x~0=v_~x~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-18 17:26:20,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In710616409 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In710616409 256)))) (or (and (= ~x$w_buff0_used~0_In710616409 |ULTIMATE.start_main_#t~ite19_Out710616409|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out710616409|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In710616409, ~x$w_buff0_used~0=~x$w_buff0_used~0_In710616409} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In710616409, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out710616409|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In710616409} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 17:26:20,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-1658541329 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1658541329 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1658541329 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1658541329 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1658541329 |ULTIMATE.start_main_#t~ite20_Out-1658541329|)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-1658541329|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1658541329, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1658541329, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1658541329, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1658541329} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1658541329, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1658541329, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1658541329|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1658541329, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1658541329} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:26:20,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In751933546 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In751933546 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out751933546| ~x$r_buff0_thd0~0_In751933546) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out751933546| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In751933546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In751933546} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In751933546, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out751933546|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In751933546} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:26:20,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-152034907 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-152034907 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-152034907 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-152034907 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-152034907| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-152034907 |ULTIMATE.start_main_#t~ite22_Out-152034907|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-152034907, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-152034907, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-152034907, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-152034907} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-152034907, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-152034907, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-152034907, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-152034907|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-152034907} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:26:20,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1150731571 256)))) (or (and (= |ULTIMATE.start_main_#t~ite32_Out-1150731571| ~x$w_buff1~0_In-1150731571) (= |ULTIMATE.start_main_#t~ite31_In-1150731571| |ULTIMATE.start_main_#t~ite31_Out-1150731571|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite31_Out-1150731571| ~x$w_buff1~0_In-1150731571) (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1150731571 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1150731571 256)) (and .cse1 (= (mod ~x$r_buff1_thd0~0_In-1150731571 256) 0)) (and (= (mod ~x$w_buff1_used~0_In-1150731571 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite32_Out-1150731571| |ULTIMATE.start_main_#t~ite31_Out-1150731571|) .cse0))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1150731571, ~x$w_buff1~0=~x$w_buff1~0_In-1150731571, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1150731571, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1150731571, ~weak$$choice2~0=~weak$$choice2~0_In-1150731571, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-1150731571|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1150731571} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1150731571, ~x$w_buff1~0=~x$w_buff1~0_In-1150731571, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1150731571, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1150731571|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1150731571, ~weak$$choice2~0=~weak$$choice2~0_In-1150731571, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1150731571|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1150731571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 17:26:20,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1883510375 256)))) (or (and (not .cse0) (= ~x$w_buff1_used~0_In1883510375 |ULTIMATE.start_main_#t~ite38_Out1883510375|) (= |ULTIMATE.start_main_#t~ite37_In1883510375| |ULTIMATE.start_main_#t~ite37_Out1883510375|)) (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1883510375 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In1883510375 256)) .cse1) (and (= 0 (mod ~x$r_buff1_thd0~0_In1883510375 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1883510375 256)))) (= |ULTIMATE.start_main_#t~ite37_Out1883510375| |ULTIMATE.start_main_#t~ite38_Out1883510375|) (= ~x$w_buff1_used~0_In1883510375 |ULTIMATE.start_main_#t~ite37_Out1883510375|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1883510375, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1883510375, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In1883510375|, ~weak$$choice2~0=~weak$$choice2~0_In1883510375, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1883510375, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1883510375} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1883510375, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1883510375, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1883510375|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1883510375|, ~weak$$choice2~0=~weak$$choice2~0_In1883510375, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1883510375, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1883510375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 17:26:20,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~x$r_buff0_thd0~0_85 v_~x$r_buff0_thd0~0_84)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:26:20,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L816-->L819-1: Formula: (and (= v_~x$mem_tmp~0_16 v_~x~0_122) (not (= 0 (mod v_~x$flush_delayed~0_31 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_30 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ~x~0=v_~x~0_122, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_27|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:26:20,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:26:21,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:26:21 BasicIcfg [2019-12-18 17:26:21,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:26:21,045 INFO L168 Benchmark]: Toolchain (without parser) took 12419.98 ms. Allocated memory was 143.1 MB in the beginning and 542.6 MB in the end (delta: 399.5 MB). Free memory was 99.9 MB in the beginning and 277.6 MB in the end (delta: -177.7 MB). Peak memory consumption was 221.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:26:21,045 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 17:26:21,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.67 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 154.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:26:21,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.62 ms. Allocated memory is still 200.8 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:26:21,048 INFO L168 Benchmark]: Boogie Preprocessor took 38.31 ms. Allocated memory is still 200.8 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:26:21,048 INFO L168 Benchmark]: RCFGBuilder took 826.15 ms. Allocated memory is still 200.8 MB. Free memory was 150.0 MB in the beginning and 105.5 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:26:21,049 INFO L168 Benchmark]: TraceAbstraction took 10689.92 ms. Allocated memory was 200.8 MB in the beginning and 542.6 MB in the end (delta: 341.8 MB). Free memory was 104.8 MB in the beginning and 277.6 MB in the end (delta: -172.8 MB). Peak memory consumption was 169.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:26:21,053 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.40 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.67 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 154.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.62 ms. Allocated memory is still 200.8 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.31 ms. Allocated memory is still 200.8 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 826.15 ms. Allocated memory is still 200.8 MB. Free memory was 150.0 MB in the beginning and 105.5 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10689.92 ms. Allocated memory was 200.8 MB in the beginning and 542.6 MB in the end (delta: 341.8 MB). Free memory was 104.8 MB in the beginning and 277.6 MB in the end (delta: -172.8 MB). Peak memory consumption was 169.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 88 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 3874 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 57 SemBasedMoverChecksPositive, 186 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 45620 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1095, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1096, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 838 SDtfs, 807 SDslu, 1305 SDs, 0 SdLazy, 538 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11253occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 1757 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 44113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...