/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:08:29,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:08:29,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:08:29,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:08:29,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:08:29,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:08:29,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:08:29,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:08:29,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:08:29,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:08:29,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:08:29,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:08:29,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:08:29,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:08:29,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:08:29,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:08:29,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:08:29,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:08:29,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:08:29,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:08:29,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:08:29,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:08:29,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:08:29,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:08:29,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:08:29,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:08:29,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:08:29,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:08:29,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:08:29,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:08:29,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:08:29,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:08:29,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:08:29,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:08:29,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:08:29,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:08:29,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:08:29,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:08:29,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:08:29,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:08:29,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:08:29,484 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:08:29,516 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:08:29,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:08:29,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:08:29,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:08:29,520 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:08:29,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:08:29,521 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:08:29,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:08:29,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:08:29,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:08:29,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:08:29,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:08:29,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:08:29,524 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:08:29,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:08:29,524 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:08:29,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:08:29,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:08:29,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:08:29,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:08:29,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:08:29,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:08:29,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:08:29,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:08:29,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:08:29,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:08:29,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:08:29,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:08:29,528 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:08:29,529 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:08:29,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:08:29,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:08:29,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:08:29,809 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:08:29,810 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:08:29,811 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-18 15:08:29,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/833cf4d84/a917d8c3b9864db8bd0796d034ba2713/FLAG549d9f679 [2019-12-18 15:08:30,429 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:08:30,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-18 15:08:30,451 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/833cf4d84/a917d8c3b9864db8bd0796d034ba2713/FLAG549d9f679 [2019-12-18 15:08:30,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/833cf4d84/a917d8c3b9864db8bd0796d034ba2713 [2019-12-18 15:08:30,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:08:30,707 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:08:30,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:08:30,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:08:30,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:08:30,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:08:30" (1/1) ... [2019-12-18 15:08:30,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3899c684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:30, skipping insertion in model container [2019-12-18 15:08:30,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:08:30" (1/1) ... [2019-12-18 15:08:30,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:08:30,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:08:31,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:08:31,278 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:08:31,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:08:31,422 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:08:31,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31 WrapperNode [2019-12-18 15:08:31,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:08:31,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:08:31,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:08:31,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:08:31,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:08:31,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:08:31,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:08:31,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:08:31,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:08:31,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:08:31,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:08:31,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:08:31,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (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 15:08:31,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:08:31,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:08:31,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:08:31,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:08:31,608 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:08:31,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:08:31,609 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:08:31,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:08:31,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:08:31,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:08:31,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:08:31,613 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 15:08:32,278 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:08:32,278 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:08:32,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:08:32 BoogieIcfgContainer [2019-12-18 15:08:32,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:08:32,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:08:32,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:08:32,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:08:32,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:08:30" (1/3) ... [2019-12-18 15:08:32,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c346c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:08:32, skipping insertion in model container [2019-12-18 15:08:32,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (2/3) ... [2019-12-18 15:08:32,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c346c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:08:32, skipping insertion in model container [2019-12-18 15:08:32,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:08:32" (3/3) ... [2019-12-18 15:08:32,288 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2019-12-18 15:08:32,296 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:08:32,297 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:08:32,306 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:08:32,307 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:08:32,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,342 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,342 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,344 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,365 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,365 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,366 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,386 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 15:08:32,406 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:08:32,407 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:08:32,407 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:08:32,407 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:08:32,407 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:08:32,407 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:08:32,408 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:08:32,408 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:08:32,438 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-18 15:08:32,442 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 15:08:32,543 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 15:08:32,543 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:08:32,557 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 15:08:32,575 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 15:08:32,615 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 15:08:32,616 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:08:32,622 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 15:08:32,635 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-18 15:08:32,637 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:08:36,951 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-18 15:08:37,077 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46212 [2019-12-18 15:08:37,078 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 15:08:37,081 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-18 15:08:37,560 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8458 states. [2019-12-18 15:08:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states. [2019-12-18 15:08:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:08:37,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:37,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:08:37,578 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:37,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:37,584 INFO L82 PathProgramCache]: Analyzing trace with hash 717058, now seen corresponding path program 1 times [2019-12-18 15:08:37,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:37,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317373269] [2019-12-18 15:08:37,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:37,769 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 15:08:37,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317373269] [2019-12-18 15:08:37,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:37,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:08:37,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922792530] [2019-12-18 15:08:37,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:37,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:37,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:37,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:37,795 INFO L87 Difference]: Start difference. First operand 8458 states. Second operand 3 states. [2019-12-18 15:08:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:38,026 INFO L93 Difference]: Finished difference Result 8394 states and 27476 transitions. [2019-12-18 15:08:38,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:38,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:08:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:38,119 INFO L225 Difference]: With dead ends: 8394 [2019-12-18 15:08:38,120 INFO L226 Difference]: Without dead ends: 8226 [2019-12-18 15:08:38,121 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 15:08:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2019-12-18 15:08:38,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 8226. [2019-12-18 15:08:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8226 states. [2019-12-18 15:08:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 26958 transitions. [2019-12-18 15:08:38,604 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 26958 transitions. Word has length 3 [2019-12-18 15:08:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:38,604 INFO L462 AbstractCegarLoop]: Abstraction has 8226 states and 26958 transitions. [2019-12-18 15:08:38,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:38,605 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 26958 transitions. [2019-12-18 15:08:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 15:08:38,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:38,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:38,610 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:38,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:38,611 INFO L82 PathProgramCache]: Analyzing trace with hash 651590314, now seen corresponding path program 1 times [2019-12-18 15:08:38,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:38,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222504279] [2019-12-18 15:08:38,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:38,796 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 15:08:38,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222504279] [2019-12-18 15:08:38,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:38,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:38,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234650631] [2019-12-18 15:08:38,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:08:38,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:38,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:08:38,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:08:38,802 INFO L87 Difference]: Start difference. First operand 8226 states and 26958 transitions. Second operand 4 states. [2019-12-18 15:08:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:39,181 INFO L93 Difference]: Finished difference Result 12778 states and 40134 transitions. [2019-12-18 15:08:39,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:08:39,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 15:08:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:39,256 INFO L225 Difference]: With dead ends: 12778 [2019-12-18 15:08:39,257 INFO L226 Difference]: Without dead ends: 12771 [2019-12-18 15:08:39,257 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 15:08:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2019-12-18 15:08:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 11467. [2019-12-18 15:08:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11467 states. [2019-12-18 15:08:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11467 states to 11467 states and 36507 transitions. [2019-12-18 15:08:40,235 INFO L78 Accepts]: Start accepts. Automaton has 11467 states and 36507 transitions. Word has length 11 [2019-12-18 15:08:40,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:40,235 INFO L462 AbstractCegarLoop]: Abstraction has 11467 states and 36507 transitions. [2019-12-18 15:08:40,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:08:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 11467 states and 36507 transitions. [2019-12-18 15:08:40,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 15:08:40,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:40,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:40,245 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:40,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1968692504, now seen corresponding path program 1 times [2019-12-18 15:08:40,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:40,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415995329] [2019-12-18 15:08:40,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:40,371 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 15:08:40,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415995329] [2019-12-18 15:08:40,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:40,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:40,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817022] [2019-12-18 15:08:40,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:08:40,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:40,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:08:40,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:08:40,374 INFO L87 Difference]: Start difference. First operand 11467 states and 36507 transitions. Second operand 4 states. [2019-12-18 15:08:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:40,633 INFO L93 Difference]: Finished difference Result 14268 states and 44852 transitions. [2019-12-18 15:08:40,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:08:40,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 15:08:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:40,676 INFO L225 Difference]: With dead ends: 14268 [2019-12-18 15:08:40,677 INFO L226 Difference]: Without dead ends: 14268 [2019-12-18 15:08:40,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14268 states. [2019-12-18 15:08:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14268 to 12752. [2019-12-18 15:08:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12752 states. [2019-12-18 15:08:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12752 states to 12752 states and 40448 transitions. [2019-12-18 15:08:41,245 INFO L78 Accepts]: Start accepts. Automaton has 12752 states and 40448 transitions. Word has length 11 [2019-12-18 15:08:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:41,245 INFO L462 AbstractCegarLoop]: Abstraction has 12752 states and 40448 transitions. [2019-12-18 15:08:41,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:08:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 12752 states and 40448 transitions. [2019-12-18 15:08:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:08:41,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:41,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:41,249 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:41,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:41,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1372508181, now seen corresponding path program 1 times [2019-12-18 15:08:41,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:41,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025737650] [2019-12-18 15:08:41,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:41,374 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 15:08:41,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025737650] [2019-12-18 15:08:41,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:41,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:08:41,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070540082] [2019-12-18 15:08:41,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:08:41,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:41,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:08:41,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:41,376 INFO L87 Difference]: Start difference. First operand 12752 states and 40448 transitions. Second operand 5 states. [2019-12-18 15:08:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:41,983 INFO L93 Difference]: Finished difference Result 17010 states and 52843 transitions. [2019-12-18 15:08:41,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:08:41,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 15:08:41,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:42,046 INFO L225 Difference]: With dead ends: 17010 [2019-12-18 15:08:42,046 INFO L226 Difference]: Without dead ends: 17003 [2019-12-18 15:08:42,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:08:42,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17003 states. [2019-12-18 15:08:42,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17003 to 12755. [2019-12-18 15:08:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12755 states. [2019-12-18 15:08:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12755 states to 12755 states and 40342 transitions. [2019-12-18 15:08:42,462 INFO L78 Accepts]: Start accepts. Automaton has 12755 states and 40342 transitions. Word has length 17 [2019-12-18 15:08:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:42,462 INFO L462 AbstractCegarLoop]: Abstraction has 12755 states and 40342 transitions. [2019-12-18 15:08:42,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:08:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 12755 states and 40342 transitions. [2019-12-18 15:08:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:08:42,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:42,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:42,476 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:42,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:42,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1155459573, now seen corresponding path program 1 times [2019-12-18 15:08:42,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:42,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048011734] [2019-12-18 15:08:42,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:42,522 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 15:08:42,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048011734] [2019-12-18 15:08:42,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:42,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:08:42,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662581456] [2019-12-18 15:08:42,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:42,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:42,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:42,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:42,525 INFO L87 Difference]: Start difference. First operand 12755 states and 40342 transitions. Second operand 3 states. [2019-12-18 15:08:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:42,624 INFO L93 Difference]: Finished difference Result 15529 states and 48523 transitions. [2019-12-18 15:08:42,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:42,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 15:08:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:42,657 INFO L225 Difference]: With dead ends: 15529 [2019-12-18 15:08:42,658 INFO L226 Difference]: Without dead ends: 15529 [2019-12-18 15:08:42,658 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 15:08:42,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-12-18 15:08:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 13746. [2019-12-18 15:08:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13746 states. [2019-12-18 15:08:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13746 states to 13746 states and 43375 transitions. [2019-12-18 15:08:43,251 INFO L78 Accepts]: Start accepts. Automaton has 13746 states and 43375 transitions. Word has length 25 [2019-12-18 15:08:43,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:43,253 INFO L462 AbstractCegarLoop]: Abstraction has 13746 states and 43375 transitions. [2019-12-18 15:08:43,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 13746 states and 43375 transitions. [2019-12-18 15:08:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:08:43,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:43,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:43,270 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:43,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:43,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1248228747, now seen corresponding path program 1 times [2019-12-18 15:08:43,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:43,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848916243] [2019-12-18 15:08:43,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:43,431 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 15:08:43,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848916243] [2019-12-18 15:08:43,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:43,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:08:43,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485226135] [2019-12-18 15:08:43,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:08:43,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:43,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:08:43,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:08:43,434 INFO L87 Difference]: Start difference. First operand 13746 states and 43375 transitions. Second operand 6 states. [2019-12-18 15:08:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:43,937 INFO L93 Difference]: Finished difference Result 19657 states and 60760 transitions. [2019-12-18 15:08:43,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:08:43,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 15:08:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:43,978 INFO L225 Difference]: With dead ends: 19657 [2019-12-18 15:08:43,978 INFO L226 Difference]: Without dead ends: 19641 [2019-12-18 15:08:43,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:08:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19641 states. [2019-12-18 15:08:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19641 to 15905. [2019-12-18 15:08:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15905 states. [2019-12-18 15:08:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15905 states to 15905 states and 49859 transitions. [2019-12-18 15:08:45,102 INFO L78 Accepts]: Start accepts. Automaton has 15905 states and 49859 transitions. Word has length 25 [2019-12-18 15:08:45,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:45,102 INFO L462 AbstractCegarLoop]: Abstraction has 15905 states and 49859 transitions. [2019-12-18 15:08:45,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:08:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 15905 states and 49859 transitions. [2019-12-18 15:08:45,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 15:08:45,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:45,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:45,130 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:45,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:45,131 INFO L82 PathProgramCache]: Analyzing trace with hash 279625016, now seen corresponding path program 1 times [2019-12-18 15:08:45,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:45,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519499057] [2019-12-18 15:08:45,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:45,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519499057] [2019-12-18 15:08:45,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:45,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:08:45,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664948058] [2019-12-18 15:08:45,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:08:45,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:45,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:08:45,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:08:45,213 INFO L87 Difference]: Start difference. First operand 15905 states and 49859 transitions. Second operand 4 states. [2019-12-18 15:08:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:45,247 INFO L93 Difference]: Finished difference Result 2247 states and 5122 transitions. [2019-12-18 15:08:45,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:08:45,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-18 15:08:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:45,251 INFO L225 Difference]: With dead ends: 2247 [2019-12-18 15:08:45,252 INFO L226 Difference]: Without dead ends: 1970 [2019-12-18 15:08:45,252 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 15:08:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-12-18 15:08:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1970. [2019-12-18 15:08:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2019-12-18 15:08:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 4356 transitions. [2019-12-18 15:08:45,289 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 4356 transitions. Word has length 31 [2019-12-18 15:08:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:45,289 INFO L462 AbstractCegarLoop]: Abstraction has 1970 states and 4356 transitions. [2019-12-18 15:08:45,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:08:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 4356 transitions. [2019-12-18 15:08:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 15:08:45,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:45,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:45,294 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:45,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:45,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623832, now seen corresponding path program 1 times [2019-12-18 15:08:45,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:45,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043557256] [2019-12-18 15:08:45,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:45,601 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 15:08:45,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043557256] [2019-12-18 15:08:45,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:45,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:08:45,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532417187] [2019-12-18 15:08:45,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:08:45,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:45,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:08:45,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:08:45,603 INFO L87 Difference]: Start difference. First operand 1970 states and 4356 transitions. Second operand 9 states. [2019-12-18 15:08:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:46,133 INFO L93 Difference]: Finished difference Result 2561 states and 5544 transitions. [2019-12-18 15:08:46,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:08:46,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-18 15:08:46,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:46,137 INFO L225 Difference]: With dead ends: 2561 [2019-12-18 15:08:46,138 INFO L226 Difference]: Without dead ends: 2559 [2019-12-18 15:08:46,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:08:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2019-12-18 15:08:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2033. [2019-12-18 15:08:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2019-12-18 15:08:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 4500 transitions. [2019-12-18 15:08:46,272 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 4500 transitions. Word has length 37 [2019-12-18 15:08:46,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:46,273 INFO L462 AbstractCegarLoop]: Abstraction has 2033 states and 4500 transitions. [2019-12-18 15:08:46,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:08:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 4500 transitions. [2019-12-18 15:08:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 15:08:46,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:46,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:46,277 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:46,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:46,278 INFO L82 PathProgramCache]: Analyzing trace with hash -669150451, now seen corresponding path program 1 times [2019-12-18 15:08:46,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:46,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989854177] [2019-12-18 15:08:46,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:46,351 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 15:08:46,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989854177] [2019-12-18 15:08:46,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:46,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:08:46,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865667919] [2019-12-18 15:08:46,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:08:46,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:46,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:08:46,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:46,354 INFO L87 Difference]: Start difference. First operand 2033 states and 4500 transitions. Second operand 5 states. [2019-12-18 15:08:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:46,843 INFO L93 Difference]: Finished difference Result 2780 states and 6027 transitions. [2019-12-18 15:08:46,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:08:46,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 15:08:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:46,848 INFO L225 Difference]: With dead ends: 2780 [2019-12-18 15:08:46,848 INFO L226 Difference]: Without dead ends: 2780 [2019-12-18 15:08:46,848 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 15:08:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2019-12-18 15:08:46,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2441. [2019-12-18 15:08:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2019-12-18 15:08:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 5347 transitions. [2019-12-18 15:08:46,886 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 5347 transitions. Word has length 41 [2019-12-18 15:08:46,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:46,886 INFO L462 AbstractCegarLoop]: Abstraction has 2441 states and 5347 transitions. [2019-12-18 15:08:46,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:08:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 5347 transitions. [2019-12-18 15:08:46,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 15:08:46,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:46,891 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] [2019-12-18 15:08:46,891 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:46,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:46,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1265386816, now seen corresponding path program 1 times [2019-12-18 15:08:46,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:46,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044071331] [2019-12-18 15:08:46,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:46,963 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 15:08:46,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044071331] [2019-12-18 15:08:46,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:46,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:46,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461635525] [2019-12-18 15:08:46,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:46,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:46,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:46,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:46,965 INFO L87 Difference]: Start difference. First operand 2441 states and 5347 transitions. Second operand 3 states. [2019-12-18 15:08:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:46,983 INFO L93 Difference]: Finished difference Result 2372 states and 5134 transitions. [2019-12-18 15:08:46,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:46,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 15:08:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:46,986 INFO L225 Difference]: With dead ends: 2372 [2019-12-18 15:08:46,986 INFO L226 Difference]: Without dead ends: 2372 [2019-12-18 15:08:46,987 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 15:08:46,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2019-12-18 15:08:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2364. [2019-12-18 15:08:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-12-18 15:08:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 5118 transitions. [2019-12-18 15:08:47,018 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 5118 transitions. Word has length 42 [2019-12-18 15:08:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:47,019 INFO L462 AbstractCegarLoop]: Abstraction has 2364 states and 5118 transitions. [2019-12-18 15:08:47,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 5118 transitions. [2019-12-18 15:08:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 15:08:47,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:47,023 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] [2019-12-18 15:08:47,024 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:47,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1349071825, now seen corresponding path program 1 times [2019-12-18 15:08:47,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:47,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618580984] [2019-12-18 15:08:47,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:47,137 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 15:08:47,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618580984] [2019-12-18 15:08:47,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:47,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:08:47,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047091481] [2019-12-18 15:08:47,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:08:47,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:47,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:08:47,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:08:47,139 INFO L87 Difference]: Start difference. First operand 2364 states and 5118 transitions. Second operand 6 states. [2019-12-18 15:08:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:47,299 INFO L93 Difference]: Finished difference Result 4111 states and 8951 transitions. [2019-12-18 15:08:47,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:08:47,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 15:08:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:47,303 INFO L225 Difference]: With dead ends: 4111 [2019-12-18 15:08:47,303 INFO L226 Difference]: Without dead ends: 2004 [2019-12-18 15:08:47,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:08:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2019-12-18 15:08:47,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1858. [2019-12-18 15:08:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2019-12-18 15:08:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 3980 transitions. [2019-12-18 15:08:47,331 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 3980 transitions. Word has length 42 [2019-12-18 15:08:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:47,332 INFO L462 AbstractCegarLoop]: Abstraction has 1858 states and 3980 transitions. [2019-12-18 15:08:47,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:08:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 3980 transitions. [2019-12-18 15:08:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 15:08:47,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:47,335 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] [2019-12-18 15:08:47,336 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:47,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:47,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1852418777, now seen corresponding path program 1 times [2019-12-18 15:08:47,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:47,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743224850] [2019-12-18 15:08:47,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:47,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743224850] [2019-12-18 15:08:48,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:48,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:08:48,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318175693] [2019-12-18 15:08:48,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:08:48,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:48,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:08:48,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:08:48,001 INFO L87 Difference]: Start difference. First operand 1858 states and 3980 transitions. Second operand 16 states. [2019-12-18 15:08:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:49,337 INFO L93 Difference]: Finished difference Result 2644 states and 5622 transitions. [2019-12-18 15:08:49,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:08:49,338 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-12-18 15:08:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:49,342 INFO L225 Difference]: With dead ends: 2644 [2019-12-18 15:08:49,342 INFO L226 Difference]: Without dead ends: 2108 [2019-12-18 15:08:49,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:08:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2019-12-18 15:08:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1879. [2019-12-18 15:08:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1879 states. [2019-12-18 15:08:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 4000 transitions. [2019-12-18 15:08:49,369 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 4000 transitions. Word has length 43 [2019-12-18 15:08:49,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:49,369 INFO L462 AbstractCegarLoop]: Abstraction has 1879 states and 4000 transitions. [2019-12-18 15:08:49,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:08:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 4000 transitions. [2019-12-18 15:08:49,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 15:08:49,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:49,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:49,373 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:49,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:49,374 INFO L82 PathProgramCache]: Analyzing trace with hash 588171772, now seen corresponding path program 1 times [2019-12-18 15:08:49,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:49,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408252771] [2019-12-18 15:08:49,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:49,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408252771] [2019-12-18 15:08:49,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:49,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:49,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006594986] [2019-12-18 15:08:49,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:49,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:49,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:49,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:49,426 INFO L87 Difference]: Start difference. First operand 1879 states and 4000 transitions. Second operand 3 states. [2019-12-18 15:08:49,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:49,473 INFO L93 Difference]: Finished difference Result 1852 states and 3919 transitions. [2019-12-18 15:08:49,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:49,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-18 15:08:49,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:49,477 INFO L225 Difference]: With dead ends: 1852 [2019-12-18 15:08:49,477 INFO L226 Difference]: Without dead ends: 1852 [2019-12-18 15:08:49,478 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 15:08:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2019-12-18 15:08:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1744. [2019-12-18 15:08:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2019-12-18 15:08:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 3707 transitions. [2019-12-18 15:08:49,504 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 3707 transitions. Word has length 43 [2019-12-18 15:08:49,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:49,505 INFO L462 AbstractCegarLoop]: Abstraction has 1744 states and 3707 transitions. [2019-12-18 15:08:49,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:49,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 3707 transitions. [2019-12-18 15:08:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 15:08:49,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:49,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:49,508 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:49,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1100018745, now seen corresponding path program 1 times [2019-12-18 15:08:49,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:49,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235016514] [2019-12-18 15:08:49,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:49,658 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 15:08:49,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235016514] [2019-12-18 15:08:49,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:49,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:08:49,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049324114] [2019-12-18 15:08:49,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:08:49,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:49,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:08:49,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:08:49,660 INFO L87 Difference]: Start difference. First operand 1744 states and 3707 transitions. Second operand 11 states. [2019-12-18 15:08:50,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:50,020 INFO L93 Difference]: Finished difference Result 2343 states and 5003 transitions. [2019-12-18 15:08:50,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:08:50,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2019-12-18 15:08:50,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:50,023 INFO L225 Difference]: With dead ends: 2343 [2019-12-18 15:08:50,023 INFO L226 Difference]: Without dead ends: 2028 [2019-12-18 15:08:50,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:08:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2019-12-18 15:08:50,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1873. [2019-12-18 15:08:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-12-18 15:08:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3955 transitions. [2019-12-18 15:08:50,051 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3955 transitions. Word has length 43 [2019-12-18 15:08:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:50,053 INFO L462 AbstractCegarLoop]: Abstraction has 1873 states and 3955 transitions. [2019-12-18 15:08:50,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:08:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3955 transitions. [2019-12-18 15:08:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 15:08:50,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:50,056 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] [2019-12-18 15:08:50,056 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:50,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:50,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1883094395, now seen corresponding path program 2 times [2019-12-18 15:08:50,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:50,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118187503] [2019-12-18 15:08:50,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:50,120 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 15:08:50,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118187503] [2019-12-18 15:08:50,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:50,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:08:50,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34026380] [2019-12-18 15:08:50,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:08:50,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:50,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:08:50,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:50,122 INFO L87 Difference]: Start difference. First operand 1873 states and 3955 transitions. Second operand 5 states. [2019-12-18 15:08:50,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:50,156 INFO L93 Difference]: Finished difference Result 365 states and 643 transitions. [2019-12-18 15:08:50,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:08:50,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-18 15:08:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:50,158 INFO L225 Difference]: With dead ends: 365 [2019-12-18 15:08:50,158 INFO L226 Difference]: Without dead ends: 294 [2019-12-18 15:08:50,158 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 15:08:50,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-18 15:08:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 219. [2019-12-18 15:08:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-18 15:08:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 389 transitions. [2019-12-18 15:08:50,162 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 389 transitions. Word has length 43 [2019-12-18 15:08:50,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:50,162 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 389 transitions. [2019-12-18 15:08:50,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:08:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 389 transitions. [2019-12-18 15:08:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:08:50,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:50,163 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 15:08:50,163 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:50,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:50,164 INFO L82 PathProgramCache]: Analyzing trace with hash 133727006, now seen corresponding path program 1 times [2019-12-18 15:08:50,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:50,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092314122] [2019-12-18 15:08:50,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:50,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092314122] [2019-12-18 15:08:50,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:50,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:08:50,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834947044] [2019-12-18 15:08:50,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:08:50,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:50,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:08:50,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:08:50,392 INFO L87 Difference]: Start difference. First operand 219 states and 389 transitions. Second operand 13 states. [2019-12-18 15:08:50,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:50,942 INFO L93 Difference]: Finished difference Result 384 states and 661 transitions. [2019-12-18 15:08:50,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:08:50,943 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 15:08:50,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:50,944 INFO L225 Difference]: With dead ends: 384 [2019-12-18 15:08:50,944 INFO L226 Difference]: Without dead ends: 353 [2019-12-18 15:08:50,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:08:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-12-18 15:08:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 319. [2019-12-18 15:08:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-18 15:08:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 560 transitions. [2019-12-18 15:08:50,949 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 560 transitions. Word has length 54 [2019-12-18 15:08:50,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:50,949 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 560 transitions. [2019-12-18 15:08:50,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:08:50,949 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 560 transitions. [2019-12-18 15:08:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:08:50,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:50,950 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 15:08:50,950 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:50,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:50,951 INFO L82 PathProgramCache]: Analyzing trace with hash 815200260, now seen corresponding path program 2 times [2019-12-18 15:08:50,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:50,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730206740] [2019-12-18 15:08:50,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:51,310 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 15:08:51,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730206740] [2019-12-18 15:08:51,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:51,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:08:51,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510570665] [2019-12-18 15:08:51,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:08:51,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:51,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:08:51,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:08:51,313 INFO L87 Difference]: Start difference. First operand 319 states and 560 transitions. Second operand 12 states. [2019-12-18 15:08:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:51,759 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2019-12-18 15:08:51,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:08:51,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 15:08:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:51,760 INFO L225 Difference]: With dead ends: 420 [2019-12-18 15:08:51,761 INFO L226 Difference]: Without dead ends: 389 [2019-12-18 15:08:51,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:08:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-12-18 15:08:51,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 327. [2019-12-18 15:08:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-18 15:08:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 574 transitions. [2019-12-18 15:08:51,766 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 574 transitions. Word has length 54 [2019-12-18 15:08:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:51,767 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 574 transitions. [2019-12-18 15:08:51,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:08:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 574 transitions. [2019-12-18 15:08:51,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:08:51,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:51,768 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 15:08:51,768 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:51,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:51,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2067211286, now seen corresponding path program 3 times [2019-12-18 15:08:51,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:51,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976974280] [2019-12-18 15:08:51,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:08:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:08:51,866 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:08:51,866 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:08:51,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2473~0.base_19|) (= 0 v_~__unbuffered_cnt~0_61) (= v_~weak$$choice2~0_132 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_444 0) (= v_~y$r_buff1_thd0~0_304 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19|) 0) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff0_thd0~0_394 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19| 1)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19|) |v_ULTIMATE.start_main_~#t2473~0.offset_16| 0))) (= 0 v_~y$w_buff0~0_376) (= 0 |v_#NULL.base_6|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| 4)) (= v_~y$r_buff1_thd1~0_220 0) (= v_~y~0_141 0) (= v_~y$r_buff0_thd1~0_301 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~y$flush_delayed~0_48) (= 0 v_~y$r_buff0_thd2~0_175) (= v_~y$w_buff1~0_254 0) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff0_used~0_753 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_205) (= 0 |v_ULTIMATE.start_main_~#t2473~0.offset_16|) (= 0 v_~x~0_168) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ULTIMATE.start_main_~#t2473~0.base=|v_ULTIMATE.start_main_~#t2473~0.base_19|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_32|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_56|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_301, ~y$flush_delayed~0=v_~y$flush_delayed~0_48, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_45|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t2473~0.offset=|v_ULTIMATE.start_main_~#t2473~0.offset_16|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_304, ~x~0=v_~x~0_168, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_753, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_28|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_220, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_39|, ~y$w_buff0~0=v_~y$w_buff0~0_376, ~y~0=v_~y~0_141, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_30|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_44|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_26|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_19|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_37|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_28|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_394, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_13|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2473~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2474~0.offset, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2473~0.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:08:51,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L777-1-->L779: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11|) |v_ULTIMATE.start_main_~#t2474~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t2474~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2474~0.base_11|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2474~0.offset] because there is no mapped edge [2019-12-18 15:08:51,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= 2 v_~y$w_buff0~0_172) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_P0Thread1of1ForFork0_~arg.offset_79 |v_P0Thread1of1ForFork0_#in~arg.offset_79|) (= v_~y$w_buff0_used~0_290 1) (= 0 (mod v_~y$w_buff1_used~0_162 256)) (= v_P0Thread1of1ForFork0_~arg.base_79 |v_P0Thread1of1ForFork0_#in~arg.base_79|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_~y$w_buff0_used~0_291 v_~y$w_buff1_used~0_162) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_173)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_291, ~y$w_buff0~0=v_~y$w_buff0~0_173, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_290, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_172, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_79, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_162} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:08:51,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1753178284 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1753178284 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1753178284| ~y$w_buff0_used~0_In1753178284)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1753178284| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1753178284, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1753178284} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1753178284|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1753178284, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1753178284} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 15:08:51,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In1410780472 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1410780472 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out1410780472| ~y$w_buff1~0_In1410780472) (not .cse0) (not .cse1)) (and (= ~y~0_In1410780472 |P1Thread1of1ForFork1_#t~ite9_Out1410780472|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1410780472, ~y$w_buff1~0=~y$w_buff1~0_In1410780472, ~y~0=~y~0_In1410780472, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1410780472} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1410780472, ~y$w_buff1~0=~y$w_buff1~0_In1410780472, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1410780472|, ~y~0=~y~0_In1410780472, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1410780472} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 15:08:51,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= v_~y~0_50 |v_P1Thread1of1ForFork1_#t~ite9_14|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_14|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_13|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 15:08:51,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-749072132 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-749072132 256) 0))) (or (and (= ~y$w_buff0_used~0_In-749072132 |P1Thread1of1ForFork1_#t~ite11_Out-749072132|) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-749072132| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-749072132, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-749072132} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-749072132, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-749072132, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-749072132|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 15:08:51,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In1077039196 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1077039196 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1077039196 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In1077039196 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out1077039196| ~y$w_buff1_used~0_In1077039196) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1077039196| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1077039196, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1077039196, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1077039196, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1077039196} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1077039196|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1077039196, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1077039196, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1077039196, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1077039196} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 15:08:51,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In339277575 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In339277575 256)))) (or (and (= 0 ~y$r_buff0_thd1~0_Out339277575) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In339277575 ~y$r_buff0_thd1~0_Out339277575) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In339277575, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In339277575} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In339277575, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out339277575|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out339277575} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 15:08:51,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1842798617 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1842798617 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1842798617 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1842798617 256) 0))) (or (and (= ~y$w_buff1_used~0_In-1842798617 |P1Thread1of1ForFork1_#t~ite12_Out-1842798617|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite12_Out-1842798617| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1842798617, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1842798617, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1842798617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1842798617} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1842798617, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1842798617, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1842798617, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1842798617|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1842798617} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 15:08:51,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-948867710 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-948867710 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-948867710| ~y$r_buff0_thd2~0_In-948867710)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-948867710| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-948867710, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-948867710} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-948867710, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-948867710, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-948867710|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 15:08:51,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-171956830 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-171956830 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-171956830 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-171956830 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-171956830|)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out-171956830| ~y$r_buff1_thd2~0_In-171956830) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-171956830, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-171956830, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-171956830, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-171956830} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-171956830, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-171956830, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-171956830, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-171956830|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-171956830} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 15:08:51,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_34| v_~y$r_buff1_thd2~0_85) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_85, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 15:08:51,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1351248524 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1351248524 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In1351248524 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1351248524 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1351248524|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In1351248524 |P0Thread1of1ForFork0_#t~ite8_Out1351248524|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1351248524, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1351248524, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1351248524, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1351248524} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1351248524, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1351248524, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1351248524|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1351248524, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1351248524} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 15:08:51,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L738-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 15:08:51,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_159 256) 0) (= (mod v_~y$r_buff0_thd0~0_61 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 15:08:51,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-861644888 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-861644888 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-861644888| ~y$w_buff1~0_In-861644888)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite17_Out-861644888| ~y~0_In-861644888)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-861644888, ~y~0=~y~0_In-861644888, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-861644888, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-861644888} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-861644888|, ~y$w_buff1~0=~y$w_buff1~0_In-861644888, ~y~0=~y~0_In-861644888, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-861644888, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-861644888} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 15:08:51,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_46 |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_8|, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-18 15:08:51,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-187166555 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-187166555 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-187166555| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-187166555 |ULTIMATE.start_main_#t~ite19_Out-187166555|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-187166555, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-187166555} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-187166555, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-187166555|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-187166555} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 15:08:51,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In75626274 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In75626274 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In75626274 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In75626274 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out75626274| ~y$w_buff1_used~0_In75626274) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out75626274|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In75626274, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In75626274, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In75626274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In75626274} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In75626274, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In75626274, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out75626274|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In75626274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In75626274} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 15:08:51,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-179698275 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-179698275 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-179698275| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out-179698275| ~y$r_buff0_thd0~0_In-179698275) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-179698275, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-179698275} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-179698275, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-179698275, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-179698275|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 15:08:51,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In850536424 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In850536424 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In850536424 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In850536424 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out850536424| ~y$r_buff1_thd0~0_In850536424)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite22_Out850536424| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In850536424, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In850536424, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In850536424, ~y$w_buff1_used~0=~y$w_buff1_used~0_In850536424} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In850536424, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In850536424, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In850536424, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out850536424|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In850536424} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 15:08:51,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L799-->L799-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2128573414 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2128573414 256)))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In-2128573414 256)) .cse0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-2128573414 256))) (= 0 (mod ~y$w_buff0_used~0_In-2128573414 256)))) (= |ULTIMATE.start_main_#t~ite34_Out-2128573414| ~y$w_buff0_used~0_In-2128573414) .cse1 (= |ULTIMATE.start_main_#t~ite35_Out-2128573414| |ULTIMATE.start_main_#t~ite34_Out-2128573414|)) (and (= |ULTIMATE.start_main_#t~ite35_Out-2128573414| ~y$w_buff0_used~0_In-2128573414) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_In-2128573414| |ULTIMATE.start_main_#t~ite34_Out-2128573414|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2128573414, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2128573414, ~weak$$choice2~0=~weak$$choice2~0_In-2128573414, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2128573414, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2128573414, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In-2128573414|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2128573414, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2128573414, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-2128573414|, ~weak$$choice2~0=~weak$$choice2~0_In-2128573414, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2128573414, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-2128573414|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2128573414} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 15:08:51,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (= v_~y$r_buff0_thd0~0_72 v_~y$r_buff0_thd0~0_71) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 15:08:51,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L804-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_21) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (not (= 0 (mod v_~y$flush_delayed~0_36 256))) (= 0 v_~y$flush_delayed~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y~0=v_~y~0_99, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 15:08:51,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 15:08:51,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:08:51 BasicIcfg [2019-12-18 15:08:51,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:08:51,993 INFO L168 Benchmark]: Toolchain (without parser) took 21281.01 ms. Allocated memory was 146.8 MB in the beginning and 827.9 MB in the end (delta: 681.1 MB). Free memory was 103.2 MB in the beginning and 569.6 MB in the end (delta: -466.4 MB). Peak memory consumption was 214.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:51,994 INFO L168 Benchmark]: CDTParser took 1.34 ms. Allocated memory is still 146.8 MB. Free memory is still 122.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 15:08:51,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.97 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 102.8 MB in the beginning and 159.8 MB in the end (delta: -57.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:51,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.48 ms. Allocated memory is still 205.0 MB. Free memory was 159.8 MB in the beginning and 156.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:51,998 INFO L168 Benchmark]: Boogie Preprocessor took 34.01 ms. Allocated memory is still 205.0 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:51,999 INFO L168 Benchmark]: RCFGBuilder took 753.59 ms. Allocated memory is still 205.0 MB. Free memory was 154.0 MB in the beginning and 110.1 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:51,999 INFO L168 Benchmark]: TraceAbstraction took 19704.84 ms. Allocated memory was 205.0 MB in the beginning and 827.9 MB in the end (delta: 622.9 MB). Free memory was 110.1 MB in the beginning and 569.6 MB in the end (delta: -459.4 MB). Peak memory consumption was 163.4 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:52,009 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34 ms. Allocated memory is still 146.8 MB. Free memory is still 122.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 714.97 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 102.8 MB in the beginning and 159.8 MB in the end (delta: -57.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.48 ms. Allocated memory is still 205.0 MB. Free memory was 159.8 MB in the beginning and 156.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.01 ms. Allocated memory is still 205.0 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 753.59 ms. Allocated memory is still 205.0 MB. Free memory was 154.0 MB in the beginning and 110.1 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19704.84 ms. Allocated memory was 205.0 MB in the beginning and 827.9 MB in the end (delta: 622.9 MB). Free memory was 110.1 MB in the beginning and 569.6 MB in the end (delta: -459.4 MB). Peak memory consumption was 163.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 145 ProgramPointsBefore, 78 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3579 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 46212 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2271 SDtfs, 2433 SDslu, 6449 SDs, 0 SdLazy, 3849 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 17 SyntacticMatches, 15 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15905occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 14269 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 619 NumberOfCodeBlocks, 619 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 548 ConstructedInterpolants, 0 QuantifiedInterpolants, 118906 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...