/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/mix052_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:54:03,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:54:03,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:54:03,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:54:03,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:54:03,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:54:03,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:54:03,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:54:03,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:54:03,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:54:03,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:54:03,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:54:03,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:54:03,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:54:03,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:54:03,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:54:03,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:54:03,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:54:03,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:54:03,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:54:03,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:54:03,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:54:03,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:54:03,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:54:03,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:54:03,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:54:03,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:54:03,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:54:03,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:54:03,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:54:03,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:54:03,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:54:03,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:54:03,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:54:03,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:54:03,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:54:03,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:54:03,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:54:03,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:54:03,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:54:03,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:54:03,490 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 13:54:03,504 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:54:03,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:54:03,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:54:03,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:54:03,506 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:54:03,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:54:03,506 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:54:03,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:54:03,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:54:03,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:54:03,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:54:03,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:54:03,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:54:03,507 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:54:03,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:54:03,508 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:54:03,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:54:03,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:54:03,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:54:03,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:54:03,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:54:03,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:54:03,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:54:03,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:54:03,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:54:03,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:54:03,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:54:03,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:54:03,510 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:54:03,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:54:03,805 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:54:03,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:54:03,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:54:03,833 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:54:03,834 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:54:03,836 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_rmo.oepc.i [2019-12-18 13:54:03,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e789d53e1/a8945513f4bf49ab97f01d12df693845/FLAGd7ec43f9a [2019-12-18 13:54:04,481 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:54:04,482 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_rmo.oepc.i [2019-12-18 13:54:04,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e789d53e1/a8945513f4bf49ab97f01d12df693845/FLAGd7ec43f9a [2019-12-18 13:54:04,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e789d53e1/a8945513f4bf49ab97f01d12df693845 [2019-12-18 13:54:04,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:54:04,761 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:54:04,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:54:04,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:54:04,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:54:04,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:54:04" (1/1) ... [2019-12-18 13:54:04,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f0f0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:04, skipping insertion in model container [2019-12-18 13:54:04,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:54:04" (1/1) ... [2019-12-18 13:54:04,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:54:04,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:54:05,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:54:05,377 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:54:05,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:54:05,574 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:54:05,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:05 WrapperNode [2019-12-18 13:54:05,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:54:05,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:54:05,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:54:05,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:54:05,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:05" (1/1) ... [2019-12-18 13:54:05,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:05" (1/1) ... [2019-12-18 13:54:05,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:54:05,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:54:05,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:54:05,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:54:05,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:05" (1/1) ... [2019-12-18 13:54:05,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:05" (1/1) ... [2019-12-18 13:54:05,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:05" (1/1) ... [2019-12-18 13:54:05,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:05" (1/1) ... [2019-12-18 13:54:05,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:05" (1/1) ... [2019-12-18 13:54:05,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:05" (1/1) ... [2019-12-18 13:54:05,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:05" (1/1) ... [2019-12-18 13:54:05,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:54:05,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:54:05,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:54:05,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:54:05,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:05" (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 13:54:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:54:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:54:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:54:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:54:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:54:05,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:54:05,788 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:54:05,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:54:05,790 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:54:05,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:54:05,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:54:05,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:54:05,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:54:05,794 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 13:54:06,635 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:54:06,636 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:54:06,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:54:06 BoogieIcfgContainer [2019-12-18 13:54:06,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:54:06,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:54:06,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:54:06,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:54:06,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:54:04" (1/3) ... [2019-12-18 13:54:06,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411b7dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:54:06, skipping insertion in model container [2019-12-18 13:54:06,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:05" (2/3) ... [2019-12-18 13:54:06,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411b7dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:54:06, skipping insertion in model container [2019-12-18 13:54:06,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:54:06" (3/3) ... [2019-12-18 13:54:06,646 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_rmo.oepc.i [2019-12-18 13:54:06,657 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:54:06,657 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:54:06,666 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:54:06,667 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:54:06,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,725 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,725 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,726 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,726 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,734 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,734 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,760 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,761 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,788 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,788 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,789 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,791 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,792 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,797 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,799 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:06,818 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:54:06,838 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:54:06,839 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:54:06,839 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:54:06,839 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:54:06,839 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:54:06,839 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:54:06,839 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:54:06,840 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:54:06,857 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 13:54:06,859 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 13:54:06,968 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 13:54:06,968 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:54:06,990 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 13:54:07,012 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 13:54:07,102 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 13:54:07,102 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:54:07,109 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 13:54:07,130 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:54:07,132 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:54:13,028 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 13:54:13,141 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:54:13,490 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-18 13:54:13,490 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 13:54:13,494 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-18 13:54:32,132 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-18 13:54:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-18 13:54:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:54:32,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:32,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:54:32,141 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 13:54:32,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:32,147 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-18 13:54:32,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:32,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805355029] [2019-12-18 13:54:32,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:54:32,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805355029] [2019-12-18 13:54:32,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:32,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:54:32,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21916221] [2019-12-18 13:54:32,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:54:32,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:32,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:54:32,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:54:32,378 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-18 13:54:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:33,560 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-18 13:54:33,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:54:33,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:54:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:37,371 INFO L225 Difference]: With dead ends: 110910 [2019-12-18 13:54:37,371 INFO L226 Difference]: Without dead ends: 98066 [2019-12-18 13:54:37,373 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 13:54:41,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-18 13:54:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-18 13:54:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-18 13:54:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-18 13:54:44,037 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-18 13:54:44,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:44,038 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-18 13:54:44,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:54:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-18 13:54:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:54:44,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:44,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:54:44,044 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 13:54:44,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:44,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-18 13:54:44,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:44,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181250035] [2019-12-18 13:54:44,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:44,185 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 13:54:44,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181250035] [2019-12-18 13:54:44,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:44,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:54:44,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621732728] [2019-12-18 13:54:44,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:54:44,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:44,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:54:44,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:54:44,189 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-18 13:54:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:49,236 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-18 13:54:49,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:54:49,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:54:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:49,877 INFO L225 Difference]: With dead ends: 156656 [2019-12-18 13:54:49,877 INFO L226 Difference]: Without dead ends: 156558 [2019-12-18 13:54:49,878 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 13:54:54,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-18 13:54:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-18 13:54:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-18 13:55:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-18 13:55:06,713 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-18 13:55:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:06,714 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-18 13:55:06,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:55:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-18 13:55:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:55:06,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:06,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:55:06,720 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 13:55:06,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:06,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-18 13:55:06,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:06,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360723097] [2019-12-18 13:55:06,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:06,780 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 13:55:06,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360723097] [2019-12-18 13:55:06,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:06,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:55:06,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729893412] [2019-12-18 13:55:06,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:55:06,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:06,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:55:06,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:55:06,782 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-18 13:55:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:06,910 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-18 13:55:06,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:55:06,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:55:06,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:06,987 INFO L225 Difference]: With dead ends: 31386 [2019-12-18 13:55:06,988 INFO L226 Difference]: Without dead ends: 31386 [2019-12-18 13:55:06,988 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 13:55:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-18 13:55:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-18 13:55:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-18 13:55:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-18 13:55:07,756 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-18 13:55:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:07,756 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-18 13:55:07,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:55:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-18 13:55:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:55:07,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:07,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:55:07,760 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 13:55:07,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:07,760 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-18 13:55:07,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:07,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943478536] [2019-12-18 13:55:07,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:07,893 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 13:55:07,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943478536] [2019-12-18 13:55:07,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:07,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:55:07,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756824836] [2019-12-18 13:55:07,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:55:07,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:07,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:55:07,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:55:07,895 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-18 13:55:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:08,382 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-18 13:55:08,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:55:08,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 13:55:08,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:08,452 INFO L225 Difference]: With dead ends: 43205 [2019-12-18 13:55:08,452 INFO L226 Difference]: Without dead ends: 43205 [2019-12-18 13:55:08,453 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 13:55:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-18 13:55:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-18 13:55:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-18 13:55:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-18 13:55:10,073 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-18 13:55:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:10,074 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-18 13:55:10,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:55:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-18 13:55:10,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:55:10,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:10,084 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 13:55:10,085 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 13:55:10,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-18 13:55:10,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:10,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844626430] [2019-12-18 13:55:10,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:10,185 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 13:55:10,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844626430] [2019-12-18 13:55:10,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:10,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:55:10,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622357841] [2019-12-18 13:55:10,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:55:10,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:10,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:55:10,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:55:10,187 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-18 13:55:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:11,091 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-18 13:55:11,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:55:11,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 13:55:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:11,181 INFO L225 Difference]: With dead ends: 56051 [2019-12-18 13:55:11,181 INFO L226 Difference]: Without dead ends: 56037 [2019-12-18 13:55:11,182 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 13:55:11,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-18 13:55:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-18 13:55:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-18 13:55:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-18 13:55:12,511 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-18 13:55:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:12,511 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-18 13:55:12,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:55:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-18 13:55:12,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:55:12,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:12,526 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 13:55:12,526 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 13:55:12,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:12,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-18 13:55:12,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:12,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376010752] [2019-12-18 13:55:12,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:12,585 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 13:55:12,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376010752] [2019-12-18 13:55:12,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:12,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:55:12,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276340756] [2019-12-18 13:55:12,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:55:12,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:12,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:55:12,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:55:12,587 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-18 13:55:12,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:12,664 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-18 13:55:12,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:55:12,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:55:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:12,686 INFO L225 Difference]: With dead ends: 15281 [2019-12-18 13:55:12,686 INFO L226 Difference]: Without dead ends: 15281 [2019-12-18 13:55:12,687 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 13:55:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-18 13:55:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-18 13:55:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-18 13:55:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-18 13:55:12,923 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-18 13:55:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:12,926 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-18 13:55:12,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:55:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-18 13:55:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:55:12,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:12,938 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 13:55:12,938 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 13:55:12,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:12,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-18 13:55:12,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:12,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117234697] [2019-12-18 13:55:12,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:13,076 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 13:55:13,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117234697] [2019-12-18 13:55:13,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:13,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:55:13,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629367850] [2019-12-18 13:55:13,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:55:13,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:13,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:55:13,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:55:13,080 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-18 13:55:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:13,669 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-18 13:55:13,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:55:13,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:55:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:13,700 INFO L225 Difference]: With dead ends: 21679 [2019-12-18 13:55:13,701 INFO L226 Difference]: Without dead ends: 21679 [2019-12-18 13:55:13,701 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 13:55:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-18 13:55:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-18 13:55:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-18 13:55:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-18 13:55:13,992 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-18 13:55:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:13,993 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-18 13:55:13,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:55:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-18 13:55:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:55:14,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:14,011 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 13:55:14,011 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 13:55:14,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:14,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-18 13:55:14,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:14,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388518880] [2019-12-18 13:55:14,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:14,104 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 13:55:14,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388518880] [2019-12-18 13:55:14,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:14,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:55:14,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010538619] [2019-12-18 13:55:14,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:55:14,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:14,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:55:14,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:55:14,107 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-18 13:55:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:15,271 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-18 13:55:15,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:55:15,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:55:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:15,306 INFO L225 Difference]: With dead ends: 24589 [2019-12-18 13:55:15,306 INFO L226 Difference]: Without dead ends: 24589 [2019-12-18 13:55:15,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:55:15,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-18 13:55:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-18 13:55:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-18 13:55:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-18 13:55:15,930 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-18 13:55:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:15,930 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-18 13:55:15,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:55:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-18 13:55:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:55:15,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:15,953 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 13:55:15,953 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 13:55:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:15,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-18 13:55:15,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:15,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204998138] [2019-12-18 13:55:15,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:16,040 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 13:55:16,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204998138] [2019-12-18 13:55:16,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:16,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:55:16,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625883615] [2019-12-18 13:55:16,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:55:16,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:16,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:55:16,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:55:16,043 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 5 states. [2019-12-18 13:55:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:16,648 INFO L93 Difference]: Finished difference Result 23224 states and 69393 transitions. [2019-12-18 13:55:16,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:55:16,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 13:55:16,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:16,682 INFO L225 Difference]: With dead ends: 23224 [2019-12-18 13:55:16,682 INFO L226 Difference]: Without dead ends: 23224 [2019-12-18 13:55:16,683 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 13:55:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23224 states. [2019-12-18 13:55:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23224 to 21703. [2019-12-18 13:55:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21703 states. [2019-12-18 13:55:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21703 states to 21703 states and 65239 transitions. [2019-12-18 13:55:17,006 INFO L78 Accepts]: Start accepts. Automaton has 21703 states and 65239 transitions. Word has length 39 [2019-12-18 13:55:17,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:17,007 INFO L462 AbstractCegarLoop]: Abstraction has 21703 states and 65239 transitions. [2019-12-18 13:55:17,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:55:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 21703 states and 65239 transitions. [2019-12-18 13:55:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:55:17,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:17,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:55:17,034 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 13:55:17,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:17,035 INFO L82 PathProgramCache]: Analyzing trace with hash -589002614, now seen corresponding path program 2 times [2019-12-18 13:55:17,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:17,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750318985] [2019-12-18 13:55:17,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:17,104 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 13:55:17,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750318985] [2019-12-18 13:55:17,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:17,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:55:17,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145490176] [2019-12-18 13:55:17,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:55:17,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:17,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:55:17,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:55:17,106 INFO L87 Difference]: Start difference. First operand 21703 states and 65239 transitions. Second operand 5 states. [2019-12-18 13:55:17,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:17,207 INFO L93 Difference]: Finished difference Result 20476 states and 62395 transitions. [2019-12-18 13:55:17,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:55:17,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 13:55:17,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:17,238 INFO L225 Difference]: With dead ends: 20476 [2019-12-18 13:55:17,238 INFO L226 Difference]: Without dead ends: 20476 [2019-12-18 13:55:17,239 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 13:55:17,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20476 states. [2019-12-18 13:55:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20476 to 19636. [2019-12-18 13:55:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19636 states. [2019-12-18 13:55:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19636 states to 19636 states and 60128 transitions. [2019-12-18 13:55:17,540 INFO L78 Accepts]: Start accepts. Automaton has 19636 states and 60128 transitions. Word has length 39 [2019-12-18 13:55:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:17,540 INFO L462 AbstractCegarLoop]: Abstraction has 19636 states and 60128 transitions. [2019-12-18 13:55:17,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:55:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 19636 states and 60128 transitions. [2019-12-18 13:55:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:55:17,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:17,564 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 13:55:17,564 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 13:55:17,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:17,564 INFO L82 PathProgramCache]: Analyzing trace with hash -411911737, now seen corresponding path program 1 times [2019-12-18 13:55:17,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:17,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067596511] [2019-12-18 13:55:17,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:17,610 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 13:55:17,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067596511] [2019-12-18 13:55:17,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:17,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:55:17,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551016735] [2019-12-18 13:55:17,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:55:17,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:17,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:55:17,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:55:17,613 INFO L87 Difference]: Start difference. First operand 19636 states and 60128 transitions. Second operand 3 states. [2019-12-18 13:55:17,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:17,751 INFO L93 Difference]: Finished difference Result 29371 states and 90040 transitions. [2019-12-18 13:55:17,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:55:17,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:55:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:17,791 INFO L225 Difference]: With dead ends: 29371 [2019-12-18 13:55:17,792 INFO L226 Difference]: Without dead ends: 29371 [2019-12-18 13:55:17,794 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 13:55:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29371 states. [2019-12-18 13:55:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29371 to 22257. [2019-12-18 13:55:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22257 states. [2019-12-18 13:55:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22257 states to 22257 states and 68986 transitions. [2019-12-18 13:55:18,465 INFO L78 Accepts]: Start accepts. Automaton has 22257 states and 68986 transitions. Word has length 64 [2019-12-18 13:55:18,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:18,466 INFO L462 AbstractCegarLoop]: Abstraction has 22257 states and 68986 transitions. [2019-12-18 13:55:18,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:55:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 22257 states and 68986 transitions. [2019-12-18 13:55:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:55:18,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:18,491 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 13:55:18,491 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 13:55:18,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:18,492 INFO L82 PathProgramCache]: Analyzing trace with hash 190415677, now seen corresponding path program 1 times [2019-12-18 13:55:18,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:18,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317416286] [2019-12-18 13:55:18,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:18,575 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 13:55:18,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317416286] [2019-12-18 13:55:18,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:18,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:55:18,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521556349] [2019-12-18 13:55:18,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:55:18,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:18,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:55:18,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:55:18,578 INFO L87 Difference]: Start difference. First operand 22257 states and 68986 transitions. Second operand 4 states. [2019-12-18 13:55:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:18,724 INFO L93 Difference]: Finished difference Result 41807 states and 129823 transitions. [2019-12-18 13:55:18,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:55:18,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-18 13:55:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:18,757 INFO L225 Difference]: With dead ends: 41807 [2019-12-18 13:55:18,758 INFO L226 Difference]: Without dead ends: 20833 [2019-12-18 13:55:18,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 13:55:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20833 states. [2019-12-18 13:55:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20833 to 20833. [2019-12-18 13:55:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2019-12-18 13:55:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 64483 transitions. [2019-12-18 13:55:19,090 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 64483 transitions. Word has length 64 [2019-12-18 13:55:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:19,090 INFO L462 AbstractCegarLoop]: Abstraction has 20833 states and 64483 transitions. [2019-12-18 13:55:19,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:55:19,090 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 64483 transitions. [2019-12-18 13:55:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:55:19,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:19,122 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 13:55:19,122 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 13:55:19,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:19,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 2 times [2019-12-18 13:55:19,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:19,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410880221] [2019-12-18 13:55:19,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:19,228 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 13:55:19,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410880221] [2019-12-18 13:55:19,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:19,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:55:19,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899821412] [2019-12-18 13:55:19,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:55:19,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:19,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:55:19,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:55:19,231 INFO L87 Difference]: Start difference. First operand 20833 states and 64483 transitions. Second operand 7 states. [2019-12-18 13:55:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:19,806 INFO L93 Difference]: Finished difference Result 61323 states and 187457 transitions. [2019-12-18 13:55:19,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:55:19,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:55:19,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:19,868 INFO L225 Difference]: With dead ends: 61323 [2019-12-18 13:55:19,869 INFO L226 Difference]: Without dead ends: 42147 [2019-12-18 13:55:19,869 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 13:55:19,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42147 states. [2019-12-18 13:55:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42147 to 23713. [2019-12-18 13:55:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23713 states. [2019-12-18 13:55:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23713 states to 23713 states and 73274 transitions. [2019-12-18 13:55:20,374 INFO L78 Accepts]: Start accepts. Automaton has 23713 states and 73274 transitions. Word has length 64 [2019-12-18 13:55:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:20,375 INFO L462 AbstractCegarLoop]: Abstraction has 23713 states and 73274 transitions. [2019-12-18 13:55:20,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:55:20,375 INFO L276 IsEmpty]: Start isEmpty. Operand 23713 states and 73274 transitions. [2019-12-18 13:55:20,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:55:20,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:20,400 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 13:55:20,400 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 13:55:20,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:20,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 3 times [2019-12-18 13:55:20,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:20,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025488061] [2019-12-18 13:55:20,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:20,851 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 13:55:20,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025488061] [2019-12-18 13:55:20,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:20,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:55:20,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340343283] [2019-12-18 13:55:20,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:55:20,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:20,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:55:20,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:55:20,853 INFO L87 Difference]: Start difference. First operand 23713 states and 73274 transitions. Second operand 7 states. [2019-12-18 13:55:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:21,701 INFO L93 Difference]: Finished difference Result 68574 states and 211095 transitions. [2019-12-18 13:55:21,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:55:21,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:55:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:21,846 INFO L225 Difference]: With dead ends: 68574 [2019-12-18 13:55:21,846 INFO L226 Difference]: Without dead ends: 51641 [2019-12-18 13:55:21,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:55:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51641 states. [2019-12-18 13:55:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51641 to 27716. [2019-12-18 13:55:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27716 states. [2019-12-18 13:55:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27716 states to 27716 states and 86140 transitions. [2019-12-18 13:55:22,624 INFO L78 Accepts]: Start accepts. Automaton has 27716 states and 86140 transitions. Word has length 64 [2019-12-18 13:55:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:22,624 INFO L462 AbstractCegarLoop]: Abstraction has 27716 states and 86140 transitions. [2019-12-18 13:55:22,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:55:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 27716 states and 86140 transitions. [2019-12-18 13:55:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:55:22,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:22,656 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 13:55:22,656 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 13:55:22,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:22,656 INFO L82 PathProgramCache]: Analyzing trace with hash -317627445, now seen corresponding path program 4 times [2019-12-18 13:55:22,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:22,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816317067] [2019-12-18 13:55:22,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:22,747 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 13:55:22,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816317067] [2019-12-18 13:55:22,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:22,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:55:22,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114560621] [2019-12-18 13:55:22,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:55:22,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:22,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:55:22,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:55:22,749 INFO L87 Difference]: Start difference. First operand 27716 states and 86140 transitions. Second operand 7 states. [2019-12-18 13:55:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:23,287 INFO L93 Difference]: Finished difference Result 58876 states and 180784 transitions. [2019-12-18 13:55:23,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:55:23,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:55:23,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:23,380 INFO L225 Difference]: With dead ends: 58876 [2019-12-18 13:55:23,380 INFO L226 Difference]: Without dead ends: 51661 [2019-12-18 13:55:23,381 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 13:55:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51661 states. [2019-12-18 13:55:24,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51661 to 28024. [2019-12-18 13:55:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28024 states. [2019-12-18 13:55:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 87091 transitions. [2019-12-18 13:55:24,430 INFO L78 Accepts]: Start accepts. Automaton has 28024 states and 87091 transitions. Word has length 64 [2019-12-18 13:55:24,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:24,431 INFO L462 AbstractCegarLoop]: Abstraction has 28024 states and 87091 transitions. [2019-12-18 13:55:24,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:55:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 28024 states and 87091 transitions. [2019-12-18 13:55:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:55:24,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:24,465 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 13:55:24,465 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 13:55:24,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:24,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 5 times [2019-12-18 13:55:24,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:24,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237600848] [2019-12-18 13:55:24,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:24,527 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 13:55:24,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237600848] [2019-12-18 13:55:24,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:24,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:55:24,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284942681] [2019-12-18 13:55:24,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:55:24,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:24,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:55:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:55:24,532 INFO L87 Difference]: Start difference. First operand 28024 states and 87091 transitions. Second operand 3 states. [2019-12-18 13:55:24,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:24,726 INFO L93 Difference]: Finished difference Result 33789 states and 104171 transitions. [2019-12-18 13:55:24,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:55:24,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:55:24,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:24,793 INFO L225 Difference]: With dead ends: 33789 [2019-12-18 13:55:24,793 INFO L226 Difference]: Without dead ends: 33789 [2019-12-18 13:55:24,794 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 13:55:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33789 states. [2019-12-18 13:55:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33789 to 29603. [2019-12-18 13:55:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29603 states. [2019-12-18 13:55:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29603 states to 29603 states and 91943 transitions. [2019-12-18 13:55:25,287 INFO L78 Accepts]: Start accepts. Automaton has 29603 states and 91943 transitions. Word has length 64 [2019-12-18 13:55:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:25,287 INFO L462 AbstractCegarLoop]: Abstraction has 29603 states and 91943 transitions. [2019-12-18 13:55:25,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:55:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 29603 states and 91943 transitions. [2019-12-18 13:55:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:55:25,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:25,321 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 13:55:25,321 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 13:55:25,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:25,321 INFO L82 PathProgramCache]: Analyzing trace with hash -181535548, now seen corresponding path program 1 times [2019-12-18 13:55:25,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:25,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991648151] [2019-12-18 13:55:25,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:25,379 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 13:55:25,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991648151] [2019-12-18 13:55:25,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:25,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:55:25,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512941188] [2019-12-18 13:55:25,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:55:25,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:25,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:55:25,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:55:25,381 INFO L87 Difference]: Start difference. First operand 29603 states and 91943 transitions. Second operand 4 states. [2019-12-18 13:55:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:25,841 INFO L93 Difference]: Finished difference Result 45817 states and 143094 transitions. [2019-12-18 13:55:25,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:55:25,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:55:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:25,955 INFO L225 Difference]: With dead ends: 45817 [2019-12-18 13:55:25,955 INFO L226 Difference]: Without dead ends: 45817 [2019-12-18 13:55:25,956 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 13:55:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45817 states. [2019-12-18 13:55:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45817 to 31959. [2019-12-18 13:55:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31959 states. [2019-12-18 13:55:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31959 states to 31959 states and 100397 transitions. [2019-12-18 13:55:26,684 INFO L78 Accepts]: Start accepts. Automaton has 31959 states and 100397 transitions. Word has length 65 [2019-12-18 13:55:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:26,684 INFO L462 AbstractCegarLoop]: Abstraction has 31959 states and 100397 transitions. [2019-12-18 13:55:26,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:55:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand 31959 states and 100397 transitions. [2019-12-18 13:55:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:55:27,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:27,175 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 13:55:27,175 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 13:55:27,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:27,175 INFO L82 PathProgramCache]: Analyzing trace with hash -701292531, now seen corresponding path program 1 times [2019-12-18 13:55:27,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:27,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610724017] [2019-12-18 13:55:27,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:27,264 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 13:55:27,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610724017] [2019-12-18 13:55:27,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:27,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:55:27,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121705626] [2019-12-18 13:55:27,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:55:27,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:27,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:55:27,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:55:27,268 INFO L87 Difference]: Start difference. First operand 31959 states and 100397 transitions. Second operand 7 states. [2019-12-18 13:55:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:27,831 INFO L93 Difference]: Finished difference Result 69632 states and 216004 transitions. [2019-12-18 13:55:27,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:55:27,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:55:27,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:27,934 INFO L225 Difference]: With dead ends: 69632 [2019-12-18 13:55:27,934 INFO L226 Difference]: Without dead ends: 63631 [2019-12-18 13:55:27,934 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 13:55:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63631 states. [2019-12-18 13:55:28,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63631 to 31991. [2019-12-18 13:55:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31991 states. [2019-12-18 13:55:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31991 states to 31991 states and 100515 transitions. [2019-12-18 13:55:28,675 INFO L78 Accepts]: Start accepts. Automaton has 31991 states and 100515 transitions. Word has length 65 [2019-12-18 13:55:28,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:28,676 INFO L462 AbstractCegarLoop]: Abstraction has 31991 states and 100515 transitions. [2019-12-18 13:55:28,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:55:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 31991 states and 100515 transitions. [2019-12-18 13:55:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:55:28,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:28,715 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 13:55:28,715 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 13:55:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:28,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1336640005, now seen corresponding path program 2 times [2019-12-18 13:55:28,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:28,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215952480] [2019-12-18 13:55:28,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:28,824 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 13:55:28,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215952480] [2019-12-18 13:55:28,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:28,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:55:28,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615403611] [2019-12-18 13:55:28,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:55:28,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:28,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:55:28,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:55:28,826 INFO L87 Difference]: Start difference. First operand 31991 states and 100515 transitions. Second operand 7 states. [2019-12-18 13:55:29,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:29,609 INFO L93 Difference]: Finished difference Result 44848 states and 139960 transitions. [2019-12-18 13:55:29,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:55:29,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:55:29,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:29,678 INFO L225 Difference]: With dead ends: 44848 [2019-12-18 13:55:29,678 INFO L226 Difference]: Without dead ends: 44844 [2019-12-18 13:55:29,678 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 13:55:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44844 states. [2019-12-18 13:55:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44844 to 32249. [2019-12-18 13:55:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32249 states. [2019-12-18 13:55:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32249 states to 32249 states and 99750 transitions. [2019-12-18 13:55:30,781 INFO L78 Accepts]: Start accepts. Automaton has 32249 states and 99750 transitions. Word has length 65 [2019-12-18 13:55:30,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:30,781 INFO L462 AbstractCegarLoop]: Abstraction has 32249 states and 99750 transitions. [2019-12-18 13:55:30,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:55:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 32249 states and 99750 transitions. [2019-12-18 13:55:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:55:30,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:30,823 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 13:55:30,824 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 13:55:30,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:30,824 INFO L82 PathProgramCache]: Analyzing trace with hash -152741241, now seen corresponding path program 1 times [2019-12-18 13:55:30,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:30,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180737760] [2019-12-18 13:55:30,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:30,865 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 13:55:30,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180737760] [2019-12-18 13:55:30,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:30,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:55:30,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799498458] [2019-12-18 13:55:30,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:55:30,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:30,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:55:30,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:55:30,868 INFO L87 Difference]: Start difference. First operand 32249 states and 99750 transitions. Second operand 3 states. [2019-12-18 13:55:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:31,107 INFO L93 Difference]: Finished difference Result 43160 states and 132643 transitions. [2019-12-18 13:55:31,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:55:31,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:55:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:31,172 INFO L225 Difference]: With dead ends: 43160 [2019-12-18 13:55:31,172 INFO L226 Difference]: Without dead ends: 43160 [2019-12-18 13:55:31,172 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 13:55:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43160 states. [2019-12-18 13:55:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43160 to 32489. [2019-12-18 13:55:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32489 states. [2019-12-18 13:55:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32489 states to 32489 states and 100545 transitions. [2019-12-18 13:55:31,744 INFO L78 Accepts]: Start accepts. Automaton has 32489 states and 100545 transitions. Word has length 65 [2019-12-18 13:55:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:31,744 INFO L462 AbstractCegarLoop]: Abstraction has 32489 states and 100545 transitions. [2019-12-18 13:55:31,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:55:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 32489 states and 100545 transitions. [2019-12-18 13:55:31,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:55:31,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:31,782 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 13:55:31,782 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 13:55:31,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:31,783 INFO L82 PathProgramCache]: Analyzing trace with hash -422803263, now seen corresponding path program 2 times [2019-12-18 13:55:31,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:31,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504671848] [2019-12-18 13:55:31,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:31,859 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 13:55:31,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504671848] [2019-12-18 13:55:31,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:31,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:55:31,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243916384] [2019-12-18 13:55:31,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:55:31,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:31,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:55:31,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:55:31,861 INFO L87 Difference]: Start difference. First operand 32489 states and 100545 transitions. Second operand 6 states. [2019-12-18 13:55:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:32,480 INFO L93 Difference]: Finished difference Result 52071 states and 162140 transitions. [2019-12-18 13:55:32,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:55:32,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 13:55:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:32,563 INFO L225 Difference]: With dead ends: 52071 [2019-12-18 13:55:32,563 INFO L226 Difference]: Without dead ends: 52071 [2019-12-18 13:55:32,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:55:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52071 states. [2019-12-18 13:55:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52071 to 33507. [2019-12-18 13:55:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33507 states. [2019-12-18 13:55:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33507 states to 33507 states and 103713 transitions. [2019-12-18 13:55:33,251 INFO L78 Accepts]: Start accepts. Automaton has 33507 states and 103713 transitions. Word has length 65 [2019-12-18 13:55:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:33,251 INFO L462 AbstractCegarLoop]: Abstraction has 33507 states and 103713 transitions. [2019-12-18 13:55:33,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:55:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 33507 states and 103713 transitions. [2019-12-18 13:55:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:55:33,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:33,749 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 13:55:33,749 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 13:55:33,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:33,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1008271868, now seen corresponding path program 1 times [2019-12-18 13:55:33,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:33,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949336724] [2019-12-18 13:55:33,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:33,817 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 13:55:33,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949336724] [2019-12-18 13:55:33,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:33,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:55:33,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181887482] [2019-12-18 13:55:33,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:55:33,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:33,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:55:33,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:55:33,819 INFO L87 Difference]: Start difference. First operand 33507 states and 103713 transitions. Second operand 4 states. [2019-12-18 13:55:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:34,033 INFO L93 Difference]: Finished difference Result 33507 states and 103505 transitions. [2019-12-18 13:55:34,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:55:34,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:55:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:34,097 INFO L225 Difference]: With dead ends: 33507 [2019-12-18 13:55:34,097 INFO L226 Difference]: Without dead ends: 33507 [2019-12-18 13:55:34,097 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 13:55:34,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33507 states. [2019-12-18 13:55:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33507 to 28069. [2019-12-18 13:55:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28069 states. [2019-12-18 13:55:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28069 states to 28069 states and 85930 transitions. [2019-12-18 13:55:34,562 INFO L78 Accepts]: Start accepts. Automaton has 28069 states and 85930 transitions. Word has length 65 [2019-12-18 13:55:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:34,562 INFO L462 AbstractCegarLoop]: Abstraction has 28069 states and 85930 transitions. [2019-12-18 13:55:34,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:55:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 28069 states and 85930 transitions. [2019-12-18 13:55:34,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:55:34,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:34,596 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 13:55:34,596 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 13:55:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:34,596 INFO L82 PathProgramCache]: Analyzing trace with hash 148182117, now seen corresponding path program 1 times [2019-12-18 13:55:34,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:34,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457817564] [2019-12-18 13:55:34,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:34,682 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 13:55:34,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457817564] [2019-12-18 13:55:34,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:34,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:55:34,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535650929] [2019-12-18 13:55:34,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:55:34,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:34,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:55:34,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:55:34,684 INFO L87 Difference]: Start difference. First operand 28069 states and 85930 transitions. Second operand 5 states. [2019-12-18 13:55:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:35,558 INFO L93 Difference]: Finished difference Result 40500 states and 121827 transitions. [2019-12-18 13:55:35,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:55:35,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 13:55:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:35,665 INFO L225 Difference]: With dead ends: 40500 [2019-12-18 13:55:35,665 INFO L226 Difference]: Without dead ends: 40276 [2019-12-18 13:55:35,666 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 13:55:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40276 states. [2019-12-18 13:55:36,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40276 to 32300. [2019-12-18 13:55:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32300 states. [2019-12-18 13:55:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32300 states to 32300 states and 98642 transitions. [2019-12-18 13:55:36,479 INFO L78 Accepts]: Start accepts. Automaton has 32300 states and 98642 transitions. Word has length 65 [2019-12-18 13:55:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:36,479 INFO L462 AbstractCegarLoop]: Abstraction has 32300 states and 98642 transitions. [2019-12-18 13:55:36,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:55:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 32300 states and 98642 transitions. [2019-12-18 13:55:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:55:36,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:36,517 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 13:55:36,517 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 13:55:36,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:36,517 INFO L82 PathProgramCache]: Analyzing trace with hash -272998531, now seen corresponding path program 2 times [2019-12-18 13:55:36,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:36,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368974527] [2019-12-18 13:55:36,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:36,573 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 13:55:36,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368974527] [2019-12-18 13:55:36,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:36,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:55:36,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743541633] [2019-12-18 13:55:36,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:55:36,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:36,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:55:36,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:55:36,575 INFO L87 Difference]: Start difference. First operand 32300 states and 98642 transitions. Second operand 3 states. [2019-12-18 13:55:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:36,704 INFO L93 Difference]: Finished difference Result 24648 states and 74324 transitions. [2019-12-18 13:55:36,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:55:36,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:55:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:36,758 INFO L225 Difference]: With dead ends: 24648 [2019-12-18 13:55:36,758 INFO L226 Difference]: Without dead ends: 24648 [2019-12-18 13:55:36,759 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 13:55:36,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24648 states. [2019-12-18 13:55:37,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24648 to 23892. [2019-12-18 13:55:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23892 states. [2019-12-18 13:55:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23892 states to 23892 states and 71950 transitions. [2019-12-18 13:55:37,136 INFO L78 Accepts]: Start accepts. Automaton has 23892 states and 71950 transitions. Word has length 65 [2019-12-18 13:55:37,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:37,136 INFO L462 AbstractCegarLoop]: Abstraction has 23892 states and 71950 transitions. [2019-12-18 13:55:37,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:55:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 23892 states and 71950 transitions. [2019-12-18 13:55:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:55:37,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:37,160 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 13:55:37,161 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 13:55:37,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:37,161 INFO L82 PathProgramCache]: Analyzing trace with hash 587293515, now seen corresponding path program 1 times [2019-12-18 13:55:37,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:37,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156397037] [2019-12-18 13:55:37,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:37,702 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 13:55:37,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156397037] [2019-12-18 13:55:37,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:37,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:55:37,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735105342] [2019-12-18 13:55:37,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:55:37,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:37,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:55:37,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:55:37,704 INFO L87 Difference]: Start difference. First operand 23892 states and 71950 transitions. Second operand 9 states. [2019-12-18 13:55:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:40,814 INFO L93 Difference]: Finished difference Result 36411 states and 107152 transitions. [2019-12-18 13:55:40,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 13:55:40,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 13:55:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:40,862 INFO L225 Difference]: With dead ends: 36411 [2019-12-18 13:55:40,862 INFO L226 Difference]: Without dead ends: 36135 [2019-12-18 13:55:40,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 13:55:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36135 states. [2019-12-18 13:55:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36135 to 23103. [2019-12-18 13:55:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23103 states. [2019-12-18 13:55:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23103 states to 23103 states and 69668 transitions. [2019-12-18 13:55:41,311 INFO L78 Accepts]: Start accepts. Automaton has 23103 states and 69668 transitions. Word has length 66 [2019-12-18 13:55:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:41,311 INFO L462 AbstractCegarLoop]: Abstraction has 23103 states and 69668 transitions. [2019-12-18 13:55:41,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:55:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 23103 states and 69668 transitions. [2019-12-18 13:55:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:55:41,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:41,339 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 13:55:41,339 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 13:55:41,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:41,339 INFO L82 PathProgramCache]: Analyzing trace with hash -810539447, now seen corresponding path program 2 times [2019-12-18 13:55:41,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:41,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936259395] [2019-12-18 13:55:41,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:41,448 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 13:55:41,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936259395] [2019-12-18 13:55:41,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:41,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:55:41,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595819608] [2019-12-18 13:55:41,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:55:41,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:41,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:55:41,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:55:41,450 INFO L87 Difference]: Start difference. First operand 23103 states and 69668 transitions. Second operand 9 states. [2019-12-18 13:55:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:42,772 INFO L93 Difference]: Finished difference Result 44184 states and 132271 transitions. [2019-12-18 13:55:42,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:55:42,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 13:55:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:42,820 INFO L225 Difference]: With dead ends: 44184 [2019-12-18 13:55:42,820 INFO L226 Difference]: Without dead ends: 35252 [2019-12-18 13:55:42,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 13:55:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35252 states. [2019-12-18 13:55:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35252 to 23602. [2019-12-18 13:55:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23602 states. [2019-12-18 13:55:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23602 states to 23602 states and 70744 transitions. [2019-12-18 13:55:43,263 INFO L78 Accepts]: Start accepts. Automaton has 23602 states and 70744 transitions. Word has length 66 [2019-12-18 13:55:43,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:43,263 INFO L462 AbstractCegarLoop]: Abstraction has 23602 states and 70744 transitions. [2019-12-18 13:55:43,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:55:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 23602 states and 70744 transitions. [2019-12-18 13:55:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:55:43,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:43,289 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 13:55:43,289 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 13:55:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1630345305, now seen corresponding path program 3 times [2019-12-18 13:55:43,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:43,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963712514] [2019-12-18 13:55:43,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:43,793 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 13:55:43,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963712514] [2019-12-18 13:55:43,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:43,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 13:55:43,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186290533] [2019-12-18 13:55:43,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 13:55:43,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:43,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 13:55:43,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 13:55:43,796 INFO L87 Difference]: Start difference. First operand 23602 states and 70744 transitions. Second operand 16 states. [2019-12-18 13:55:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:46,960 INFO L93 Difference]: Finished difference Result 34804 states and 102320 transitions. [2019-12-18 13:55:46,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 13:55:46,961 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-18 13:55:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:47,004 INFO L225 Difference]: With dead ends: 34804 [2019-12-18 13:55:47,004 INFO L226 Difference]: Without dead ends: 30983 [2019-12-18 13:55:47,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=1153, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 13:55:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30983 states. [2019-12-18 13:55:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30983 to 24130. [2019-12-18 13:55:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24130 states. [2019-12-18 13:55:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24130 states to 24130 states and 72046 transitions. [2019-12-18 13:55:47,390 INFO L78 Accepts]: Start accepts. Automaton has 24130 states and 72046 transitions. Word has length 66 [2019-12-18 13:55:47,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:47,390 INFO L462 AbstractCegarLoop]: Abstraction has 24130 states and 72046 transitions. [2019-12-18 13:55:47,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 13:55:47,390 INFO L276 IsEmpty]: Start isEmpty. Operand 24130 states and 72046 transitions. [2019-12-18 13:55:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:55:47,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:47,414 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 13:55:47,415 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 13:55:47,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:47,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1751487845, now seen corresponding path program 4 times [2019-12-18 13:55:47,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:47,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351497612] [2019-12-18 13:55:47,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:47,570 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 13:55:47,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351497612] [2019-12-18 13:55:47,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:47,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:55:47,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203572379] [2019-12-18 13:55:47,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:55:47,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:47,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:55:47,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:55:47,572 INFO L87 Difference]: Start difference. First operand 24130 states and 72046 transitions. Second operand 11 states. [2019-12-18 13:55:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:49,271 INFO L93 Difference]: Finished difference Result 34190 states and 100473 transitions. [2019-12-18 13:55:49,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:55:49,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 13:55:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:49,313 INFO L225 Difference]: With dead ends: 34190 [2019-12-18 13:55:49,313 INFO L226 Difference]: Without dead ends: 30202 [2019-12-18 13:55:49,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 13:55:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30202 states. [2019-12-18 13:55:49,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30202 to 23820. [2019-12-18 13:55:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23820 states. [2019-12-18 13:55:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23820 states to 23820 states and 71188 transitions. [2019-12-18 13:55:49,724 INFO L78 Accepts]: Start accepts. Automaton has 23820 states and 71188 transitions. Word has length 66 [2019-12-18 13:55:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:49,724 INFO L462 AbstractCegarLoop]: Abstraction has 23820 states and 71188 transitions. [2019-12-18 13:55:49,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:55:49,725 INFO L276 IsEmpty]: Start isEmpty. Operand 23820 states and 71188 transitions. [2019-12-18 13:55:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:55:49,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:49,751 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 13:55:49,751 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 13:55:49,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:49,752 INFO L82 PathProgramCache]: Analyzing trace with hash 782697179, now seen corresponding path program 5 times [2019-12-18 13:55:49,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:49,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869147354] [2019-12-18 13:55:49,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:50,446 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 13:55:50,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869147354] [2019-12-18 13:55:50,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:50,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 13:55:50,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724185047] [2019-12-18 13:55:50,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 13:55:50,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:50,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 13:55:50,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:55:50,450 INFO L87 Difference]: Start difference. First operand 23820 states and 71188 transitions. Second operand 18 states. [2019-12-18 13:55:52,119 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-18 13:55:54,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:54,715 INFO L93 Difference]: Finished difference Result 34594 states and 102716 transitions. [2019-12-18 13:55:54,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 13:55:54,715 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-18 13:55:54,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:54,761 INFO L225 Difference]: With dead ends: 34594 [2019-12-18 13:55:54,761 INFO L226 Difference]: Without dead ends: 32418 [2019-12-18 13:55:54,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=402, Invalid=2354, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 13:55:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32418 states. [2019-12-18 13:55:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32418 to 25991. [2019-12-18 13:55:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25991 states. [2019-12-18 13:55:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25991 states to 25991 states and 77451 transitions. [2019-12-18 13:55:55,203 INFO L78 Accepts]: Start accepts. Automaton has 25991 states and 77451 transitions. Word has length 66 [2019-12-18 13:55:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:55:55,203 INFO L462 AbstractCegarLoop]: Abstraction has 25991 states and 77451 transitions. [2019-12-18 13:55:55,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 13:55:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 25991 states and 77451 transitions. [2019-12-18 13:55:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:55:55,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:55:55,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:55:55,235 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 13:55:55,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:55:55,235 INFO L82 PathProgramCache]: Analyzing trace with hash 599733897, now seen corresponding path program 6 times [2019-12-18 13:55:55,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:55:55,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146275982] [2019-12-18 13:55:55,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:55:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:55:55,884 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 13:55:55,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146275982] [2019-12-18 13:55:55,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:55:55,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 13:55:55,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176069299] [2019-12-18 13:55:55,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 13:55:55,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:55:55,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 13:55:55,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:55:55,886 INFO L87 Difference]: Start difference. First operand 25991 states and 77451 transitions. Second operand 18 states. [2019-12-18 13:55:59,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:55:59,092 INFO L93 Difference]: Finished difference Result 33087 states and 97191 transitions. [2019-12-18 13:55:59,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 13:55:59,093 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-18 13:55:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:55:59,145 INFO L225 Difference]: With dead ends: 33087 [2019-12-18 13:55:59,146 INFO L226 Difference]: Without dead ends: 28746 [2019-12-18 13:55:59,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=419, Invalid=2131, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 13:55:59,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28746 states. [2019-12-18 13:55:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28746 to 23853. [2019-12-18 13:55:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23853 states. [2019-12-18 13:56:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23853 states to 23853 states and 71273 transitions. [2019-12-18 13:56:00,004 INFO L78 Accepts]: Start accepts. Automaton has 23853 states and 71273 transitions. Word has length 66 [2019-12-18 13:56:00,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:00,005 INFO L462 AbstractCegarLoop]: Abstraction has 23853 states and 71273 transitions. [2019-12-18 13:56:00,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 13:56:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 23853 states and 71273 transitions. [2019-12-18 13:56:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:56:00,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:00,029 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 13:56:00,029 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 13:56:00,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:00,030 INFO L82 PathProgramCache]: Analyzing trace with hash 746503341, now seen corresponding path program 7 times [2019-12-18 13:56:00,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:00,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431751073] [2019-12-18 13:56:00,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:00,099 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 13:56:00,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431751073] [2019-12-18 13:56:00,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:00,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:56:00,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385596083] [2019-12-18 13:56:00,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:56:00,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:00,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:56:00,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:56:00,101 INFO L87 Difference]: Start difference. First operand 23853 states and 71273 transitions. Second operand 3 states. [2019-12-18 13:56:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:00,200 INFO L93 Difference]: Finished difference Result 23853 states and 71272 transitions. [2019-12-18 13:56:00,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:56:00,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:56:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:00,233 INFO L225 Difference]: With dead ends: 23853 [2019-12-18 13:56:00,234 INFO L226 Difference]: Without dead ends: 23853 [2019-12-18 13:56:00,234 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 13:56:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23853 states. [2019-12-18 13:56:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23853 to 20316. [2019-12-18 13:56:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20316 states. [2019-12-18 13:56:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20316 states to 20316 states and 61322 transitions. [2019-12-18 13:56:00,574 INFO L78 Accepts]: Start accepts. Automaton has 20316 states and 61322 transitions. Word has length 66 [2019-12-18 13:56:00,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:00,574 INFO L462 AbstractCegarLoop]: Abstraction has 20316 states and 61322 transitions. [2019-12-18 13:56:00,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:56:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 20316 states and 61322 transitions. [2019-12-18 13:56:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:56:00,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:00,595 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 13:56:00,595 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 13:56:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:00,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1473001563, now seen corresponding path program 1 times [2019-12-18 13:56:00,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:00,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495610956] [2019-12-18 13:56:00,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:00,786 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 13:56:00,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495610956] [2019-12-18 13:56:00,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:00,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:56:00,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120147946] [2019-12-18 13:56:00,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:56:00,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:00,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:56:00,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:56:00,787 INFO L87 Difference]: Start difference. First operand 20316 states and 61322 transitions. Second operand 11 states. [2019-12-18 13:56:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:01,889 INFO L93 Difference]: Finished difference Result 38308 states and 115773 transitions. [2019-12-18 13:56:01,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 13:56:01,890 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:56:01,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:01,935 INFO L225 Difference]: With dead ends: 38308 [2019-12-18 13:56:01,935 INFO L226 Difference]: Without dead ends: 31935 [2019-12-18 13:56:01,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2019-12-18 13:56:02,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31935 states. [2019-12-18 13:56:02,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31935 to 19396. [2019-12-18 13:56:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19396 states. [2019-12-18 13:56:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19396 states to 19396 states and 58641 transitions. [2019-12-18 13:56:02,304 INFO L78 Accepts]: Start accepts. Automaton has 19396 states and 58641 transitions. Word has length 67 [2019-12-18 13:56:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:02,304 INFO L462 AbstractCegarLoop]: Abstraction has 19396 states and 58641 transitions. [2019-12-18 13:56:02,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:56:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 19396 states and 58641 transitions. [2019-12-18 13:56:02,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:56:02,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:02,324 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 13:56:02,324 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:02,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:02,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 2 times [2019-12-18 13:56:02,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:02,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348582362] [2019-12-18 13:56:02,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:56:02,506 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 13:56:02,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348582362] [2019-12-18 13:56:02,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:56:02,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:56:02,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46281549] [2019-12-18 13:56:02,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:56:02,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:56:02,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:56:02,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:56:02,508 INFO L87 Difference]: Start difference. First operand 19396 states and 58641 transitions. Second operand 12 states. [2019-12-18 13:56:03,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:56:03,559 INFO L93 Difference]: Finished difference Result 32016 states and 96612 transitions. [2019-12-18 13:56:03,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:56:03,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 13:56:03,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:56:03,604 INFO L225 Difference]: With dead ends: 32016 [2019-12-18 13:56:03,604 INFO L226 Difference]: Without dead ends: 31587 [2019-12-18 13:56:03,605 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 13:56:03,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31587 states. [2019-12-18 13:56:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31587 to 19142. [2019-12-18 13:56:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19142 states. [2019-12-18 13:56:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19142 states to 19142 states and 57997 transitions. [2019-12-18 13:56:03,969 INFO L78 Accepts]: Start accepts. Automaton has 19142 states and 57997 transitions. Word has length 67 [2019-12-18 13:56:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:56:03,970 INFO L462 AbstractCegarLoop]: Abstraction has 19142 states and 57997 transitions. [2019-12-18 13:56:03,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:56:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 19142 states and 57997 transitions. [2019-12-18 13:56:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:56:03,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:56:03,990 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 13:56:03,990 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:56:03,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:56:03,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 3 times [2019-12-18 13:56:03,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:56:03,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950365344] [2019-12-18 13:56:03,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:56:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:56:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:56:04,110 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:56:04,110 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:56:04,114 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_~x~0_72 0) (= v_~z$r_buff0_thd2~0_111 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= v_~z$r_buff1_thd0~0_129 0) (= v_~z$w_buff1_used~0_531 0) (= v_~y~0_19 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1397~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1397~0.base_26|) |v_ULTIMATE.start_main_~#t1397~0.offset_19| 0)) |v_#memory_int_21|) (= 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_39 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_104 0) (= 0 v_~__unbuffered_p2_EAX~0_53) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_24) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t1397~0.base_26| 1)) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_13 0) (= v_~z~0_174 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1397~0.base_26|) (= 0 v_~__unbuffered_cnt~0_91) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1397~0.base_26|) 0) (= v_~weak$$choice2~0_107 0) (= |v_ULTIMATE.start_main_~#t1397~0.offset_19| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1397~0.base_26| 4)) (= 0 v_~weak$$choice0~0_12))) 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_~#t1397~0.offset=|v_ULTIMATE.start_main_~#t1397~0.offset_19|, 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_~#t1399~0.base=|v_ULTIMATE.start_main_~#t1399~0.base_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_85|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_53, ~z$mem_tmp~0=v_~z$mem_tmp~0_13, 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_24, ~weak$$choice0~0=v_~weak$$choice0~0_12, #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_72, ULTIMATE.start_main_~#t1398~0.base=|v_ULTIMATE.start_main_~#t1398~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, 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_~#t1399~0.offset=|v_ULTIMATE.start_main_~#t1399~0.offset_12|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_~#t1398~0.offset=|v_ULTIMATE.start_main_~#t1398~0.offset_19|, ~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, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, 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_174, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132, ULTIMATE.start_main_~#t1397~0.base=|v_ULTIMATE.start_main_~#t1397~0.base_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1398~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_~#t1397~0.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1399~0.base, ULTIMATE.start_main_~#t1399~0.offset, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1398~0.offset, ~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, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, 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, ULTIMATE.start_main_~#t1397~0.base] because there is no mapped edge [2019-12-18 13:56:04,115 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_~#t1398~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1398~0.base_9|) (= |v_ULTIMATE.start_main_~#t1398~0.offset_8| 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1398~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1398~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1398~0.base_9|) |v_ULTIMATE.start_main_~#t1398~0.offset_8| 1)) |v_#memory_int_11|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1398~0.base_9|) 0) (not (= |v_ULTIMATE.start_main_~#t1398~0.base_9| 0))) 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_~#t1398~0.offset=|v_ULTIMATE.start_main_~#t1398~0.offset_8|, ULTIMATE.start_main_~#t1398~0.base=|v_ULTIMATE.start_main_~#t1398~0.base_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1398~0.offset, ULTIMATE.start_main_~#t1398~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 13:56:04,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0_used~0_Out2068028392 1) (= ~z$w_buff1_used~0_Out2068028392 ~z$w_buff0_used~0_In2068028392) (= (mod ~z$w_buff1_used~0_Out2068028392 256) 0) (= |P0Thread1of1ForFork0_#in~arg.offset_In2068028392| P0Thread1of1ForFork0_~arg.offset_Out2068028392) (= 1 ~z$w_buff0~0_Out2068028392) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out2068028392| 1) (= ~z$w_buff1~0_Out2068028392 ~z$w_buff0~0_In2068028392) (= P0Thread1of1ForFork0_~arg.base_Out2068028392 |P0Thread1of1ForFork0_#in~arg.base_In2068028392|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out2068028392| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out2068028392)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In2068028392|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2068028392, ~z$w_buff0~0=~z$w_buff0~0_In2068028392, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In2068028392|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In2068028392|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out2068028392, ~z$w_buff0~0=~z$w_buff0~0_Out2068028392, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out2068028392, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out2068028392, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In2068028392|, ~z$w_buff1~0=~z$w_buff1~0_Out2068028392, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out2068028392, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out2068028392|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out2068028392} 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 13:56:04,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1399~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1399~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1399~0.base_11| 4)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1399~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1399~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1399~0.base_11|) |v_ULTIMATE.start_main_~#t1399~0.offset_9| 2)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1399~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1399~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1399~0.base=|v_ULTIMATE.start_main_~#t1399~0.base_11|, ULTIMATE.start_main_~#t1399~0.offset=|v_ULTIMATE.start_main_~#t1399~0.offset_9|, #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|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1399~0.base, ULTIMATE.start_main_~#t1399~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 13:56:04,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1237234641 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1237234641 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-1237234641| |P1Thread1of1ForFork1_#t~ite10_Out-1237234641|))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-1237234641| ~z$w_buff1~0_In-1237234641) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-1237234641| ~z~0_In-1237234641) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1237234641, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1237234641, ~z$w_buff1~0=~z$w_buff1~0_In-1237234641, ~z~0=~z~0_In-1237234641} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1237234641|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1237234641, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1237234641, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1237234641|, ~z$w_buff1~0=~z$w_buff1~0_In-1237234641, ~z~0=~z~0_In-1237234641} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 13:56:04,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1502813682 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1502813682 256) 0))) (or (and (= ~z$w_buff0_used~0_In1502813682 |P1Thread1of1ForFork1_#t~ite11_Out1502813682|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1502813682|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1502813682, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1502813682} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1502813682, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1502813682|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1502813682} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 13:56:04,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1889061877 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1889061877 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1889061877 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-1889061877 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1889061877|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1889061877 |P1Thread1of1ForFork1_#t~ite12_Out-1889061877|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1889061877, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1889061877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1889061877, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1889061877} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1889061877, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1889061877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1889061877, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1889061877|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1889061877} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:56:04,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-671459282 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-671459282 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-671459282| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-671459282| ~z$r_buff0_thd2~0_In-671459282)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-671459282, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-671459282} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-671459282, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-671459282|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-671459282} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 13:56:04,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1790235750 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In1790235750| |P2Thread1of1ForFork2_#t~ite23_Out1790235750|) (= |P2Thread1of1ForFork2_#t~ite24_Out1790235750| ~z$w_buff1~0_In1790235750)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1790235750 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In1790235750 256)) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In1790235750 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In1790235750 256) 0))) (= |P2Thread1of1ForFork2_#t~ite24_Out1790235750| |P2Thread1of1ForFork2_#t~ite23_Out1790235750|) .cse0 (= ~z$w_buff1~0_In1790235750 |P2Thread1of1ForFork2_#t~ite23_Out1790235750|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In1790235750|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1790235750, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1790235750, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1790235750, ~z$w_buff1~0=~z$w_buff1~0_In1790235750, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1790235750, ~weak$$choice2~0=~weak$$choice2~0_In1790235750} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out1790235750|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out1790235750|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1790235750, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1790235750, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1790235750, ~z$w_buff1~0=~z$w_buff1~0_In1790235750, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1790235750, ~weak$$choice2~0=~weak$$choice2~0_In1790235750} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 13:56:04,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-545111722 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-545111722 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-545111722 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-545111722 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-545111722 256))))) (= |P2Thread1of1ForFork2_#t~ite26_Out-545111722| ~z$w_buff0_used~0_In-545111722) (= |P2Thread1of1ForFork2_#t~ite26_Out-545111722| |P2Thread1of1ForFork2_#t~ite27_Out-545111722|)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite27_Out-545111722| ~z$w_buff0_used~0_In-545111722) (= |P2Thread1of1ForFork2_#t~ite26_In-545111722| |P2Thread1of1ForFork2_#t~ite26_Out-545111722|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-545111722|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-545111722, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-545111722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545111722, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-545111722, ~weak$$choice2~0=~weak$$choice2~0_In-545111722} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-545111722|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-545111722, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-545111722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545111722, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-545111722, ~weak$$choice2~0=~weak$$choice2~0_In-545111722, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-545111722|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 13:56:04,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1235968731 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1235968731 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1235968731 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1235968731 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1235968731|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-1235968731 |P1Thread1of1ForFork1_#t~ite14_Out-1235968731|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1235968731, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1235968731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1235968731, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1235968731} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1235968731, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1235968731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1235968731, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1235968731|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1235968731} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:56:04,124 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 13:56:04,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In264114810 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out264114810| ~z$w_buff1_used~0_In264114810) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In264114810 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In264114810 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In264114810 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In264114810 256) 0) .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out264114810| |P2Thread1of1ForFork2_#t~ite30_Out264114810|)) (and (= ~z$w_buff1_used~0_In264114810 |P2Thread1of1ForFork2_#t~ite30_Out264114810|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In264114810| |P2Thread1of1ForFork2_#t~ite29_Out264114810|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In264114810, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In264114810, ~z$w_buff1_used~0=~z$w_buff1_used~0_In264114810, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In264114810, ~weak$$choice2~0=~weak$$choice2~0_In264114810, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In264114810|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out264114810|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In264114810, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In264114810, ~z$w_buff1_used~0=~z$w_buff1_used~0_In264114810, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In264114810, ~weak$$choice2~0=~weak$$choice2~0_In264114810, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out264114810|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 13:56:04,126 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 13:56:04,127 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 13:56:04,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In114586787 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In114586787 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out114586787|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In114586787 |P0Thread1of1ForFork0_#t~ite5_Out114586787|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In114586787, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In114586787} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out114586787|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In114586787, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In114586787} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:56:04,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd1~0_In802213325 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In802213325 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In802213325 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In802213325 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In802213325 |P0Thread1of1ForFork0_#t~ite6_Out802213325|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out802213325|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In802213325, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In802213325, ~z$w_buff1_used~0=~z$w_buff1_used~0_In802213325, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In802213325} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out802213325|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In802213325, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In802213325, ~z$w_buff1_used~0=~z$w_buff1_used~0_In802213325, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In802213325} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:56:04,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1844581194 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1844581194 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-1844581194) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In-1844581194 ~z$r_buff0_thd1~0_Out-1844581194) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1844581194, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1844581194} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1844581194, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1844581194|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1844581194} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:56:04,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1923532022 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1923532022 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1923532022 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1923532022 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1923532022|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-1923532022| ~z$r_buff1_thd1~0_In-1923532022)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1923532022, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1923532022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1923532022, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1923532022} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1923532022, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1923532022|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1923532022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1923532022, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1923532022} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:56:04,129 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 13:56:04,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-746962730 256))) (.cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-746962730| |P2Thread1of1ForFork2_#t~ite39_Out-746962730|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-746962730 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out-746962730| ~z~0_In-746962730) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-746962730| ~z$w_buff1~0_In-746962730) (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-746962730, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-746962730, ~z$w_buff1~0=~z$w_buff1~0_In-746962730, ~z~0=~z~0_In-746962730} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-746962730, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-746962730, ~z$w_buff1~0=~z$w_buff1~0_In-746962730, ~z~0=~z~0_In-746962730, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-746962730|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-746962730|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 13:56:04,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-641150474 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-641150474 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out-641150474| 0)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-641150474 |P2Thread1of1ForFork2_#t~ite40_Out-641150474|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-641150474, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-641150474} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-641150474, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-641150474, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-641150474|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 13:56:04,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1834453913 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1834453913 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1834453913 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1834453913 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-1834453913|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1834453913 |P2Thread1of1ForFork2_#t~ite41_Out-1834453913|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1834453913, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1834453913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834453913, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1834453913} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1834453913|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1834453913, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1834453913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834453913, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1834453913} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 13:56:04,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-703743591 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-703743591 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-703743591|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-703743591| ~z$r_buff0_thd3~0_In-703743591)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-703743591, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-703743591} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-703743591|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-703743591, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-703743591} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 13:56:04,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In424919007 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In424919007 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In424919007 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In424919007 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out424919007| ~z$r_buff1_thd3~0_In424919007) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite43_Out424919007| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In424919007, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In424919007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424919007, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In424919007} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In424919007, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In424919007, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out424919007|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424919007, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In424919007} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 13:56:04,132 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 13:56:04,132 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 13:56:04,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1123886033 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1123886033 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1123886033| |ULTIMATE.start_main_#t~ite48_Out1123886033|))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In1123886033 |ULTIMATE.start_main_#t~ite47_Out1123886033|)) (and (or .cse2 .cse1) (= ~z~0_In1123886033 |ULTIMATE.start_main_#t~ite47_Out1123886033|) .cse0))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1123886033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1123886033, ~z$w_buff1~0=~z$w_buff1~0_In1123886033, ~z~0=~z~0_In1123886033} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1123886033, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1123886033|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1123886033, ~z$w_buff1~0=~z$w_buff1~0_In1123886033, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1123886033|, ~z~0=~z~0_In1123886033} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:56:04,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-746896350 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-746896350 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-746896350| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-746896350| ~z$w_buff0_used~0_In-746896350) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-746896350, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-746896350} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-746896350, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-746896350, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-746896350|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:56:04,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1118954900 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1118954900 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1118954900 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1118954900 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-1118954900| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1118954900 |ULTIMATE.start_main_#t~ite50_Out-1118954900|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1118954900, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1118954900, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1118954900, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1118954900} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1118954900|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1118954900, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1118954900, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1118954900, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1118954900} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:56:04,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1535870353 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1535870353 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-1535870353|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1535870353 |ULTIMATE.start_main_#t~ite51_Out-1535870353|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1535870353, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1535870353} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1535870353, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1535870353|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1535870353} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:56:04,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1798081145 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1798081145 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1798081145 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1798081145 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1798081145 |ULTIMATE.start_main_#t~ite52_Out-1798081145|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1798081145|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1798081145, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1798081145, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1798081145, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1798081145} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1798081145|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1798081145, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1798081145, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1798081145, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1798081145} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:56:04,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 0) (= 0 v_~__unbuffered_p2_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start_main_#t~ite52_50| v_~z$r_buff1_thd0~0_94) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x~0_47 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_50|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_49|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47, 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 13:56:04,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:56:04 BasicIcfg [2019-12-18 13:56:04,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:56:04,243 INFO L168 Benchmark]: Toolchain (without parser) took 119486.16 ms. Allocated memory was 145.8 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 101.9 MB in the beginning and 744.8 MB in the end (delta: -642.8 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-18 13:56:04,244 INFO L168 Benchmark]: CDTParser took 2.85 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:56:04,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.39 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 157.4 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:04,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.88 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:04,245 INFO L168 Benchmark]: Boogie Preprocessor took 59.32 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:04,245 INFO L168 Benchmark]: RCFGBuilder took 928.15 ms. Allocated memory is still 203.4 MB. Free memory was 152.1 MB in the beginning and 101.9 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:56:04,245 INFO L168 Benchmark]: TraceAbstraction took 117602.27 ms. Allocated memory was 203.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.9 MB in the beginning and 744.8 MB in the end (delta: -642.9 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-18 13:56:04,247 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.85 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.39 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 157.4 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.88 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.32 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 928.15 ms. Allocated memory is still 203.4 MB. Free memory was 152.1 MB in the beginning and 101.9 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 117602.27 ms. Allocated memory was 203.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.9 MB in the beginning and 744.8 MB in the end (delta: -642.9 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.6s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7186 VarBasedMoverChecksPositive, 380 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 286 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(&t1397, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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_p1_EAX=0, __unbuffered_p2_EAX=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_p1_EAX=0, __unbuffered_p2_EAX=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(&t1398, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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(&t1399, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=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] [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_p1_EAX=0, __unbuffered_p2_EAX=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=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] [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 y = 1 [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_p1_EAX=0, __unbuffered_p2_EAX=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_p1_EAX=0, __unbuffered_p2_EAX=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_p1_EAX=0, __unbuffered_p2_EAX=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_p1_EAX=0, __unbuffered_p2_EAX=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_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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_p1_EAX=0, __unbuffered_p2_EAX=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_p1_EAX=0, __unbuffered_p2_EAX=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: 117.2s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 42.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7643 SDtfs, 9699 SDslu, 28537 SDs, 0 SdLazy, 19464 SolverSat, 503 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 513 GetRequests, 79 SyntacticMatches, 21 SemanticMatches, 413 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2712 ImplicationChecksByTransitivity, 7.0s 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: 42.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 310398 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1795 NumberOfCodeBlocks, 1795 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1695 ConstructedInterpolants, 0 QuantifiedInterpolants, 390862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...