/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/safe021_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:54:13,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:54:13,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:54:13,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:54:13,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:54:13,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:54:13,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:54:13,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:54:13,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:54:13,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:54:13,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:54:13,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:54:13,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:54:13,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:54:13,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:54:13,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:54:13,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:54:13,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:54:13,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:54:13,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:54:13,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:54:13,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:54:13,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:54:13,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:54:13,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:54:13,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:54:13,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:54:13,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:54:13,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:54:13,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:54:13,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:54:13,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:54:13,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:54:13,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:54:13,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:54:13,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:54:13,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:54:13,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:54:13,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:54:13,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:54:13,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:54:13,358 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 14:54:13,382 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:54:13,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:54:13,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:54:13,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:54:13,384 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:54:13,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:54:13,385 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:54:13,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:54:13,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:54:13,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:54:13,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:54:13,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:54:13,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:54:13,386 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:54:13,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:54:13,386 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:54:13,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:54:13,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:54:13,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:54:13,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:54:13,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:54:13,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:54:13,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:54:13,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:54:13,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:54:13,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:54:13,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:54:13,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:54:13,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:54:13,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:54:13,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:54:13,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:54:13,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:54:13,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:54:13,723 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:54:13,724 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i [2019-12-18 14:54:13,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb0425d2/dadc21701e8d4aa088ed5d69e722e798/FLAGabc5f2700 [2019-12-18 14:54:14,364 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:54:14,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i [2019-12-18 14:54:14,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb0425d2/dadc21701e8d4aa088ed5d69e722e798/FLAGabc5f2700 [2019-12-18 14:54:14,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb0425d2/dadc21701e8d4aa088ed5d69e722e798 [2019-12-18 14:54:14,635 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:54:14,637 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:54:14,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:54:14,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:54:14,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:54:14,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:54:14" (1/1) ... [2019-12-18 14:54:14,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:14, skipping insertion in model container [2019-12-18 14:54:14,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:54:14" (1/1) ... [2019-12-18 14:54:14,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:54:14,714 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:54:15,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:54:15,246 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:54:15,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:54:15,448 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:54:15,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:15 WrapperNode [2019-12-18 14:54:15,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:54:15,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:54:15,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:54:15,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:54:15,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:15" (1/1) ... [2019-12-18 14:54:15,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:15" (1/1) ... [2019-12-18 14:54:15,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:54:15,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:54:15,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:54:15,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:54:15,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:15" (1/1) ... [2019-12-18 14:54:15,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:15" (1/1) ... [2019-12-18 14:54:15,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:15" (1/1) ... [2019-12-18 14:54:15,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:15" (1/1) ... [2019-12-18 14:54:15,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:15" (1/1) ... [2019-12-18 14:54:15,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:15" (1/1) ... [2019-12-18 14:54:15,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:15" (1/1) ... [2019-12-18 14:54:15,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:54:15,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:54:15,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:54:15,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:54:15,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:15" (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 14:54:15,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:54:15,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:54:15,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:54:15,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:54:15,633 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:54:15,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:54:15,634 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:54:15,634 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:54:15,634 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:54:15,634 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:54:15,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:54:15,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:54:15,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:54:15,637 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 14:54:16,431 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:54:16,432 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:54:16,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:54:16 BoogieIcfgContainer [2019-12-18 14:54:16,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:54:16,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:54:16,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:54:16,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:54:16,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:54:14" (1/3) ... [2019-12-18 14:54:16,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3c88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:54:16, skipping insertion in model container [2019-12-18 14:54:16,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:15" (2/3) ... [2019-12-18 14:54:16,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3c88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:54:16, skipping insertion in model container [2019-12-18 14:54:16,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:54:16" (3/3) ... [2019-12-18 14:54:16,444 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_rmo.opt.i [2019-12-18 14:54:16,454 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:54:16,455 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:54:16,463 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:54:16,464 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:54:16,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,513 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,514 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,514 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,515 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,515 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,528 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,528 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,564 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,593 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,593 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,593 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,596 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,596 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,601 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,603 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:16,626 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:54:16,647 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:54:16,647 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:54:16,647 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:54:16,647 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:54:16,647 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:54:16,648 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:54:16,648 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:54:16,648 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:54:16,665 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 14:54:16,668 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 14:54:16,768 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 14:54:16,768 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:54:16,790 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:54:16,822 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 14:54:16,911 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 14:54:16,911 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:54:16,924 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:54:16,950 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 14:54:16,951 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:54:22,500 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 14:54:22,631 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 14:54:22,942 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-18 14:54:22,942 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 14:54:22,946 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-18 14:54:40,454 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-18 14:54:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-18 14:54:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:54:40,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:40,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:54:40,462 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:40,467 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-18 14:54:40,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:40,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876566353] [2019-12-18 14:54:40,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:40,755 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 14:54:40,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876566353] [2019-12-18 14:54:40,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:40,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:54:40,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931707045] [2019-12-18 14:54:40,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:54:40,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:40,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:54:40,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:54:40,778 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-18 14:54:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:43,841 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-18 14:54:43,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:54:43,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:54:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:44,457 INFO L225 Difference]: With dead ends: 110910 [2019-12-18 14:54:44,458 INFO L226 Difference]: Without dead ends: 98066 [2019-12-18 14:54:44,460 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 14:54:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-18 14:54:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-18 14:54:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-18 14:54:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-18 14:54:52,940 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-18 14:54:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:52,940 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-18 14:54:52,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:54:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-18 14:54:52,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:54:52,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:52,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:52,949 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:52,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:52,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-18 14:54:52,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:52,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279896439] [2019-12-18 14:54:52,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:53,064 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 14:54:53,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279896439] [2019-12-18 14:54:53,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:53,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:54:53,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994682901] [2019-12-18 14:54:53,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:54:53,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:53,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:54:53,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:54:53,069 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-18 14:54:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:58,279 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-18 14:54:58,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:54:58,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:54:58,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:58,880 INFO L225 Difference]: With dead ends: 156656 [2019-12-18 14:54:58,880 INFO L226 Difference]: Without dead ends: 156558 [2019-12-18 14:54:58,881 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 14:55:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-18 14:55:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-18 14:55:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-18 14:55:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-18 14:55:08,537 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-18 14:55:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:08,537 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-18 14:55:08,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:55:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-18 14:55:08,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:55:08,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:08,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:08,544 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:08,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:08,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-18 14:55:08,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:08,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783700110] [2019-12-18 14:55:08,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:08,629 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 14:55:08,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783700110] [2019-12-18 14:55:08,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:08,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:55:08,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595505515] [2019-12-18 14:55:08,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:55:08,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:08,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:55:08,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:08,632 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-18 14:55:08,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:08,754 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-18 14:55:08,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:55:08,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:55:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:08,820 INFO L225 Difference]: With dead ends: 31386 [2019-12-18 14:55:08,820 INFO L226 Difference]: Without dead ends: 31386 [2019-12-18 14:55:08,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:09,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-18 14:55:14,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-18 14:55:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-18 14:55:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-18 14:55:14,256 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-18 14:55:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:14,257 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-18 14:55:14,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-18 14:55:14,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:55:14,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:14,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:14,262 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:14,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:14,263 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-18 14:55:14,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:14,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447458164] [2019-12-18 14:55:14,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:14,391 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 14:55:14,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447458164] [2019-12-18 14:55:14,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:14,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:55:14,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213687615] [2019-12-18 14:55:14,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:55:14,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:14,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:55:14,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:55:14,398 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-18 14:55:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:14,846 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-18 14:55:14,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:55:14,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 14:55:14,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:14,925 INFO L225 Difference]: With dead ends: 43205 [2019-12-18 14:55:14,925 INFO L226 Difference]: Without dead ends: 43205 [2019-12-18 14:55:14,926 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 14:55:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-18 14:55:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-18 14:55:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-18 14:55:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-18 14:55:15,639 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-18 14:55:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:15,641 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-18 14:55:15,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:55:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-18 14:55:15,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:55:15,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:15,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:15,651 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:15,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:15,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-18 14:55:15,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:15,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979600534] [2019-12-18 14:55:15,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:15,738 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 14:55:15,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979600534] [2019-12-18 14:55:15,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:15,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:55:15,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790839240] [2019-12-18 14:55:15,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:55:15,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:15,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:55:15,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:55:15,741 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-18 14:55:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:16,553 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-18 14:55:16,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:55:16,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 14:55:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:16,638 INFO L225 Difference]: With dead ends: 56051 [2019-12-18 14:55:16,638 INFO L226 Difference]: Without dead ends: 56037 [2019-12-18 14:55:16,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:55:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-18 14:55:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-18 14:55:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-18 14:55:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-18 14:55:17,764 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-18 14:55:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:17,764 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-18 14:55:17,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:55:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-18 14:55:17,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:55:17,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:17,778 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 14:55:17,779 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:17,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:17,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-18 14:55:17,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:17,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107725473] [2019-12-18 14:55:17,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:17,832 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 14:55:17,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107725473] [2019-12-18 14:55:17,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:17,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:55:17,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476794899] [2019-12-18 14:55:17,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:55:17,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:17,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:55:17,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:55:17,836 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-18 14:55:17,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:17,903 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-18 14:55:17,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:55:17,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:55:17,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:17,924 INFO L225 Difference]: With dead ends: 15281 [2019-12-18 14:55:17,925 INFO L226 Difference]: Without dead ends: 15281 [2019-12-18 14:55:17,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:55:17,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-18 14:55:18,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-18 14:55:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-18 14:55:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-18 14:55:18,232 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-18 14:55:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:18,233 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-18 14:55:18,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:55:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-18 14:55:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:55:18,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:18,253 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] [2019-12-18 14:55:18,253 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:18,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:18,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-18 14:55:18,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:18,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226242017] [2019-12-18 14:55:18,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:18,365 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 14:55:18,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226242017] [2019-12-18 14:55:18,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:18,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:55:18,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070569366] [2019-12-18 14:55:18,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:55:18,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:18,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:55:18,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:55:18,368 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-18 14:55:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:18,963 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-18 14:55:18,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:55:18,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 14:55:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:18,993 INFO L225 Difference]: With dead ends: 21679 [2019-12-18 14:55:18,994 INFO L226 Difference]: Without dead ends: 21679 [2019-12-18 14:55:18,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:55:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-18 14:55:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-18 14:55:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-18 14:55:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-18 14:55:19,265 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-18 14:55:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:19,265 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-18 14:55:19,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:55:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-18 14:55:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 14:55:19,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:19,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:19,283 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:19,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:19,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-18 14:55:19,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:19,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127271803] [2019-12-18 14:55:19,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:19,375 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 14:55:19,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127271803] [2019-12-18 14:55:19,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:19,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:55:19,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383325518] [2019-12-18 14:55:19,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:55:19,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:19,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:55:19,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:55:19,378 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-18 14:55:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:20,521 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-18 14:55:20,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 14:55:20,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 14:55:20,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:20,554 INFO L225 Difference]: With dead ends: 24589 [2019-12-18 14:55:20,554 INFO L226 Difference]: Without dead ends: 24589 [2019-12-18 14:55:20,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:55:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-18 14:55:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-18 14:55:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-18 14:55:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-18 14:55:21,028 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-18 14:55:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:21,028 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-18 14:55:21,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:55:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-18 14:55:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:55:21,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:21,051 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] [2019-12-18 14:55:21,051 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:21,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-18 14:55:21,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:21,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386791657] [2019-12-18 14:55:21,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:55:21,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386791657] [2019-12-18 14:55:21,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:21,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:55:21,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541427735] [2019-12-18 14:55:21,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:55:21,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:21,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:55:21,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:21,111 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 3 states. [2019-12-18 14:55:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:21,175 INFO L93 Difference]: Finished difference Result 16665 states and 50148 transitions. [2019-12-18 14:55:21,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:55:21,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 14:55:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:21,200 INFO L225 Difference]: With dead ends: 16665 [2019-12-18 14:55:21,200 INFO L226 Difference]: Without dead ends: 16665 [2019-12-18 14:55:21,200 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 14:55:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16665 states. [2019-12-18 14:55:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16665 to 16665. [2019-12-18 14:55:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16665 states. [2019-12-18 14:55:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16665 states to 16665 states and 50148 transitions. [2019-12-18 14:55:21,435 INFO L78 Accepts]: Start accepts. Automaton has 16665 states and 50148 transitions. Word has length 39 [2019-12-18 14:55:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:21,435 INFO L462 AbstractCegarLoop]: Abstraction has 16665 states and 50148 transitions. [2019-12-18 14:55:21,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:21,435 INFO L276 IsEmpty]: Start isEmpty. Operand 16665 states and 50148 transitions. [2019-12-18 14:55:21,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:55:21,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:21,456 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] [2019-12-18 14:55:21,456 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:21,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:21,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1450973103, now seen corresponding path program 1 times [2019-12-18 14:55:21,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:21,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593054854] [2019-12-18 14:55:21,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:21,530 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 14:55:21,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593054854] [2019-12-18 14:55:21,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:21,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:55:21,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278219267] [2019-12-18 14:55:21,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:55:21,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:21,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:55:21,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:55:21,532 INFO L87 Difference]: Start difference. First operand 16665 states and 50148 transitions. Second operand 4 states. [2019-12-18 14:55:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:21,680 INFO L93 Difference]: Finished difference Result 31503 states and 94864 transitions. [2019-12-18 14:55:21,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:55:21,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 14:55:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:21,720 INFO L225 Difference]: With dead ends: 31503 [2019-12-18 14:55:21,720 INFO L226 Difference]: Without dead ends: 16332 [2019-12-18 14:55:21,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:55:21,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16332 states. [2019-12-18 14:55:22,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16332 to 16328. [2019-12-18 14:55:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16328 states. [2019-12-18 14:55:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 48458 transitions. [2019-12-18 14:55:22,119 INFO L78 Accepts]: Start accepts. Automaton has 16328 states and 48458 transitions. Word has length 40 [2019-12-18 14:55:22,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:22,120 INFO L462 AbstractCegarLoop]: Abstraction has 16328 states and 48458 transitions. [2019-12-18 14:55:22,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:55:22,120 INFO L276 IsEmpty]: Start isEmpty. Operand 16328 states and 48458 transitions. [2019-12-18 14:55:22,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:55:22,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:22,143 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] [2019-12-18 14:55:22,144 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:22,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:22,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1753570543, now seen corresponding path program 2 times [2019-12-18 14:55:22,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:22,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592760847] [2019-12-18 14:55:22,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:22,235 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 14:55:22,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592760847] [2019-12-18 14:55:22,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:22,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:55:22,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258184823] [2019-12-18 14:55:22,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:55:22,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:22,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:55:22,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:55:22,239 INFO L87 Difference]: Start difference. First operand 16328 states and 48458 transitions. Second operand 5 states. [2019-12-18 14:55:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:22,808 INFO L93 Difference]: Finished difference Result 22499 states and 66522 transitions. [2019-12-18 14:55:22,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:55:22,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 14:55:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:22,854 INFO L225 Difference]: With dead ends: 22499 [2019-12-18 14:55:22,855 INFO L226 Difference]: Without dead ends: 22499 [2019-12-18 14:55:22,855 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 14:55:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22499 states. [2019-12-18 14:55:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22499 to 21006. [2019-12-18 14:55:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21006 states. [2019-12-18 14:55:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21006 states to 21006 states and 62454 transitions. [2019-12-18 14:55:23,178 INFO L78 Accepts]: Start accepts. Automaton has 21006 states and 62454 transitions. Word has length 40 [2019-12-18 14:55:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:23,178 INFO L462 AbstractCegarLoop]: Abstraction has 21006 states and 62454 transitions. [2019-12-18 14:55:23,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:55:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 21006 states and 62454 transitions. [2019-12-18 14:55:23,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:55:23,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:23,199 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] [2019-12-18 14:55:23,199 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:23,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1960596885, now seen corresponding path program 3 times [2019-12-18 14:55:23,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:23,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126228228] [2019-12-18 14:55:23,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:23,253 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 14:55:23,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126228228] [2019-12-18 14:55:23,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:23,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:55:23,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96731687] [2019-12-18 14:55:23,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:55:23,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:23,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:55:23,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:55:23,255 INFO L87 Difference]: Start difference. First operand 21006 states and 62454 transitions. Second operand 5 states. [2019-12-18 14:55:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:23,349 INFO L93 Difference]: Finished difference Result 19781 states and 59627 transitions. [2019-12-18 14:55:23,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:55:23,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 14:55:23,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:23,385 INFO L225 Difference]: With dead ends: 19781 [2019-12-18 14:55:23,385 INFO L226 Difference]: Without dead ends: 19287 [2019-12-18 14:55:23,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:55:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19287 states. [2019-12-18 14:55:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19287 to 18447. [2019-12-18 14:55:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18447 states. [2019-12-18 14:55:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 56396 transitions. [2019-12-18 14:55:23,897 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 56396 transitions. Word has length 40 [2019-12-18 14:55:23,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:23,897 INFO L462 AbstractCegarLoop]: Abstraction has 18447 states and 56396 transitions. [2019-12-18 14:55:23,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:55:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 56396 transitions. [2019-12-18 14:55:23,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:55:23,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:23,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:23,920 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:23,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:23,920 INFO L82 PathProgramCache]: Analyzing trace with hash -48564843, now seen corresponding path program 1 times [2019-12-18 14:55:23,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:23,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242028836] [2019-12-18 14:55:23,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:23,967 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 14:55:23,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242028836] [2019-12-18 14:55:23,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:23,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:55:23,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540233719] [2019-12-18 14:55:23,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:55:23,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:23,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:55:23,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:23,970 INFO L87 Difference]: Start difference. First operand 18447 states and 56396 transitions. Second operand 3 states. [2019-12-18 14:55:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:24,095 INFO L93 Difference]: Finished difference Result 27408 states and 83933 transitions. [2019-12-18 14:55:24,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:55:24,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 14:55:24,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:24,135 INFO L225 Difference]: With dead ends: 27408 [2019-12-18 14:55:24,135 INFO L226 Difference]: Without dead ends: 27408 [2019-12-18 14:55:24,135 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 14:55:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27408 states. [2019-12-18 14:55:24,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27408 to 20833. [2019-12-18 14:55:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2019-12-18 14:55:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 64483 transitions. [2019-12-18 14:55:24,498 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 64483 transitions. Word has length 64 [2019-12-18 14:55:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:24,498 INFO L462 AbstractCegarLoop]: Abstraction has 20833 states and 64483 transitions. [2019-12-18 14:55:24,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 64483 transitions. [2019-12-18 14:55:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:55:24,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:24,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:24,532 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:24,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:24,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 1 times [2019-12-18 14:55:24,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:24,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590248606] [2019-12-18 14:55:24,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:24,630 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 14:55:24,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590248606] [2019-12-18 14:55:24,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:24,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:55:24,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721406223] [2019-12-18 14:55:24,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:55:24,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:24,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:55:24,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:55:24,632 INFO L87 Difference]: Start difference. First operand 20833 states and 64483 transitions. Second operand 7 states. [2019-12-18 14:55:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:25,192 INFO L93 Difference]: Finished difference Result 61323 states and 187457 transitions. [2019-12-18 14:55:25,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:55:25,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:55:25,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:25,254 INFO L225 Difference]: With dead ends: 61323 [2019-12-18 14:55:25,254 INFO L226 Difference]: Without dead ends: 42147 [2019-12-18 14:55:25,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:55:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42147 states. [2019-12-18 14:55:25,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42147 to 23713. [2019-12-18 14:55:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23713 states. [2019-12-18 14:55:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23713 states to 23713 states and 73274 transitions. [2019-12-18 14:55:25,765 INFO L78 Accepts]: Start accepts. Automaton has 23713 states and 73274 transitions. Word has length 64 [2019-12-18 14:55:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:25,765 INFO L462 AbstractCegarLoop]: Abstraction has 23713 states and 73274 transitions. [2019-12-18 14:55:25,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:55:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 23713 states and 73274 transitions. [2019-12-18 14:55:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:55:25,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:25,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:25,794 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:25,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:25,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 2 times [2019-12-18 14:55:25,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:25,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478973550] [2019-12-18 14:55:25,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:25,888 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 14:55:25,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478973550] [2019-12-18 14:55:25,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:25,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:55:25,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824978727] [2019-12-18 14:55:25,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:55:25,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:25,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:55:25,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:55:25,890 INFO L87 Difference]: Start difference. First operand 23713 states and 73274 transitions. Second operand 7 states. [2019-12-18 14:55:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:26,456 INFO L93 Difference]: Finished difference Result 68574 states and 211095 transitions. [2019-12-18 14:55:26,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:55:26,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:55:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:26,585 INFO L225 Difference]: With dead ends: 68574 [2019-12-18 14:55:26,585 INFO L226 Difference]: Without dead ends: 51641 [2019-12-18 14:55:26,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:55:26,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51641 states. [2019-12-18 14:55:27,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51641 to 27716. [2019-12-18 14:55:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27716 states. [2019-12-18 14:55:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27716 states to 27716 states and 86140 transitions. [2019-12-18 14:55:27,671 INFO L78 Accepts]: Start accepts. Automaton has 27716 states and 86140 transitions. Word has length 64 [2019-12-18 14:55:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:27,671 INFO L462 AbstractCegarLoop]: Abstraction has 27716 states and 86140 transitions. [2019-12-18 14:55:27,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:55:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 27716 states and 86140 transitions. [2019-12-18 14:55:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:55:27,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:27,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:27,706 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:27,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:27,706 INFO L82 PathProgramCache]: Analyzing trace with hash -317627445, now seen corresponding path program 3 times [2019-12-18 14:55:27,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:27,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671128575] [2019-12-18 14:55:27,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:27,783 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 14:55:27,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671128575] [2019-12-18 14:55:27,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:27,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:55:27,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783569586] [2019-12-18 14:55:27,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:55:27,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:27,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:55:27,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:55:27,785 INFO L87 Difference]: Start difference. First operand 27716 states and 86140 transitions. Second operand 7 states. [2019-12-18 14:55:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:28,246 INFO L93 Difference]: Finished difference Result 58876 states and 180784 transitions. [2019-12-18 14:55:28,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:55:28,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:55:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:28,323 INFO L225 Difference]: With dead ends: 58876 [2019-12-18 14:55:28,323 INFO L226 Difference]: Without dead ends: 51661 [2019-12-18 14:55:28,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:55:28,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51661 states. [2019-12-18 14:55:28,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51661 to 28024. [2019-12-18 14:55:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28024 states. [2019-12-18 14:55:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 87091 transitions. [2019-12-18 14:55:28,915 INFO L78 Accepts]: Start accepts. Automaton has 28024 states and 87091 transitions. Word has length 64 [2019-12-18 14:55:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:28,915 INFO L462 AbstractCegarLoop]: Abstraction has 28024 states and 87091 transitions. [2019-12-18 14:55:28,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:55:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 28024 states and 87091 transitions. [2019-12-18 14:55:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:55:28,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:28,944 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:28,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:28,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 4 times [2019-12-18 14:55:28,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:28,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621966542] [2019-12-18 14:55:28,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:29,026 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 14:55:29,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621966542] [2019-12-18 14:55:29,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:29,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:55:29,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862484651] [2019-12-18 14:55:29,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:55:29,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:29,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:55:29,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:29,029 INFO L87 Difference]: Start difference. First operand 28024 states and 87091 transitions. Second operand 3 states. [2019-12-18 14:55:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:29,194 INFO L93 Difference]: Finished difference Result 33789 states and 104171 transitions. [2019-12-18 14:55:29,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:55:29,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 14:55:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:29,240 INFO L225 Difference]: With dead ends: 33789 [2019-12-18 14:55:29,240 INFO L226 Difference]: Without dead ends: 33789 [2019-12-18 14:55:29,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 14:55:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33789 states. [2019-12-18 14:55:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33789 to 29603. [2019-12-18 14:55:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29603 states. [2019-12-18 14:55:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29603 states to 29603 states and 91943 transitions. [2019-12-18 14:55:30,064 INFO L78 Accepts]: Start accepts. Automaton has 29603 states and 91943 transitions. Word has length 64 [2019-12-18 14:55:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:30,064 INFO L462 AbstractCegarLoop]: Abstraction has 29603 states and 91943 transitions. [2019-12-18 14:55:30,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 29603 states and 91943 transitions. [2019-12-18 14:55:30,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:55:30,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:30,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:30,099 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:30,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:30,099 INFO L82 PathProgramCache]: Analyzing trace with hash -181535548, now seen corresponding path program 1 times [2019-12-18 14:55:30,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:30,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239728151] [2019-12-18 14:55:30,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:30,159 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 14:55:30,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239728151] [2019-12-18 14:55:30,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:30,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:55:30,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462053808] [2019-12-18 14:55:30,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:55:30,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:30,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:55:30,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:55:30,161 INFO L87 Difference]: Start difference. First operand 29603 states and 91943 transitions. Second operand 4 states. [2019-12-18 14:55:30,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:30,489 INFO L93 Difference]: Finished difference Result 45817 states and 143094 transitions. [2019-12-18 14:55:30,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:55:30,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 14:55:30,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:30,555 INFO L225 Difference]: With dead ends: 45817 [2019-12-18 14:55:30,555 INFO L226 Difference]: Without dead ends: 45817 [2019-12-18 14:55:30,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 14:55:30,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45817 states. [2019-12-18 14:55:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45817 to 31959. [2019-12-18 14:55:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31959 states. [2019-12-18 14:55:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31959 states to 31959 states and 100397 transitions. [2019-12-18 14:55:31,152 INFO L78 Accepts]: Start accepts. Automaton has 31959 states and 100397 transitions. Word has length 65 [2019-12-18 14:55:31,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:31,152 INFO L462 AbstractCegarLoop]: Abstraction has 31959 states and 100397 transitions. [2019-12-18 14:55:31,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:55:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 31959 states and 100397 transitions. [2019-12-18 14:55:31,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:55:31,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:31,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:31,187 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:31,188 INFO L82 PathProgramCache]: Analyzing trace with hash -701292531, now seen corresponding path program 1 times [2019-12-18 14:55:31,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:31,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571616148] [2019-12-18 14:55:31,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:31,266 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 14:55:31,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571616148] [2019-12-18 14:55:31,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:31,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:55:31,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222983788] [2019-12-18 14:55:31,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:55:31,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:31,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:55:31,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:55:31,268 INFO L87 Difference]: Start difference. First operand 31959 states and 100397 transitions. Second operand 7 states. [2019-12-18 14:55:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:31,804 INFO L93 Difference]: Finished difference Result 69632 states and 216004 transitions. [2019-12-18 14:55:31,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:55:31,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 14:55:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:31,902 INFO L225 Difference]: With dead ends: 69632 [2019-12-18 14:55:31,903 INFO L226 Difference]: Without dead ends: 63631 [2019-12-18 14:55:31,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:55:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63631 states. [2019-12-18 14:55:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63631 to 31991. [2019-12-18 14:55:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31991 states. [2019-12-18 14:55:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31991 states to 31991 states and 100515 transitions. [2019-12-18 14:55:32,611 INFO L78 Accepts]: Start accepts. Automaton has 31991 states and 100515 transitions. Word has length 65 [2019-12-18 14:55:32,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:32,612 INFO L462 AbstractCegarLoop]: Abstraction has 31991 states and 100515 transitions. [2019-12-18 14:55:32,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:55:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand 31991 states and 100515 transitions. [2019-12-18 14:55:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:55:32,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:32,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:32,646 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1336640005, now seen corresponding path program 2 times [2019-12-18 14:55:32,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:32,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304893466] [2019-12-18 14:55:32,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:32,766 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 14:55:32,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304893466] [2019-12-18 14:55:32,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:32,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:55:32,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876476665] [2019-12-18 14:55:32,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:55:32,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:32,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:55:32,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:55:32,768 INFO L87 Difference]: Start difference. First operand 31991 states and 100515 transitions. Second operand 7 states. [2019-12-18 14:55:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:33,853 INFO L93 Difference]: Finished difference Result 44848 states and 139960 transitions. [2019-12-18 14:55:33,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:55:33,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 14:55:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:33,918 INFO L225 Difference]: With dead ends: 44848 [2019-12-18 14:55:33,919 INFO L226 Difference]: Without dead ends: 44844 [2019-12-18 14:55:33,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:55:34,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44844 states. [2019-12-18 14:55:34,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44844 to 32249. [2019-12-18 14:55:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32249 states. [2019-12-18 14:55:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32249 states to 32249 states and 99750 transitions. [2019-12-18 14:55:34,508 INFO L78 Accepts]: Start accepts. Automaton has 32249 states and 99750 transitions. Word has length 65 [2019-12-18 14:55:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:34,509 INFO L462 AbstractCegarLoop]: Abstraction has 32249 states and 99750 transitions. [2019-12-18 14:55:34,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:55:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 32249 states and 99750 transitions. [2019-12-18 14:55:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:55:34,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:34,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:34,544 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:34,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:34,544 INFO L82 PathProgramCache]: Analyzing trace with hash -152741241, now seen corresponding path program 1 times [2019-12-18 14:55:34,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:34,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470274784] [2019-12-18 14:55:34,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:34,589 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 14:55:34,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470274784] [2019-12-18 14:55:34,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:34,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:55:34,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269689872] [2019-12-18 14:55:34,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:55:34,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:55:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:34,591 INFO L87 Difference]: Start difference. First operand 32249 states and 99750 transitions. Second operand 3 states. [2019-12-18 14:55:34,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:34,826 INFO L93 Difference]: Finished difference Result 43160 states and 132643 transitions. [2019-12-18 14:55:34,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:55:34,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:55:34,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:34,887 INFO L225 Difference]: With dead ends: 43160 [2019-12-18 14:55:34,887 INFO L226 Difference]: Without dead ends: 43160 [2019-12-18 14:55:34,889 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 14:55:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43160 states. [2019-12-18 14:55:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43160 to 32489. [2019-12-18 14:55:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32489 states. [2019-12-18 14:55:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32489 states to 32489 states and 100545 transitions. [2019-12-18 14:55:35,431 INFO L78 Accepts]: Start accepts. Automaton has 32489 states and 100545 transitions. Word has length 65 [2019-12-18 14:55:35,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:35,431 INFO L462 AbstractCegarLoop]: Abstraction has 32489 states and 100545 transitions. [2019-12-18 14:55:35,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 32489 states and 100545 transitions. [2019-12-18 14:55:35,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:55:35,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:35,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:35,467 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:35,467 INFO L82 PathProgramCache]: Analyzing trace with hash -422803263, now seen corresponding path program 2 times [2019-12-18 14:55:35,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:35,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985575636] [2019-12-18 14:55:35,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:35,565 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 14:55:35,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985575636] [2019-12-18 14:55:35,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:35,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:55:35,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818822782] [2019-12-18 14:55:35,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:55:35,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:35,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:55:35,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:55:35,569 INFO L87 Difference]: Start difference. First operand 32489 states and 100545 transitions. Second operand 7 states. [2019-12-18 14:55:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:36,548 INFO L93 Difference]: Finished difference Result 52071 states and 162140 transitions. [2019-12-18 14:55:36,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:55:36,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 14:55:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:36,688 INFO L225 Difference]: With dead ends: 52071 [2019-12-18 14:55:36,689 INFO L226 Difference]: Without dead ends: 52071 [2019-12-18 14:55:36,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:55:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52071 states. [2019-12-18 14:55:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52071 to 33507. [2019-12-18 14:55:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33507 states. [2019-12-18 14:55:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33507 states to 33507 states and 103713 transitions. [2019-12-18 14:55:37,879 INFO L78 Accepts]: Start accepts. Automaton has 33507 states and 103713 transitions. Word has length 65 [2019-12-18 14:55:37,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:37,879 INFO L462 AbstractCegarLoop]: Abstraction has 33507 states and 103713 transitions. [2019-12-18 14:55:37,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:55:37,880 INFO L276 IsEmpty]: Start isEmpty. Operand 33507 states and 103713 transitions. [2019-12-18 14:55:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:55:37,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:37,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:37,922 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:37,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:37,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1008271868, now seen corresponding path program 1 times [2019-12-18 14:55:37,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:37,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524820152] [2019-12-18 14:55:37,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:37,990 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 14:55:37,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524820152] [2019-12-18 14:55:37,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:37,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:55:37,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700741582] [2019-12-18 14:55:37,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:55:37,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:37,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:55:37,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:55:37,992 INFO L87 Difference]: Start difference. First operand 33507 states and 103713 transitions. Second operand 4 states. [2019-12-18 14:55:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:38,191 INFO L93 Difference]: Finished difference Result 33507 states and 103505 transitions. [2019-12-18 14:55:38,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:55:38,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 14:55:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:38,248 INFO L225 Difference]: With dead ends: 33507 [2019-12-18 14:55:38,248 INFO L226 Difference]: Without dead ends: 33507 [2019-12-18 14:55:38,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 14:55:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33507 states. [2019-12-18 14:55:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33507 to 28069. [2019-12-18 14:55:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28069 states. [2019-12-18 14:55:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28069 states to 28069 states and 85930 transitions. [2019-12-18 14:55:38,749 INFO L78 Accepts]: Start accepts. Automaton has 28069 states and 85930 transitions. Word has length 65 [2019-12-18 14:55:38,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:38,749 INFO L462 AbstractCegarLoop]: Abstraction has 28069 states and 85930 transitions. [2019-12-18 14:55:38,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:55:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 28069 states and 85930 transitions. [2019-12-18 14:55:38,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:55:38,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:38,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:38,781 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:38,781 INFO L82 PathProgramCache]: Analyzing trace with hash 148182117, now seen corresponding path program 1 times [2019-12-18 14:55:38,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:38,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136979559] [2019-12-18 14:55:38,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:55:38,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136979559] [2019-12-18 14:55:38,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:38,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:55:38,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635093399] [2019-12-18 14:55:38,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:55:38,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:38,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:55:38,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:55:38,880 INFO L87 Difference]: Start difference. First operand 28069 states and 85930 transitions. Second operand 5 states. [2019-12-18 14:55:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:39,693 INFO L93 Difference]: Finished difference Result 40500 states and 121827 transitions. [2019-12-18 14:55:39,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:55:39,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 14:55:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:39,769 INFO L225 Difference]: With dead ends: 40500 [2019-12-18 14:55:39,769 INFO L226 Difference]: Without dead ends: 40276 [2019-12-18 14:55:39,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:55:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40276 states. [2019-12-18 14:55:40,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40276 to 32300. [2019-12-18 14:55:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32300 states. [2019-12-18 14:55:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32300 states to 32300 states and 98642 transitions. [2019-12-18 14:55:40,700 INFO L78 Accepts]: Start accepts. Automaton has 32300 states and 98642 transitions. Word has length 65 [2019-12-18 14:55:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:40,700 INFO L462 AbstractCegarLoop]: Abstraction has 32300 states and 98642 transitions. [2019-12-18 14:55:40,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:55:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 32300 states and 98642 transitions. [2019-12-18 14:55:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:55:40,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:40,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:40,750 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:40,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:40,750 INFO L82 PathProgramCache]: Analyzing trace with hash -272998531, now seen corresponding path program 2 times [2019-12-18 14:55:40,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:40,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974445293] [2019-12-18 14:55:40,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:40,910 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 14:55:40,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974445293] [2019-12-18 14:55:40,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:40,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:55:40,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427055707] [2019-12-18 14:55:40,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:55:40,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:40,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:55:40,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:55:40,912 INFO L87 Difference]: Start difference. First operand 32300 states and 98642 transitions. Second operand 9 states. [2019-12-18 14:55:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:42,808 INFO L93 Difference]: Finished difference Result 49096 states and 148270 transitions. [2019-12-18 14:55:42,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 14:55:42,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 14:55:42,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:42,882 INFO L225 Difference]: With dead ends: 49096 [2019-12-18 14:55:42,882 INFO L226 Difference]: Without dead ends: 49000 [2019-12-18 14:55:42,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:55:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49000 states. [2019-12-18 14:55:43,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49000 to 33469. [2019-12-18 14:55:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33469 states. [2019-12-18 14:55:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33469 states to 33469 states and 102034 transitions. [2019-12-18 14:55:43,504 INFO L78 Accepts]: Start accepts. Automaton has 33469 states and 102034 transitions. Word has length 65 [2019-12-18 14:55:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:43,504 INFO L462 AbstractCegarLoop]: Abstraction has 33469 states and 102034 transitions. [2019-12-18 14:55:43,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:55:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 33469 states and 102034 transitions. [2019-12-18 14:55:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:55:43,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:43,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:43,541 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:43,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:43,541 INFO L82 PathProgramCache]: Analyzing trace with hash 312846933, now seen corresponding path program 3 times [2019-12-18 14:55:43,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:43,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975153005] [2019-12-18 14:55:43,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:43,750 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 14:55:43,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975153005] [2019-12-18 14:55:43,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:43,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:55:43,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078883545] [2019-12-18 14:55:43,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:55:43,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:43,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:55:43,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:55:43,752 INFO L87 Difference]: Start difference. First operand 33469 states and 102034 transitions. Second operand 12 states. [2019-12-18 14:55:46,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:46,801 INFO L93 Difference]: Finished difference Result 53177 states and 159246 transitions. [2019-12-18 14:55:46,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 14:55:46,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-18 14:55:46,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:46,882 INFO L225 Difference]: With dead ends: 53177 [2019-12-18 14:55:46,882 INFO L226 Difference]: Without dead ends: 52869 [2019-12-18 14:55:46,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 14:55:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52869 states. [2019-12-18 14:55:47,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52869 to 36360. [2019-12-18 14:55:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36360 states. [2019-12-18 14:55:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36360 states to 36360 states and 110560 transitions. [2019-12-18 14:55:48,053 INFO L78 Accepts]: Start accepts. Automaton has 36360 states and 110560 transitions. Word has length 65 [2019-12-18 14:55:48,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:48,053 INFO L462 AbstractCegarLoop]: Abstraction has 36360 states and 110560 transitions. [2019-12-18 14:55:48,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:55:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 36360 states and 110560 transitions. [2019-12-18 14:55:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:55:48,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:48,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:48,093 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:48,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:48,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1178106421, now seen corresponding path program 4 times [2019-12-18 14:55:48,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:48,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280918258] [2019-12-18 14:55:48,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:48,156 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 14:55:48,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280918258] [2019-12-18 14:55:48,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:48,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:55:48,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491315087] [2019-12-18 14:55:48,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:55:48,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:48,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:55:48,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:48,158 INFO L87 Difference]: Start difference. First operand 36360 states and 110560 transitions. Second operand 3 states. [2019-12-18 14:55:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:48,296 INFO L93 Difference]: Finished difference Result 36360 states and 110559 transitions. [2019-12-18 14:55:48,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:55:48,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:55:48,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:48,351 INFO L225 Difference]: With dead ends: 36360 [2019-12-18 14:55:48,351 INFO L226 Difference]: Without dead ends: 36360 [2019-12-18 14:55:48,352 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 14:55:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36360 states. [2019-12-18 14:55:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36360 to 29373. [2019-12-18 14:55:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29373 states. [2019-12-18 14:55:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29373 states to 29373 states and 91197 transitions. [2019-12-18 14:55:48,888 INFO L78 Accepts]: Start accepts. Automaton has 29373 states and 91197 transitions. Word has length 65 [2019-12-18 14:55:48,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:48,888 INFO L462 AbstractCegarLoop]: Abstraction has 29373 states and 91197 transitions. [2019-12-18 14:55:48,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 29373 states and 91197 transitions. [2019-12-18 14:55:48,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:55:48,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:48,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:48,927 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:48,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:48,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1560089001, now seen corresponding path program 1 times [2019-12-18 14:55:48,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:48,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752357049] [2019-12-18 14:55:48,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:49,170 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 14:55:49,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752357049] [2019-12-18 14:55:49,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:49,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:55:49,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719566908] [2019-12-18 14:55:49,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:55:49,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:49,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:55:49,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:55:49,172 INFO L87 Difference]: Start difference. First operand 29373 states and 91197 transitions. Second operand 11 states. [2019-12-18 14:55:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:51,083 INFO L93 Difference]: Finished difference Result 46019 states and 140289 transitions. [2019-12-18 14:55:51,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:55:51,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 14:55:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:51,147 INFO L225 Difference]: With dead ends: 46019 [2019-12-18 14:55:51,148 INFO L226 Difference]: Without dead ends: 46019 [2019-12-18 14:55:51,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:55:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46019 states. [2019-12-18 14:55:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46019 to 29884. [2019-12-18 14:55:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29884 states. [2019-12-18 14:55:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29884 states to 29884 states and 92931 transitions. [2019-12-18 14:55:51,728 INFO L78 Accepts]: Start accepts. Automaton has 29884 states and 92931 transitions. Word has length 66 [2019-12-18 14:55:51,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:51,728 INFO L462 AbstractCegarLoop]: Abstraction has 29884 states and 92931 transitions. [2019-12-18 14:55:51,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:55:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 29884 states and 92931 transitions. [2019-12-18 14:55:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:55:51,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:51,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:51,760 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:51,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:51,760 INFO L82 PathProgramCache]: Analyzing trace with hash -353775189, now seen corresponding path program 2 times [2019-12-18 14:55:51,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:51,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875756675] [2019-12-18 14:55:51,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:51,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 14:55:51,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875756675] [2019-12-18 14:55:51,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:51,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:55:51,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952188899] [2019-12-18 14:55:51,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:55:51,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:51,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:55:51,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:51,818 INFO L87 Difference]: Start difference. First operand 29884 states and 92931 transitions. Second operand 3 states. [2019-12-18 14:55:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:51,943 INFO L93 Difference]: Finished difference Result 23659 states and 72294 transitions. [2019-12-18 14:55:51,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:55:51,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:55:51,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:51,996 INFO L225 Difference]: With dead ends: 23659 [2019-12-18 14:55:51,996 INFO L226 Difference]: Without dead ends: 23659 [2019-12-18 14:55:51,997 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 14:55:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23659 states. [2019-12-18 14:55:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23659 to 22516. [2019-12-18 14:55:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22516 states. [2019-12-18 14:55:52,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22516 states to 22516 states and 68726 transitions. [2019-12-18 14:55:52,613 INFO L78 Accepts]: Start accepts. Automaton has 22516 states and 68726 transitions. Word has length 66 [2019-12-18 14:55:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:52,613 INFO L462 AbstractCegarLoop]: Abstraction has 22516 states and 68726 transitions. [2019-12-18 14:55:52,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 22516 states and 68726 transitions. [2019-12-18 14:55:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:55:52,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:52,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:52,647 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:52,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:52,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 1 times [2019-12-18 14:55:52,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:52,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062733897] [2019-12-18 14:55:52,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:53,199 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 14:55:53,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062733897] [2019-12-18 14:55:53,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:53,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:55:53,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077582282] [2019-12-18 14:55:53,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:55:53,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:53,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:55:53,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:55:53,204 INFO L87 Difference]: Start difference. First operand 22516 states and 68726 transitions. Second operand 11 states. [2019-12-18 14:55:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:54,471 INFO L93 Difference]: Finished difference Result 46961 states and 143427 transitions. [2019-12-18 14:55:54,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 14:55:54,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 14:55:54,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:54,519 INFO L225 Difference]: With dead ends: 46961 [2019-12-18 14:55:54,519 INFO L226 Difference]: Without dead ends: 35215 [2019-12-18 14:55:54,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 14:55:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35215 states. [2019-12-18 14:55:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35215 to 22432. [2019-12-18 14:55:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22432 states. [2019-12-18 14:55:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22432 states to 22432 states and 67812 transitions. [2019-12-18 14:55:54,930 INFO L78 Accepts]: Start accepts. Automaton has 22432 states and 67812 transitions. Word has length 67 [2019-12-18 14:55:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:54,931 INFO L462 AbstractCegarLoop]: Abstraction has 22432 states and 67812 transitions. [2019-12-18 14:55:54,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:55:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 22432 states and 67812 transitions. [2019-12-18 14:55:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:55:54,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:54,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:54,957 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:54,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:54,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 2 times [2019-12-18 14:55:54,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:54,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893048750] [2019-12-18 14:55:54,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:55,158 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 14:55:55,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893048750] [2019-12-18 14:55:55,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:55,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:55:55,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276803596] [2019-12-18 14:55:55,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:55:55,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:55,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:55:55,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:55:55,161 INFO L87 Difference]: Start difference. First operand 22432 states and 67812 transitions. Second operand 12 states. [2019-12-18 14:55:56,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:56,121 INFO L93 Difference]: Finished difference Result 35734 states and 107675 transitions. [2019-12-18 14:55:56,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:55:56,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 14:55:56,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:56,166 INFO L225 Difference]: With dead ends: 35734 [2019-12-18 14:55:56,166 INFO L226 Difference]: Without dead ends: 34785 [2019-12-18 14:55:56,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 14:55:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34785 states. [2019-12-18 14:55:56,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34785 to 21770. [2019-12-18 14:55:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21770 states. [2019-12-18 14:55:56,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21770 states to 21770 states and 66005 transitions. [2019-12-18 14:55:56,560 INFO L78 Accepts]: Start accepts. Automaton has 21770 states and 66005 transitions. Word has length 67 [2019-12-18 14:55:56,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:56,560 INFO L462 AbstractCegarLoop]: Abstraction has 21770 states and 66005 transitions. [2019-12-18 14:55:56,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:55:56,560 INFO L276 IsEmpty]: Start isEmpty. Operand 21770 states and 66005 transitions. [2019-12-18 14:55:56,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:55:56,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:56,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:56,583 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:56,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 3 times [2019-12-18 14:55:56,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:56,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368992604] [2019-12-18 14:55:56,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:55:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:55:56,702 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:55:56,702 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:55:56,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2296~0.base_26| 1) |v_#valid_69|) (= 0 v_~__unbuffered_p2_EAX~0_45) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd0~0_141 0) (= 0 |v_ULTIMATE.start_main_~#t2296~0.offset_19|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2296~0.base_26|) 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2296~0.base_26| 4)) (= v_~z$r_buff1_thd0~0_133 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2296~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2296~0.base_26|) |v_ULTIMATE.start_main_~#t2296~0.offset_19| 0))) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2296~0.base_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ULTIMATE.start_main_~#t2298~0.base=|v_ULTIMATE.start_main_~#t2298~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ULTIMATE.start_main_~#t2297~0.base=|v_ULTIMATE.start_main_~#t2297~0.base_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ULTIMATE.start_main_~#t2298~0.offset=|v_ULTIMATE.start_main_~#t2298~0.offset_12|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_~#t2296~0.base=|v_ULTIMATE.start_main_~#t2296~0.base_26|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ULTIMATE.start_main_~#t2297~0.offset=|v_ULTIMATE.start_main_~#t2297~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2296~0.offset=|v_ULTIMATE.start_main_~#t2296~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t2297~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t2298~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2298~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t2296~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t2297~0.offset, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2296~0.offset, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 14:55:56,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2297~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2297~0.base_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2297~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2297~0.base_9|) |v_ULTIMATE.start_main_~#t2297~0.offset_8| 1)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t2297~0.offset_8|) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2297~0.base_9| 1) |v_#valid_33|) (not (= 0 |v_ULTIMATE.start_main_~#t2297~0.base_9|)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2297~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2297~0.base=|v_ULTIMATE.start_main_~#t2297~0.base_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2297~0.offset=|v_ULTIMATE.start_main_~#t2297~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2297~0.base, #length, ULTIMATE.start_main_~#t2297~0.offset] because there is no mapped edge [2019-12-18 14:55:56,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2105613132| 1) (= 1 ~z$w_buff0~0_Out-2105613132) (= |P0Thread1of1ForFork0_#in~arg.base_In-2105613132| P0Thread1of1ForFork0_~arg.base_Out-2105613132) (= |P0Thread1of1ForFork0_#in~arg.offset_In-2105613132| P0Thread1of1ForFork0_~arg.offset_Out-2105613132) (= ~z$w_buff1_used~0_Out-2105613132 ~z$w_buff0_used~0_In-2105613132) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2105613132| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2105613132) (= ~z$w_buff0~0_In-2105613132 ~z$w_buff1~0_Out-2105613132) (= ~z$w_buff0_used~0_Out-2105613132 1) (= 0 (mod ~z$w_buff1_used~0_Out-2105613132 256))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-2105613132|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2105613132, ~z$w_buff0~0=~z$w_buff0~0_In-2105613132, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-2105613132|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-2105613132|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-2105613132, ~z$w_buff0~0=~z$w_buff0~0_Out-2105613132, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-2105613132, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2105613132, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-2105613132|, ~z$w_buff1~0=~z$w_buff1~0_Out-2105613132, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-2105613132, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2105613132|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-2105613132} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 14:55:56,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2298~0.offset_9|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2298~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2298~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t2298~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2298~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2298~0.base_11|) |v_ULTIMATE.start_main_~#t2298~0.offset_9| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2298~0.base_11|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2298~0.base_11| 1) |v_#valid_40|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2298~0.offset=|v_ULTIMATE.start_main_~#t2298~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2298~0.base=|v_ULTIMATE.start_main_~#t2298~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2298~0.offset, #length, ULTIMATE.start_main_~#t2298~0.base] because there is no mapped edge [2019-12-18 14:55:56,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-1406132799| |P1Thread1of1ForFork1_#t~ite10_Out-1406132799|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1406132799 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1406132799 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-1406132799| ~z~0_In-1406132799)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1406132799| ~z$w_buff1~0_In-1406132799) .cse2 (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1406132799, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1406132799, ~z$w_buff1~0=~z$w_buff1~0_In-1406132799, ~z~0=~z~0_In-1406132799} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1406132799|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1406132799, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1406132799, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1406132799|, ~z$w_buff1~0=~z$w_buff1~0_In-1406132799, ~z~0=~z~0_In-1406132799} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 14:55:56,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In293090503 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In293090503 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out293090503| 0)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out293090503| ~z$w_buff0_used~0_In293090503) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In293090503, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In293090503} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In293090503, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out293090503|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In293090503} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:55:56,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1588037877 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1588037877 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1588037877 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1588037877 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1588037877|)) (and (= ~z$w_buff1_used~0_In-1588037877 |P1Thread1of1ForFork1_#t~ite12_Out-1588037877|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1588037877, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1588037877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1588037877, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1588037877} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1588037877, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1588037877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1588037877, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1588037877|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1588037877} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:55:56,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-681108308 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-681108308 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-681108308| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In-681108308 |P1Thread1of1ForFork1_#t~ite13_Out-681108308|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-681108308, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-681108308} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-681108308, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-681108308|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-681108308} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 14:55:56,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In91546019 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite23_In91546019| |P2Thread1of1ForFork2_#t~ite23_Out91546019|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite24_Out91546019| ~z$w_buff1~0_In91546019)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In91546019 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In91546019 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In91546019 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In91546019 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite23_Out91546019| ~z$w_buff1~0_In91546019) .cse0 (= |P2Thread1of1ForFork2_#t~ite24_Out91546019| |P2Thread1of1ForFork2_#t~ite23_Out91546019|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In91546019|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In91546019, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In91546019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In91546019, ~z$w_buff1~0=~z$w_buff1~0_In91546019, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In91546019, ~weak$$choice2~0=~weak$$choice2~0_In91546019} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out91546019|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out91546019|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In91546019, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In91546019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In91546019, ~z$w_buff1~0=~z$w_buff1~0_In91546019, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In91546019, ~weak$$choice2~0=~weak$$choice2~0_In91546019} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 14:55:56,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1980040914 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out-1980040914| ~z$w_buff0_used~0_In-1980040914) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In-1980040914| |P2Thread1of1ForFork2_#t~ite26_Out-1980040914|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1980040914 256)))) (or (= (mod ~z$w_buff0_used~0_In-1980040914 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1980040914 256) 0)) (and (= (mod ~z$r_buff1_thd3~0_In-1980040914 256) 0) .cse1))) .cse0 (= |P2Thread1of1ForFork2_#t~ite27_Out-1980040914| |P2Thread1of1ForFork2_#t~ite26_Out-1980040914|) (= ~z$w_buff0_used~0_In-1980040914 |P2Thread1of1ForFork2_#t~ite26_Out-1980040914|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1980040914|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1980040914, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1980040914, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1980040914, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1980040914, ~weak$$choice2~0=~weak$$choice2~0_In-1980040914} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1980040914|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1980040914, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1980040914, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1980040914, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1980040914, ~weak$$choice2~0=~weak$$choice2~0_In-1980040914, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1980040914|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 14:55:56,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-122877400 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-122877400 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-122877400 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-122877400 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-122877400 |P1Thread1of1ForFork1_#t~ite14_Out-122877400|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-122877400|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-122877400, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-122877400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-122877400, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-122877400} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-122877400, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-122877400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-122877400, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-122877400|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-122877400} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:55:56,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:55:56,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In117522236 256) 0))) (or (and (= ~z$w_buff1_used~0_In117522236 |P2Thread1of1ForFork2_#t~ite30_Out117522236|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In117522236| |P2Thread1of1ForFork2_#t~ite29_Out117522236|)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In117522236 256)))) (or (and (= (mod ~z$w_buff1_used~0_In117522236 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In117522236 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In117522236 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out117522236| |P2Thread1of1ForFork2_#t~ite30_Out117522236|) (= |P2Thread1of1ForFork2_#t~ite29_Out117522236| ~z$w_buff1_used~0_In117522236)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In117522236, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In117522236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In117522236, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In117522236, ~weak$$choice2~0=~weak$$choice2~0_In117522236, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In117522236|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out117522236|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In117522236, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In117522236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In117522236, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In117522236, ~weak$$choice2~0=~weak$$choice2~0_In117522236, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out117522236|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 14:55:56,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 14:55:56,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 14:55:56,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In937064602 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In937064602 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In937064602 |P0Thread1of1ForFork0_#t~ite5_Out937064602|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out937064602|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In937064602, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In937064602} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out937064602|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In937064602, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In937064602} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:55:56,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1467113873 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1467113873 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In1467113873 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1467113873 256)))) (or (and (= ~z$w_buff1_used~0_In1467113873 |P0Thread1of1ForFork0_#t~ite6_Out1467113873|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1467113873| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1467113873, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1467113873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1467113873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1467113873} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1467113873|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1467113873, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1467113873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1467113873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1467113873} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:55:56,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-576776579 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-576776579 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-576776579)) (and (= ~z$r_buff0_thd1~0_In-576776579 ~z$r_buff0_thd1~0_Out-576776579) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-576776579, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-576776579} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-576776579, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-576776579|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-576776579} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:55:56,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-57959045 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In-57959045 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-57959045 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-57959045 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-57959045| ~z$r_buff1_thd1~0_In-57959045) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-57959045| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-57959045, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-57959045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-57959045, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-57959045} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-57959045, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-57959045|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-57959045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-57959045, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-57959045} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:55:56,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 14:55:56,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1037791142 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1037791142 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out1037791142| |P2Thread1of1ForFork2_#t~ite39_Out1037791142|))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out1037791142| ~z$w_buff1~0_In1037791142) (not .cse0) (not .cse1) .cse2) (and (= |P2Thread1of1ForFork2_#t~ite38_Out1037791142| ~z~0_In1037791142) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1037791142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1037791142, ~z$w_buff1~0=~z$w_buff1~0_In1037791142, ~z~0=~z~0_In1037791142} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1037791142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1037791142, ~z$w_buff1~0=~z$w_buff1~0_In1037791142, ~z~0=~z~0_In1037791142, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1037791142|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1037791142|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 14:55:56,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1273260924 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1273260924 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1273260924|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1273260924 |P2Thread1of1ForFork2_#t~ite40_Out1273260924|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1273260924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1273260924} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1273260924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1273260924, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1273260924|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 14:55:56,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1353967229 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-1353967229 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1353967229 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1353967229 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out-1353967229| ~z$w_buff1_used~0_In-1353967229) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-1353967229|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1353967229, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1353967229, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1353967229, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1353967229} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1353967229|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1353967229, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1353967229, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1353967229, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1353967229} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 14:55:56,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-24423748 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-24423748 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-24423748| ~z$r_buff0_thd3~0_In-24423748)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out-24423748| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-24423748, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-24423748} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-24423748|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-24423748, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-24423748} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 14:55:56,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-1108939919 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1108939919 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1108939919 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1108939919 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-1108939919| 0)) (and (= ~z$r_buff1_thd3~0_In-1108939919 |P2Thread1of1ForFork2_#t~ite43_Out-1108939919|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1108939919, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1108939919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1108939919, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1108939919} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1108939919, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1108939919, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1108939919|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1108939919, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1108939919} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 14:55:56,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 14:55:56,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:55:56,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1708150275| |ULTIMATE.start_main_#t~ite48_Out1708150275|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1708150275 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1708150275 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1708150275| ~z$w_buff1~0_In1708150275) .cse0 (not .cse1) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out1708150275| ~z~0_In1708150275) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1708150275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1708150275, ~z$w_buff1~0=~z$w_buff1~0_In1708150275, ~z~0=~z~0_In1708150275} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1708150275, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1708150275|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1708150275, ~z$w_buff1~0=~z$w_buff1~0_In1708150275, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1708150275|, ~z~0=~z~0_In1708150275} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:55:56,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-819050452 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-819050452 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-819050452| ~z$w_buff0_used~0_In-819050452) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-819050452| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-819050452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-819050452} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-819050452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-819050452, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-819050452|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 14:55:56,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-494240283 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-494240283 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-494240283 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-494240283 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-494240283|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-494240283 |ULTIMATE.start_main_#t~ite50_Out-494240283|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-494240283, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-494240283, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-494240283, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-494240283} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-494240283|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-494240283, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-494240283, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-494240283, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-494240283} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 14:55:56,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1723803847 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1723803847 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1723803847| ~z$r_buff0_thd0~0_In-1723803847)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1723803847| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1723803847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1723803847} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1723803847, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1723803847|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1723803847} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 14:55:56,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1867815364 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1867815364 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1867815364 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1867815364 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1867815364 |ULTIMATE.start_main_#t~ite52_Out-1867815364|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1867815364|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1867815364, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1867815364, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1867815364, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1867815364} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1867815364|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1867815364, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1867815364, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1867815364, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1867815364} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 14:55:56,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_~x~0_49 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:55:56,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:55:56 BasicIcfg [2019-12-18 14:55:56,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:55:56,886 INFO L168 Benchmark]: Toolchain (without parser) took 102249.83 ms. Allocated memory was 144.7 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 100.7 MB in the beginning and 1.1 GB in the end (delta: -998.3 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 14:55:56,887 INFO L168 Benchmark]: CDTParser took 1.16 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 14:55:56,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.02 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 155.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:56,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.63 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:56,889 INFO L168 Benchmark]: Boogie Preprocessor took 39.60 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:56,889 INFO L168 Benchmark]: RCFGBuilder took 867.38 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 100.9 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:56,890 INFO L168 Benchmark]: TraceAbstraction took 100450.29 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.3 MB in the beginning and 1.1 GB in the end (delta: -998.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 14:55:56,892 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.16 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.02 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 155.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.63 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.60 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 867.38 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 100.9 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 100450.29 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.3 MB in the beginning and 1.1 GB in the end (delta: -998.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7185 VarBasedMoverChecksPositive, 382 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 288 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2296, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t2297, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t2298, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 100.0s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6838 SDtfs, 8458 SDslu, 22210 SDs, 0 SdLazy, 12468 SolverSat, 421 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 54 SyntacticMatches, 26 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 313424 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1612 NumberOfCodeBlocks, 1612 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1514 ConstructedInterpolants, 0 QuantifiedInterpolants, 312616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...