/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_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:08:35,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:08:35,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:08:35,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:08:35,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:08:35,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:08:35,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:08:35,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:08:35,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:08:35,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:08:35,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:08:35,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:08:35,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:08:35,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:08:35,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:08:35,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:08:35,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:08:35,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:08:35,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:08:35,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:08:35,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:08:35,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:08:35,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:08:35,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:08:35,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:08:35,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:08:35,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:08:35,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:08:35,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:08:35,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:08:35,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:08:35,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:08:35,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:08:35,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:08:35,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:08:35,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:08:35,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:08:35,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:08:35,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:08:35,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:08:35,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:08:35,257 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:35,271 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:08:35,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:08:35,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:08:35,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:08:35,273 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:08:35,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:08:35,273 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:08:35,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:08:35,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:08:35,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:08:35,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:08:35,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:08:35,275 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:08:35,275 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:08:35,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:08:35,275 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:08:35,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:08:35,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:08:35,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:08:35,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:08:35,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:08:35,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:08:35,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:08:35,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:08:35,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:08:35,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:08:35,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:08:35,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:08:35,278 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:08:35,278 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:08:35,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:08:35,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:08:35,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:08:35,583 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:08:35,583 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:08:35,584 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2019-12-18 15:08:35,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1455eecd/cdf70a3009da4ef885f393e71a244302/FLAG7482c124b [2019-12-18 15:08:36,226 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:08:36,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2019-12-18 15:08:36,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1455eecd/cdf70a3009da4ef885f393e71a244302/FLAG7482c124b [2019-12-18 15:08:36,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1455eecd/cdf70a3009da4ef885f393e71a244302 [2019-12-18 15:08:36,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:08:36,505 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:08:36,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:08:36,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:08:36,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:08:36,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:08:36" (1/1) ... [2019-12-18 15:08:36,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d76d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:36, skipping insertion in model container [2019-12-18 15:08:36,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:08:36" (1/1) ... [2019-12-18 15:08:36,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:08:36,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:08:37,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:08:37,104 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:08:37,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:08:37,264 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:08:37,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:37 WrapperNode [2019-12-18 15:08:37,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:08:37,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:08:37,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:08:37,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:08:37,275 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:37" (1/1) ... [2019-12-18 15:08:37,295 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:37" (1/1) ... [2019-12-18 15:08:37,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:08:37,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:08:37,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:08:37,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:08:37,345 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:37" (1/1) ... [2019-12-18 15:08:37,345 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:37" (1/1) ... [2019-12-18 15:08:37,349 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:37" (1/1) ... [2019-12-18 15:08:37,350 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:37" (1/1) ... [2019-12-18 15:08:37,359 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:37" (1/1) ... [2019-12-18 15:08:37,363 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:37" (1/1) ... [2019-12-18 15:08:37,367 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:37" (1/1) ... [2019-12-18 15:08:37,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:08:37,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:08:37,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:08:37,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:08:37,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:37" (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:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:08:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:08:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:08:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:08:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:08:37,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:08:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:08:37,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:08:37,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:08:37,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:08:37,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:08:37,445 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:38,150 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:08:38,150 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:08:38,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:08:38 BoogieIcfgContainer [2019-12-18 15:08:38,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:08:38,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:08:38,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:08:38,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:08:38,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:08:36" (1/3) ... [2019-12-18 15:08:38,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21615ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:08:38, skipping insertion in model container [2019-12-18 15:08:38,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:37" (2/3) ... [2019-12-18 15:08:38,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21615ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:08:38, skipping insertion in model container [2019-12-18 15:08:38,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:08:38" (3/3) ... [2019-12-18 15:08:38,166 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2019-12-18 15:08:38,177 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:08:38,178 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:08:38,190 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:08:38,191 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:08:38,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,261 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,261 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,279 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,280 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,284 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,284 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:38,305 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 15:08:38,330 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:08:38,330 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:08:38,330 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:08:38,330 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:08:38,330 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:08:38,331 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:08:38,331 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:08:38,331 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:08:38,357 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-18 15:08:38,360 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 15:08:38,486 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 15:08:38,486 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:08:38,499 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 253 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 15:08:38,516 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 15:08:38,554 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 15:08:38,554 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:08:38,560 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 253 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 15:08:38,573 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 15:08:38,574 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:08:42,944 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-18 15:08:43,067 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47380 [2019-12-18 15:08:43,068 INFO L214 etLargeBlockEncoding]: Total number of compositions: 96 [2019-12-18 15:08:43,072 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-18 15:08:43,524 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8608 states. [2019-12-18 15:08:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states. [2019-12-18 15:08:43,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 15:08:43,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:43,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 15:08:43,534 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:43,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:43,540 INFO L82 PathProgramCache]: Analyzing trace with hash 689103523, now seen corresponding path program 1 times [2019-12-18 15:08:43,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:43,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580769494] [2019-12-18 15:08:43,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:43,800 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,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580769494] [2019-12-18 15:08:43,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:43,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:08:43,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258204962] [2019-12-18 15:08:43,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:43,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:43,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:43,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:43,828 INFO L87 Difference]: Start difference. First operand 8608 states. Second operand 3 states. [2019-12-18 15:08:44,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:44,058 INFO L93 Difference]: Finished difference Result 8560 states and 27962 transitions. [2019-12-18 15:08:44,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:44,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 15:08:44,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:44,249 INFO L225 Difference]: With dead ends: 8560 [2019-12-18 15:08:44,249 INFO L226 Difference]: Without dead ends: 8391 [2019-12-18 15:08:44,251 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:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2019-12-18 15:08:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 8391. [2019-12-18 15:08:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8391 states. [2019-12-18 15:08:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 27442 transitions. [2019-12-18 15:08:44,669 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 27442 transitions. Word has length 5 [2019-12-18 15:08:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:44,669 INFO L462 AbstractCegarLoop]: Abstraction has 8391 states and 27442 transitions. [2019-12-18 15:08:44,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 27442 transitions. [2019-12-18 15:08:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 15:08:44,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:44,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:44,673 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:44,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:44,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1296433146, now seen corresponding path program 1 times [2019-12-18 15:08:44,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:44,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795662662] [2019-12-18 15:08:44,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:44,816 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:44,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795662662] [2019-12-18 15:08:44,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:44,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:44,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991528407] [2019-12-18 15:08:44,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:08:44,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:44,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:08:44,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:08:44,820 INFO L87 Difference]: Start difference. First operand 8391 states and 27442 transitions. Second operand 4 states. [2019-12-18 15:08:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:45,308 INFO L93 Difference]: Finished difference Result 13399 states and 41962 transitions. [2019-12-18 15:08:45,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:08:45,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 15:08:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:45,399 INFO L225 Difference]: With dead ends: 13399 [2019-12-18 15:08:45,399 INFO L226 Difference]: Without dead ends: 13392 [2019-12-18 15:08:45,400 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:46,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2019-12-18 15:08:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 11787. [2019-12-18 15:08:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11787 states. [2019-12-18 15:08:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11787 states to 11787 states and 37494 transitions. [2019-12-18 15:08:46,491 INFO L78 Accepts]: Start accepts. Automaton has 11787 states and 37494 transitions. Word has length 11 [2019-12-18 15:08:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:46,492 INFO L462 AbstractCegarLoop]: Abstraction has 11787 states and 37494 transitions. [2019-12-18 15:08:46,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:08:46,492 INFO L276 IsEmpty]: Start isEmpty. Operand 11787 states and 37494 transitions. [2019-12-18 15:08:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 15:08:46,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:46,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:46,502 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:46,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:46,502 INFO L82 PathProgramCache]: Analyzing trace with hash 825675890, now seen corresponding path program 1 times [2019-12-18 15:08:46,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:46,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994990335] [2019-12-18 15:08:46,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:46,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994990335] [2019-12-18 15:08:46,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:46,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:46,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523062271] [2019-12-18 15:08:46,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:08:46,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:46,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:08:46,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:08:46,585 INFO L87 Difference]: Start difference. First operand 11787 states and 37494 transitions. Second operand 4 states. [2019-12-18 15:08:46,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:46,855 INFO L93 Difference]: Finished difference Result 14846 states and 46774 transitions. [2019-12-18 15:08:46,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:08:46,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 15:08:46,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:46,907 INFO L225 Difference]: With dead ends: 14846 [2019-12-18 15:08:46,907 INFO L226 Difference]: Without dead ends: 14846 [2019-12-18 15:08:46,908 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:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14846 states. [2019-12-18 15:08:47,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14846 to 13070. [2019-12-18 15:08:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13070 states. [2019-12-18 15:08:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13070 states to 13070 states and 41519 transitions. [2019-12-18 15:08:47,489 INFO L78 Accepts]: Start accepts. Automaton has 13070 states and 41519 transitions. Word has length 11 [2019-12-18 15:08:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:47,489 INFO L462 AbstractCegarLoop]: Abstraction has 13070 states and 41519 transitions. [2019-12-18 15:08:47,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:08:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 13070 states and 41519 transitions. [2019-12-18 15:08:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:08:47,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:47,494 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:47,495 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:47,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:47,495 INFO L82 PathProgramCache]: Analyzing trace with hash 727521173, now seen corresponding path program 1 times [2019-12-18 15:08:47,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:47,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483632614] [2019-12-18 15:08:47,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:47,674 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,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483632614] [2019-12-18 15:08:47,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:47,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:08:47,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314606011] [2019-12-18 15:08:47,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:08:47,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:47,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:08:47,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:47,678 INFO L87 Difference]: Start difference. First operand 13070 states and 41519 transitions. Second operand 5 states. [2019-12-18 15:08:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:48,231 INFO L93 Difference]: Finished difference Result 17840 states and 55421 transitions. [2019-12-18 15:08:48,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:08:48,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 15:08:48,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:48,282 INFO L225 Difference]: With dead ends: 17840 [2019-12-18 15:08:48,282 INFO L226 Difference]: Without dead ends: 17833 [2019-12-18 15:08:48,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 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:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17833 states. [2019-12-18 15:08:48,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17833 to 13112. [2019-12-18 15:08:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13112 states. [2019-12-18 15:08:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13112 states to 13112 states and 41511 transitions. [2019-12-18 15:08:48,883 INFO L78 Accepts]: Start accepts. Automaton has 13112 states and 41511 transitions. Word has length 17 [2019-12-18 15:08:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:48,883 INFO L462 AbstractCegarLoop]: Abstraction has 13112 states and 41511 transitions. [2019-12-18 15:08:48,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:08:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 13112 states and 41511 transitions. [2019-12-18 15:08:48,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:08:48,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:48,896 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:48,896 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:48,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:48,896 INFO L82 PathProgramCache]: Analyzing trace with hash -569311522, now seen corresponding path program 1 times [2019-12-18 15:08:48,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:48,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104503234] [2019-12-18 15:08:48,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:48,935 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:48,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104503234] [2019-12-18 15:08:48,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:48,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:08:48,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188938193] [2019-12-18 15:08:48,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:48,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:48,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:48,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:48,937 INFO L87 Difference]: Start difference. First operand 13112 states and 41511 transitions. Second operand 3 states. [2019-12-18 15:08:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:49,077 INFO L93 Difference]: Finished difference Result 15933 states and 49812 transitions. [2019-12-18 15:08:49,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:49,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 15:08:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:49,124 INFO L225 Difference]: With dead ends: 15933 [2019-12-18 15:08:49,125 INFO L226 Difference]: Without dead ends: 15933 [2019-12-18 15:08:49,125 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:49,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15933 states. [2019-12-18 15:08:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15933 to 14126. [2019-12-18 15:08:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-12-18 15:08:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 44593 transitions. [2019-12-18 15:08:50,219 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 44593 transitions. Word has length 25 [2019-12-18 15:08:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:50,221 INFO L462 AbstractCegarLoop]: Abstraction has 14126 states and 44593 transitions. [2019-12-18 15:08:50,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 44593 transitions. [2019-12-18 15:08:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:08:50,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:50,234 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:50,235 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:50,235 INFO L82 PathProgramCache]: Analyzing trace with hash -569496623, now seen corresponding path program 1 times [2019-12-18 15:08:50,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:50,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940185272] [2019-12-18 15:08:50,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:50,294 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,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940185272] [2019-12-18 15:08:50,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:50,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:08:50,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477373221] [2019-12-18 15:08:50,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:08:50,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:50,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:08:50,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:08:50,296 INFO L87 Difference]: Start difference. First operand 14126 states and 44593 transitions. Second operand 4 states. [2019-12-18 15:08:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:50,332 INFO L93 Difference]: Finished difference Result 2310 states and 5267 transitions. [2019-12-18 15:08:50,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:08:50,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 15:08:50,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:50,337 INFO L225 Difference]: With dead ends: 2310 [2019-12-18 15:08:50,338 INFO L226 Difference]: Without dead ends: 2024 [2019-12-18 15:08:50,338 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:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2019-12-18 15:08:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 2024. [2019-12-18 15:08:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2019-12-18 15:08:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 4476 transitions. [2019-12-18 15:08:50,370 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 4476 transitions. Word has length 25 [2019-12-18 15:08:50,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:50,370 INFO L462 AbstractCegarLoop]: Abstraction has 2024 states and 4476 transitions. [2019-12-18 15:08:50,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:08:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 4476 transitions. [2019-12-18 15:08:50,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 15:08:50,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:50,374 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:50,374 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:50,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:50,375 INFO L82 PathProgramCache]: Analyzing trace with hash 355873678, now seen corresponding path program 1 times [2019-12-18 15:08:50,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:50,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750495112] [2019-12-18 15:08:50,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:50,479 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,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750495112] [2019-12-18 15:08:50,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:50,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:08:50,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880015317] [2019-12-18 15:08:50,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:08:50,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:50,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:08:50,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:50,482 INFO L87 Difference]: Start difference. First operand 2024 states and 4476 transitions. Second operand 5 states. [2019-12-18 15:08:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:50,526 INFO L93 Difference]: Finished difference Result 426 states and 776 transitions. [2019-12-18 15:08:50,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:08:50,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 15:08:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:50,527 INFO L225 Difference]: With dead ends: 426 [2019-12-18 15:08:50,527 INFO L226 Difference]: Without dead ends: 380 [2019-12-18 15:08:50,528 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,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-12-18 15:08:50,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 345. [2019-12-18 15:08:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-18 15:08:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 621 transitions. [2019-12-18 15:08:50,533 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 621 transitions. Word has length 37 [2019-12-18 15:08:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:50,534 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 621 transitions. [2019-12-18 15:08:50,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:08:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 621 transitions. [2019-12-18 15:08:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 15:08:50,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:50,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:50,536 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:50,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:50,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1678296005, now seen corresponding path program 1 times [2019-12-18 15:08:50,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:50,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415467231] [2019-12-18 15:08:50,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:50,647 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,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415467231] [2019-12-18 15:08:50,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:50,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:08:50,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822048407] [2019-12-18 15:08:50,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:08:50,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:50,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:08:50,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:50,649 INFO L87 Difference]: Start difference. First operand 345 states and 621 transitions. Second operand 5 states. [2019-12-18 15:08:50,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:50,848 INFO L93 Difference]: Finished difference Result 476 states and 857 transitions. [2019-12-18 15:08:50,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:08:50,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 15:08:50,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:50,852 INFO L225 Difference]: With dead ends: 476 [2019-12-18 15:08:50,853 INFO L226 Difference]: Without dead ends: 476 [2019-12-18 15:08:50,853 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:50,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-18 15:08:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 435. [2019-12-18 15:08:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-12-18 15:08:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 785 transitions. [2019-12-18 15:08:50,860 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 785 transitions. Word has length 52 [2019-12-18 15:08:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:50,863 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 785 transitions. [2019-12-18 15:08:50,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:08:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 785 transitions. [2019-12-18 15:08:50,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 15:08:50,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:50,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:50,865 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:50,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:50,865 INFO L82 PathProgramCache]: Analyzing trace with hash -856791897, now seen corresponding path program 2 times [2019-12-18 15:08:50,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:50,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592705498] [2019-12-18 15:08:50,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:50,992 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,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592705498] [2019-12-18 15:08:50,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:50,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:08:50,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927479383] [2019-12-18 15:08:50,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:08:50,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:50,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:08:50,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:08:50,995 INFO L87 Difference]: Start difference. First operand 435 states and 785 transitions. Second operand 6 states. [2019-12-18 15:08:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:51,362 INFO L93 Difference]: Finished difference Result 661 states and 1197 transitions. [2019-12-18 15:08:51,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:08:51,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 15:08:51,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:51,365 INFO L225 Difference]: With dead ends: 661 [2019-12-18 15:08:51,365 INFO L226 Difference]: Without dead ends: 661 [2019-12-18 15:08:51,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:08:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-12-18 15:08:51,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 480. [2019-12-18 15:08:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-12-18 15:08:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 875 transitions. [2019-12-18 15:08:51,373 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 875 transitions. Word has length 52 [2019-12-18 15:08:51,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:51,374 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 875 transitions. [2019-12-18 15:08:51,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:08:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 875 transitions. [2019-12-18 15:08:51,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 15:08:51,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:51,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:51,376 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:51,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:51,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1692114105, now seen corresponding path program 3 times [2019-12-18 15:08:51,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:51,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226434180] [2019-12-18 15:08:51,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:51,443 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,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226434180] [2019-12-18 15:08:51,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:51,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:51,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795558286] [2019-12-18 15:08:51,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:51,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:51,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:51,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:51,445 INFO L87 Difference]: Start difference. First operand 480 states and 875 transitions. Second operand 3 states. [2019-12-18 15:08:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:51,457 INFO L93 Difference]: Finished difference Result 435 states and 770 transitions. [2019-12-18 15:08:51,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:51,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 15:08:51,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:51,459 INFO L225 Difference]: With dead ends: 435 [2019-12-18 15:08:51,459 INFO L226 Difference]: Without dead ends: 435 [2019-12-18 15:08:51,459 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:51,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-12-18 15:08:51,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 423. [2019-12-18 15:08:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-18 15:08:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 748 transitions. [2019-12-18 15:08:51,466 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 748 transitions. Word has length 52 [2019-12-18 15:08:51,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:51,466 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 748 transitions. [2019-12-18 15:08:51,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:51,466 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 748 transitions. [2019-12-18 15:08:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:08:51,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:51,468 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:51,468 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:51,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:51,468 INFO L82 PathProgramCache]: Analyzing trace with hash -798948617, now seen corresponding path program 1 times [2019-12-18 15:08:51,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:51,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232603034] [2019-12-18 15:08:51,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:51,660 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,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232603034] [2019-12-18 15:08:51,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:51,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:08:51,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397095000] [2019-12-18 15:08:51,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:08:51,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:51,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:08:51,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:08:51,665 INFO L87 Difference]: Start difference. First operand 423 states and 748 transitions. Second operand 6 states. [2019-12-18 15:08:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:51,930 INFO L93 Difference]: Finished difference Result 552 states and 967 transitions. [2019-12-18 15:08:51,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:08:51,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 15:08:51,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:51,934 INFO L225 Difference]: With dead ends: 552 [2019-12-18 15:08:51,934 INFO L226 Difference]: Without dead ends: 552 [2019-12-18 15:08:51,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:08:51,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-12-18 15:08:51,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 437. [2019-12-18 15:08:51,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-12-18 15:08:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 774 transitions. [2019-12-18 15:08:51,942 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 774 transitions. Word has length 53 [2019-12-18 15:08:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:51,942 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 774 transitions. [2019-12-18 15:08:51,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:08:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 774 transitions. [2019-12-18 15:08:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:08:51,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:51,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:51,944 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:51,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:51,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1548250017, now seen corresponding path program 2 times [2019-12-18 15:08:51,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:51,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015775225] [2019-12-18 15:08:51,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:52,192 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:52,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015775225] [2019-12-18 15:08:52,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:52,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:08:52,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001236349] [2019-12-18 15:08:52,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:08:52,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:52,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:08:52,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:08:52,194 INFO L87 Difference]: Start difference. First operand 437 states and 774 transitions. Second operand 8 states. [2019-12-18 15:08:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:52,622 INFO L93 Difference]: Finished difference Result 664 states and 1163 transitions. [2019-12-18 15:08:52,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:08:52,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-18 15:08:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:52,624 INFO L225 Difference]: With dead ends: 664 [2019-12-18 15:08:52,624 INFO L226 Difference]: Without dead ends: 664 [2019-12-18 15:08:52,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:08:52,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-12-18 15:08:52,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 433. [2019-12-18 15:08:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-12-18 15:08:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 763 transitions. [2019-12-18 15:08:52,631 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 763 transitions. Word has length 53 [2019-12-18 15:08:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:52,632 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 763 transitions. [2019-12-18 15:08:52,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:08:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 763 transitions. [2019-12-18 15:08:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:08:52,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:52,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:52,633 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:52,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:52,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1975941905, now seen corresponding path program 3 times [2019-12-18 15:08:52,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:52,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127563331] [2019-12-18 15:08:52,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:52,719 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:52,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127563331] [2019-12-18 15:08:52,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:52,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:52,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721348954] [2019-12-18 15:08:52,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:52,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:52,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:52,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:52,722 INFO L87 Difference]: Start difference. First operand 433 states and 763 transitions. Second operand 3 states. [2019-12-18 15:08:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:52,767 INFO L93 Difference]: Finished difference Result 432 states and 761 transitions. [2019-12-18 15:08:52,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:52,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 15:08:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:52,769 INFO L225 Difference]: With dead ends: 432 [2019-12-18 15:08:52,769 INFO L226 Difference]: Without dead ends: 432 [2019-12-18 15:08:52,769 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:52,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-18 15:08:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 344. [2019-12-18 15:08:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-18 15:08:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 597 transitions. [2019-12-18 15:08:52,779 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 597 transitions. Word has length 53 [2019-12-18 15:08:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:52,779 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 597 transitions. [2019-12-18 15:08:52,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 597 transitions. [2019-12-18 15:08:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:08:52,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:52,780 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:52,781 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:52,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:52,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1826767497, now seen corresponding path program 1 times [2019-12-18 15:08:52,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:52,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865369443] [2019-12-18 15:08:52,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:52,998 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:52,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865369443] [2019-12-18 15:08:52,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:52,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:08:52,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648375697] [2019-12-18 15:08:52,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:08:52,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:53,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:08:53,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:08:53,000 INFO L87 Difference]: Start difference. First operand 344 states and 597 transitions. Second operand 6 states. [2019-12-18 15:08:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:53,087 INFO L93 Difference]: Finished difference Result 548 states and 951 transitions. [2019-12-18 15:08:53,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:08:53,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 15:08:53,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:53,088 INFO L225 Difference]: With dead ends: 548 [2019-12-18 15:08:53,088 INFO L226 Difference]: Without dead ends: 221 [2019-12-18 15:08:53,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:08:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-18 15:08:53,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 197. [2019-12-18 15:08:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-18 15:08:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 335 transitions. [2019-12-18 15:08:53,093 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 335 transitions. Word has length 54 [2019-12-18 15:08:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:53,093 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 335 transitions. [2019-12-18 15:08:53,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:08:53,094 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 335 transitions. [2019-12-18 15:08:53,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:08:53,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:53,095 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:53,095 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:53,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:53,095 INFO L82 PathProgramCache]: Analyzing trace with hash 584180705, now seen corresponding path program 2 times [2019-12-18 15:08:53,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:53,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549709406] [2019-12-18 15:08:53,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:53,492 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:53,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549709406] [2019-12-18 15:08:53,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:53,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:08:53,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992926422] [2019-12-18 15:08:53,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:08:53,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:53,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:08:53,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:08:53,494 INFO L87 Difference]: Start difference. First operand 197 states and 335 transitions. Second operand 13 states. [2019-12-18 15:08:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:53,959 INFO L93 Difference]: Finished difference Result 363 states and 608 transitions. [2019-12-18 15:08:53,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:08:53,959 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 15:08:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:53,960 INFO L225 Difference]: With dead ends: 363 [2019-12-18 15:08:53,960 INFO L226 Difference]: Without dead ends: 331 [2019-12-18 15:08:53,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:08:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-18 15:08:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 297. [2019-12-18 15:08:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-18 15:08:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 506 transitions. [2019-12-18 15:08:53,967 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 506 transitions. Word has length 54 [2019-12-18 15:08:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:53,967 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 506 transitions. [2019-12-18 15:08:53,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:08:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 506 transitions. [2019-12-18 15:08:53,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:08:53,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:53,968 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:53,969 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:53,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:53,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1111282689, now seen corresponding path program 3 times [2019-12-18 15:08:53,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:53,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831266725] [2019-12-18 15:08:53,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:54,227 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:54,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831266725] [2019-12-18 15:08:54,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:54,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:08:54,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152029797] [2019-12-18 15:08:54,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:08:54,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:54,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:08:54,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:08:54,230 INFO L87 Difference]: Start difference. First operand 297 states and 506 transitions. Second operand 13 states. [2019-12-18 15:08:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:54,745 INFO L93 Difference]: Finished difference Result 399 states and 659 transitions. [2019-12-18 15:08:54,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:08:54,745 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 15:08:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:54,746 INFO L225 Difference]: With dead ends: 399 [2019-12-18 15:08:54,746 INFO L226 Difference]: Without dead ends: 367 [2019-12-18 15:08:54,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:08:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-12-18 15:08:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 305. [2019-12-18 15:08:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-12-18 15:08:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 520 transitions. [2019-12-18 15:08:54,753 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 520 transitions. Word has length 54 [2019-12-18 15:08:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:54,754 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 520 transitions. [2019-12-18 15:08:54,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:08:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 520 transitions. [2019-12-18 15:08:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:08:54,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:54,755 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:54,756 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:54,756 INFO L82 PathProgramCache]: Analyzing trace with hash -695821945, now seen corresponding path program 4 times [2019-12-18 15:08:54,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:54,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510289515] [2019-12-18 15:08:54,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:08:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:08:54,856 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:08:54,856 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:08:54,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~x$w_buff1_used~0_344) (= v_~x$r_buff0_thd0~0_298 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t2479~0.base_19| 4) |v_#length_19|) (= |v_ULTIMATE.start_main_~#t2479~0.offset_16| 0) (= v_~x$r_buff0_thd1~0_128 0) (= 0 v_~weak$$choice0~0_26) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2479~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2479~0.base_19|) |v_ULTIMATE.start_main_~#t2479~0.offset_16| 0)) |v_#memory_int_17|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2479~0.base_19| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2479~0.base_19|) (= v_~x$r_buff1_thd2~0_87 0) (= v_~x$flush_delayed~0_47 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_200) (= v_~x$r_buff1_thd0~0_184 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2479~0.base_19|)) (= v_~y~0_77 0) (= 0 v_~x$w_buff0_used~0_631) (= v_~x$mem_tmp~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~main$tmp_guard1~0_19 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_137) (= 0 v_~x~0_143) (= v_~weak$$choice2~0_101 0) (= v_~x$r_buff1_thd1~0_135 0) (= 0 v_~__unbuffered_cnt~0_59) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0~0_255) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_255, ULTIMATE.start_main_~#t2479~0.base=|v_ULTIMATE.start_main_~#t2479~0.base_19|, ULTIMATE.start_main_~#t2479~0.offset=|v_ULTIMATE.start_main_~#t2479~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~x$flush_delayed~0=v_~x$flush_delayed~0_47, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_31|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_57|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, #length=|v_#length_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_298, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_25|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_45|, ~x$w_buff1~0=v_~x$w_buff1~0_200, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_38|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~x~0=v_~x~0_143, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_128, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_23|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_31, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~y~0=v_~y~0_77, ULTIMATE.start_main_~#t2480~0.base=|v_ULTIMATE.start_main_~#t2480~0.base_20|, ULTIMATE.start_main_~#t2480~0.offset=|v_ULTIMATE.start_main_~#t2480~0.offset_16|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_45|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_25|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_184, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_631, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~weak$$choice2~0=v_~weak$$choice2~0_101, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2479~0.base, ULTIMATE.start_main_~#t2479~0.offset, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_~#t2480~0.base, ULTIMATE.start_main_~#t2480~0.offset, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 15:08:54,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L777-1-->L779: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2480~0.base_10|) (= |v_ULTIMATE.start_main_~#t2480~0.offset_9| 0) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2480~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2480~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2480~0.base_10|) |v_ULTIMATE.start_main_~#t2480~0.offset_9| 1))) (not (= |v_ULTIMATE.start_main_~#t2480~0.base_10| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2480~0.base_10| 4)) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2480~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2480~0.base=|v_ULTIMATE.start_main_~#t2480~0.base_10|, ULTIMATE.start_main_~#t2480~0.offset=|v_ULTIMATE.start_main_~#t2480~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2480~0.base, ULTIMATE.start_main_~#t2480~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 15:08:54,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L4-3: Formula: (and (= 0 (mod ~x$w_buff1_used~0_Out-1318429211 256)) (= |P1Thread1of1ForFork1_#in~arg.base_In-1318429211| P1Thread1of1ForFork1_~arg.base_Out-1318429211) (= |P1Thread1of1ForFork1_#in~arg.offset_In-1318429211| P1Thread1of1ForFork1_~arg.offset_Out-1318429211) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1318429211 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1318429211|) (= ~x$w_buff0~0_In-1318429211 ~x$w_buff1~0_Out-1318429211) (= ~x$w_buff1_used~0_Out-1318429211 ~x$w_buff0_used~0_In-1318429211) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1318429211| 1) (= ~x$w_buff0_used~0_Out-1318429211 1) (= ~x$w_buff0~0_Out-1318429211 2)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1318429211, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1318429211|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1318429211|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1318429211} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1318429211, ~x$w_buff0~0=~x$w_buff0~0_Out-1318429211, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-1318429211, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1318429211|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-1318429211, ~x$w_buff1~0=~x$w_buff1~0_Out-1318429211, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1318429211|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1318429211|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1318429211, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1318429211} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 15:08:54,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L726-2-->L726-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-163247765 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-163247765 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-163247765| |P0Thread1of1ForFork0_#t~ite4_Out-163247765|))) (or (and (not .cse0) (= ~x$w_buff1~0_In-163247765 |P0Thread1of1ForFork0_#t~ite3_Out-163247765|) (not .cse1) .cse2) (and (or .cse0 .cse1) (= ~x~0_In-163247765 |P0Thread1of1ForFork0_#t~ite3_Out-163247765|) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-163247765, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-163247765, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-163247765, ~x~0=~x~0_In-163247765} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-163247765|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-163247765|, ~x$w_buff1~0=~x$w_buff1~0_In-163247765, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-163247765, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-163247765, ~x~0=~x~0_In-163247765} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 15:08:54,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-313248922 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-313248922 256) 0))) (or (and (= ~x$w_buff0_used~0_In-313248922 |P1Thread1of1ForFork1_#t~ite11_Out-313248922|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-313248922|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-313248922, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-313248922} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-313248922|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-313248922, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-313248922} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 15:08:54,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L727-->L727-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-477977853 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-477977853 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-477977853| 0)) (and (= ~x$w_buff0_used~0_In-477977853 |P0Thread1of1ForFork0_#t~ite5_Out-477977853|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-477977853, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-477977853} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-477977853|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-477977853, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-477977853} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 15:08:54,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L728-->L728-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-1416795103 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1416795103 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1416795103 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1416795103 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1416795103| ~x$w_buff1_used~0_In-1416795103) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1416795103| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1416795103, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1416795103, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1416795103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1416795103} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1416795103|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1416795103, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1416795103, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1416795103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1416795103} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 15:08:54,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L729-->L729-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In3730376 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In3730376 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out3730376| ~x$r_buff0_thd1~0_In3730376)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out3730376| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In3730376, ~x$w_buff0_used~0=~x$w_buff0_used~0_In3730376} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In3730376, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out3730376|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In3730376} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 15:08:54,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L730-->L730-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-383839481 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-383839481 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-383839481 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-383839481 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-383839481| ~x$r_buff1_thd1~0_In-383839481) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-383839481| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-383839481, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-383839481, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-383839481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-383839481} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-383839481, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-383839481|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-383839481, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-383839481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-383839481} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 15:08:54,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L730-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_79 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_79} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 15:08:54,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In1042610627 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1042610627 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1042610627 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1042610627 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out1042610627| ~x$w_buff1_used~0_In1042610627) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite12_Out1042610627| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1042610627, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1042610627, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1042610627, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1042610627} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1042610627, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1042610627, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1042610627|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1042610627, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1042610627} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 15:08:54,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L757-->L758: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In757594459 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In757594459 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In757594459 ~x$r_buff0_thd2~0_Out757594459)) (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out757594459 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In757594459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In757594459} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out757594459|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out757594459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In757594459} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 15:08:54,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-148308981 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-148308981 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-148308981 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-148308981 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-148308981|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out-148308981| ~x$r_buff1_thd2~0_In-148308981)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-148308981, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-148308981, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-148308981, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-148308981} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-148308981, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-148308981, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-148308981, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-148308981|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-148308981} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 15:08:54,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= v_~x$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 15:08:54,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [585] [585] L783-->L785-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_91 256) 0) (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 15:08:54,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L785-2-->L785-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-1692462252 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1692462252 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out-1692462252| ~x$w_buff1~0_In-1692462252) (not .cse0) (not .cse1)) (and (= ~x~0_In-1692462252 |ULTIMATE.start_main_#t~ite17_Out-1692462252|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1692462252, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1692462252, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1692462252, ~x~0=~x~0_In-1692462252} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1692462252|, ~x$w_buff1~0=~x$w_buff1~0_In-1692462252, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1692462252, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1692462252, ~x~0=~x~0_In-1692462252} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 15:08:54,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L785-4-->L786: Formula: (= v_~x~0_39 |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|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-18 15:08:54,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2122398368 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2122398368 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-2122398368| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite19_Out-2122398368| ~x$w_buff0_used~0_In-2122398368) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2122398368, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2122398368} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2122398368, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2122398368|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2122398368} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 15:08:54,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In2146984490 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In2146984490 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In2146984490 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In2146984490 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out2146984490|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite20_Out2146984490| ~x$w_buff1_used~0_In2146984490) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2146984490, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2146984490, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2146984490, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2146984490} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2146984490, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2146984490, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out2146984490|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2146984490, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2146984490} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 15:08:54,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In639013548 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In639013548 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out639013548| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out639013548| ~x$r_buff0_thd0~0_In639013548) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In639013548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In639013548} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In639013548, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out639013548|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In639013548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 15:08:54,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-251065174 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-251065174 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-251065174 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-251065174 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-251065174 |ULTIMATE.start_main_#t~ite22_Out-251065174|)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-251065174|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-251065174, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-251065174, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-251065174, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-251065174} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-251065174, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-251065174, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-251065174, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-251065174|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-251065174} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 15:08:54,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1123833600 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite38_Out1123833600| |ULTIMATE.start_main_#t~ite37_Out1123833600|) (= ~x$w_buff1_used~0_In1123833600 |ULTIMATE.start_main_#t~ite37_Out1123833600|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1123833600 256)))) (or (and (= 0 (mod ~x$r_buff1_thd0~0_In1123833600 256)) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1123833600 256))) (= 0 (mod ~x$w_buff0_used~0_In1123833600 256))))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1123833600| ~x$w_buff1_used~0_In1123833600) (= |ULTIMATE.start_main_#t~ite37_In1123833600| |ULTIMATE.start_main_#t~ite37_Out1123833600|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1123833600, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1123833600, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In1123833600|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1123833600, ~weak$$choice2~0=~weak$$choice2~0_In1123833600, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1123833600} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1123833600, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1123833600, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1123833600|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1123833600|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1123833600, ~weak$$choice2~0=~weak$$choice2~0_In1123833600, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1123833600} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 15:08:54,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [590] [590] L801-->L802: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 15:08:54,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~x~0_75 v_~x$mem_tmp~0_14) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x~0=v_~x~0_75, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 15:08:54,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 15:08:54,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:08:54 BasicIcfg [2019-12-18 15:08:54,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:08:54,958 INFO L168 Benchmark]: Toolchain (without parser) took 18453.29 ms. Allocated memory was 136.8 MB in the beginning and 825.8 MB in the end (delta: 688.9 MB). Free memory was 99.8 MB in the beginning and 636.9 MB in the end (delta: -537.1 MB). Peak memory consumption was 151.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:54,959 INFO L168 Benchmark]: CDTParser took 1.64 ms. Allocated memory is still 136.8 MB. Free memory is still 119.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 15:08:54,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.69 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.6 MB in the beginning and 155.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:54,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.06 ms. Allocated memory is still 200.8 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:54,966 INFO L168 Benchmark]: Boogie Preprocessor took 36.88 ms. Allocated memory is still 200.8 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:54,967 INFO L168 Benchmark]: RCFGBuilder took 780.17 ms. Allocated memory is still 200.8 MB. Free memory was 149.6 MB in the beginning and 105.9 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:54,969 INFO L168 Benchmark]: TraceAbstraction took 16803.03 ms. Allocated memory was 200.8 MB in the beginning and 825.8 MB in the end (delta: 625.0 MB). Free memory was 105.2 MB in the beginning and 636.9 MB in the end (delta: -531.7 MB). Peak memory consumption was 93.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:54,977 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.64 ms. Allocated memory is still 136.8 MB. Free memory is still 119.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.69 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.6 MB in the beginning and 155.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.06 ms. Allocated memory is still 200.8 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.88 ms. Allocated memory is still 200.8 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 780.17 ms. Allocated memory is still 200.8 MB. Free memory was 149.6 MB in the beginning and 105.9 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16803.03 ms. Allocated memory was 200.8 MB in the beginning and 825.8 MB in the end (delta: 625.0 MB). Free memory was 105.2 MB in the beginning and 636.9 MB in the end (delta: -531.7 MB). Peak memory consumption was 93.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 145 ProgramPointsBefore, 79 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 26 ChoiceCompositions, 3606 VarBasedMoverChecksPositive, 166 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 205 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 47380 CheckedPairsTotal, 96 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(&t2479, ((void *)0), P0, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2480, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1688 SDtfs, 1525 SDslu, 3628 SDs, 0 SdLazy, 2183 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 21 SyntacticMatches, 21 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14126occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 10732 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 662 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 592 ConstructedInterpolants, 0 QuantifiedInterpolants, 116671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...