/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/safe012_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:42:56,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:42:56,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:42:56,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:42:56,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:42:56,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:42:56,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:42:56,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:42:56,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:42:56,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:42:56,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:42:56,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:42:56,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:42:56,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:42:56,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:42:56,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:42:56,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:42:56,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:42:56,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:42:56,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:42:56,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:42:56,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:42:56,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:42:56,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:42:56,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:42:56,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:42:56,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:42:56,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:42:56,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:42:56,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:42:56,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:42:56,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:42:56,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:42:56,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:42:56,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:42:56,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:42:56,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:42:56,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:42:56,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:42:56,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:42:56,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:42:56,535 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-26 23:42:56,561 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:42:56,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:42:56,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:42:56,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:42:56,568 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:42:56,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:42:56,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:42:56,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:42:56,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:42:56,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:42:56,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:42:56,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:42:56,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:42:56,570 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:42:56,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:42:56,570 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:42:56,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:42:56,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:42:56,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:42:56,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:42:56,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:42:56,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:42:56,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:42:56,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:42:56,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:42:56,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:42:56,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:42:56,579 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:42:56,579 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:42:56,579 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:42:56,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:42:56,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:42:56,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:42:56,885 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:42:56,886 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:42:56,886 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc.i [2019-12-26 23:42:56,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f65bd8923/9dc928b068354e5eab313fe7ff9bbe60/FLAGf3c835aee [2019-12-26 23:42:57,540 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:42:57,541 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc.i [2019-12-26 23:42:57,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f65bd8923/9dc928b068354e5eab313fe7ff9bbe60/FLAGf3c835aee [2019-12-26 23:42:57,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f65bd8923/9dc928b068354e5eab313fe7ff9bbe60 [2019-12-26 23:42:57,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:42:57,811 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:42:57,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:42:57,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:42:57,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:42:57,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:42:57" (1/1) ... [2019-12-26 23:42:57,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:57, skipping insertion in model container [2019-12-26 23:42:57,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:42:57" (1/1) ... [2019-12-26 23:42:57,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:42:57,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:42:58,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:42:58,472 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:42:58,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:42:58,635 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:42:58,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:58 WrapperNode [2019-12-26 23:42:58,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:42:58,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:42:58,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:42:58,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:42:58,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:58" (1/1) ... [2019-12-26 23:42:58,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:58" (1/1) ... [2019-12-26 23:42:58,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:42:58,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:42:58,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:42:58,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:42:58,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:58" (1/1) ... [2019-12-26 23:42:58,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:58" (1/1) ... [2019-12-26 23:42:58,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:58" (1/1) ... [2019-12-26 23:42:58,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:58" (1/1) ... [2019-12-26 23:42:58,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:58" (1/1) ... [2019-12-26 23:42:58,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:58" (1/1) ... [2019-12-26 23:42:58,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:58" (1/1) ... [2019-12-26 23:42:58,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:42:58,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:42:58,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:42:58,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:42:58,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:58" (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-26 23:42:58,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:42:58,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:42:58,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:42:58,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:42:58,818 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:42:58,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:42:58,818 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:42:58,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:42:58,819 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:42:58,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:42:58,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:42:58,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:42:58,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:42:58,821 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:42:59,538 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:42:59,538 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:42:59,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:42:59 BoogieIcfgContainer [2019-12-26 23:42:59,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:42:59,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:42:59,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:42:59,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:42:59,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:42:57" (1/3) ... [2019-12-26 23:42:59,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ec28f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:42:59, skipping insertion in model container [2019-12-26 23:42:59,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:42:58" (2/3) ... [2019-12-26 23:42:59,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ec28f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:42:59, skipping insertion in model container [2019-12-26 23:42:59,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:42:59" (3/3) ... [2019-12-26 23:42:59,549 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc.i [2019-12-26 23:42:59,560 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:42:59,561 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:42:59,569 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:42:59,570 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:42:59,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,667 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,667 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,667 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,668 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,669 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,681 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,681 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,690 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,690 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,690 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,697 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,698 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:42:59,720 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:42:59,741 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:42:59,741 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:42:59,741 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:42:59,741 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:42:59,741 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:42:59,741 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:42:59,742 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:42:59,742 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:42:59,766 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-26 23:42:59,768 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-26 23:42:59,876 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-26 23:42:59,877 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:42:59,892 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:42:59,916 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-26 23:42:59,967 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-26 23:42:59,967 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:42:59,975 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:42:59,995 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-26 23:42:59,996 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:43:05,087 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-12-26 23:43:05,381 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 23:43:05,505 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 23:43:05,600 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64821 [2019-12-26 23:43:05,600 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-26 23:43:05,605 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 89 transitions [2019-12-26 23:43:15,278 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80192 states. [2019-12-26 23:43:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 80192 states. [2019-12-26 23:43:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:43:15,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:15,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:43:15,289 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:15,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:15,294 INFO L82 PathProgramCache]: Analyzing trace with hash 801165869, now seen corresponding path program 1 times [2019-12-26 23:43:15,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:15,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565687734] [2019-12-26 23:43:15,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:15,504 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-26 23:43:15,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565687734] [2019-12-26 23:43:15,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:15,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:43:15,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532725718] [2019-12-26 23:43:15,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:43:15,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:15,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:43:15,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:43:15,528 INFO L87 Difference]: Start difference. First operand 80192 states. Second operand 3 states. [2019-12-26 23:43:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:18,466 INFO L93 Difference]: Finished difference Result 79136 states and 341584 transitions. [2019-12-26 23:43:18,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:43:18,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:43:18,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:19,066 INFO L225 Difference]: With dead ends: 79136 [2019-12-26 23:43:19,067 INFO L226 Difference]: Without dead ends: 74600 [2019-12-26 23:43:19,068 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-26 23:43:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-26 23:43:25,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74600. [2019-12-26 23:43:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74600 states. [2019-12-26 23:43:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74600 states to 74600 states and 321550 transitions. [2019-12-26 23:43:25,819 INFO L78 Accepts]: Start accepts. Automaton has 74600 states and 321550 transitions. Word has length 5 [2019-12-26 23:43:25,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:25,820 INFO L462 AbstractCegarLoop]: Abstraction has 74600 states and 321550 transitions. [2019-12-26 23:43:25,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:43:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 74600 states and 321550 transitions. [2019-12-26 23:43:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:43:25,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:25,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:25,830 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:25,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:25,830 INFO L82 PathProgramCache]: Analyzing trace with hash 144866957, now seen corresponding path program 1 times [2019-12-26 23:43:25,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:25,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27213534] [2019-12-26 23:43:25,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:25,989 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-26 23:43:25,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27213534] [2019-12-26 23:43:25,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:25,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:43:25,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734781167] [2019-12-26 23:43:25,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:43:25,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:25,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:43:25,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:43:25,992 INFO L87 Difference]: Start difference. First operand 74600 states and 321550 transitions. Second operand 4 states. [2019-12-26 23:43:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:29,496 INFO L93 Difference]: Finished difference Result 114840 states and 473340 transitions. [2019-12-26 23:43:29,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:43:29,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:43:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:29,899 INFO L225 Difference]: With dead ends: 114840 [2019-12-26 23:43:29,899 INFO L226 Difference]: Without dead ends: 114749 [2019-12-26 23:43:29,900 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-26 23:43:33,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114749 states. [2019-12-26 23:43:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114749 to 106549. [2019-12-26 23:43:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106549 states. [2019-12-26 23:43:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106549 states to 106549 states and 443513 transitions. [2019-12-26 23:43:40,873 INFO L78 Accepts]: Start accepts. Automaton has 106549 states and 443513 transitions. Word has length 13 [2019-12-26 23:43:40,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:40,874 INFO L462 AbstractCegarLoop]: Abstraction has 106549 states and 443513 transitions. [2019-12-26 23:43:40,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:43:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 106549 states and 443513 transitions. [2019-12-26 23:43:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:43:40,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:40,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:40,878 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:40,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:40,878 INFO L82 PathProgramCache]: Analyzing trace with hash 483707300, now seen corresponding path program 1 times [2019-12-26 23:43:40,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:40,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156997254] [2019-12-26 23:43:40,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:40,947 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-26 23:43:40,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156997254] [2019-12-26 23:43:40,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:40,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:43:40,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949002928] [2019-12-26 23:43:40,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:43:40,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:40,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:43:40,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:43:40,950 INFO L87 Difference]: Start difference. First operand 106549 states and 443513 transitions. Second operand 4 states. [2019-12-26 23:43:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:43,006 INFO L93 Difference]: Finished difference Result 148763 states and 604775 transitions. [2019-12-26 23:43:43,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:43:43,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:43:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:43,548 INFO L225 Difference]: With dead ends: 148763 [2019-12-26 23:43:43,548 INFO L226 Difference]: Without dead ends: 148659 [2019-12-26 23:43:43,549 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-26 23:43:52,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148659 states. [2019-12-26 23:43:54,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148659 to 126910. [2019-12-26 23:43:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126910 states. [2019-12-26 23:43:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126910 states to 126910 states and 524476 transitions. [2019-12-26 23:43:55,083 INFO L78 Accepts]: Start accepts. Automaton has 126910 states and 524476 transitions. Word has length 13 [2019-12-26 23:43:55,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:55,083 INFO L462 AbstractCegarLoop]: Abstraction has 126910 states and 524476 transitions. [2019-12-26 23:43:55,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:43:55,084 INFO L276 IsEmpty]: Start isEmpty. Operand 126910 states and 524476 transitions. [2019-12-26 23:43:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:43:55,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:55,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:55,089 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:55,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:55,089 INFO L82 PathProgramCache]: Analyzing trace with hash 145051196, now seen corresponding path program 1 times [2019-12-26 23:43:55,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:55,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325846782] [2019-12-26 23:43:55,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:55,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-26 23:43:55,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325846782] [2019-12-26 23:43:55,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:55,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:43:55,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802704527] [2019-12-26 23:43:55,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:43:55,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:55,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:43:55,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:43:55,188 INFO L87 Difference]: Start difference. First operand 126910 states and 524476 transitions. Second operand 5 states. [2019-12-26 23:43:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:57,321 INFO L93 Difference]: Finished difference Result 172949 states and 700308 transitions. [2019-12-26 23:43:57,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:43:57,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-26 23:43:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:57,834 INFO L225 Difference]: With dead ends: 172949 [2019-12-26 23:43:57,834 INFO L226 Difference]: Without dead ends: 172813 [2019-12-26 23:43:57,835 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-26 23:44:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172813 states. [2019-12-26 23:44:09,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172813 to 134187. [2019-12-26 23:44:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134187 states. [2019-12-26 23:44:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134187 states to 134187 states and 553595 transitions. [2019-12-26 23:44:09,714 INFO L78 Accepts]: Start accepts. Automaton has 134187 states and 553595 transitions. Word has length 14 [2019-12-26 23:44:09,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:09,714 INFO L462 AbstractCegarLoop]: Abstraction has 134187 states and 553595 transitions. [2019-12-26 23:44:09,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:44:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 134187 states and 553595 transitions. [2019-12-26 23:44:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 23:44:09,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:09,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:09,735 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:09,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:09,735 INFO L82 PathProgramCache]: Analyzing trace with hash -448648622, now seen corresponding path program 1 times [2019-12-26 23:44:09,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:09,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041150833] [2019-12-26 23:44:09,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:44:09,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041150833] [2019-12-26 23:44:09,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:09,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:44:09,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232797496] [2019-12-26 23:44:09,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:44:09,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:09,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:44:09,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:44:09,803 INFO L87 Difference]: Start difference. First operand 134187 states and 553595 transitions. Second operand 3 states. [2019-12-26 23:44:11,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:11,527 INFO L93 Difference]: Finished difference Result 133799 states and 552073 transitions. [2019-12-26 23:44:11,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:44:11,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 23:44:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:11,954 INFO L225 Difference]: With dead ends: 133799 [2019-12-26 23:44:11,954 INFO L226 Difference]: Without dead ends: 133799 [2019-12-26 23:44:11,954 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-26 23:44:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133799 states. [2019-12-26 23:44:23,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133799 to 133799. [2019-12-26 23:44:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133799 states. [2019-12-26 23:44:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133799 states to 133799 states and 552073 transitions. [2019-12-26 23:44:24,192 INFO L78 Accepts]: Start accepts. Automaton has 133799 states and 552073 transitions. Word has length 18 [2019-12-26 23:44:24,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:24,192 INFO L462 AbstractCegarLoop]: Abstraction has 133799 states and 552073 transitions. [2019-12-26 23:44:24,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:44:24,192 INFO L276 IsEmpty]: Start isEmpty. Operand 133799 states and 552073 transitions. [2019-12-26 23:44:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:44:24,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:24,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:24,217 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:24,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1144737546, now seen corresponding path program 1 times [2019-12-26 23:44:24,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:24,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091392321] [2019-12-26 23:44:24,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:24,297 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-26 23:44:24,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091392321] [2019-12-26 23:44:24,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:24,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:24,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63767975] [2019-12-26 23:44:24,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:24,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:24,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:24,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:24,299 INFO L87 Difference]: Start difference. First operand 133799 states and 552073 transitions. Second operand 4 states. [2019-12-26 23:44:30,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:30,613 INFO L93 Difference]: Finished difference Result 243998 states and 1008264 transitions. [2019-12-26 23:44:30,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:44:30,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 23:44:30,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:31,062 INFO L225 Difference]: With dead ends: 243998 [2019-12-26 23:44:31,062 INFO L226 Difference]: Without dead ends: 133380 [2019-12-26 23:44:31,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:44:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133380 states. [2019-12-26 23:44:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133380 to 132604. [2019-12-26 23:44:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132604 states. [2019-12-26 23:44:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132604 states to 132604 states and 541797 transitions. [2019-12-26 23:44:36,988 INFO L78 Accepts]: Start accepts. Automaton has 132604 states and 541797 transitions. Word has length 19 [2019-12-26 23:44:36,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:36,989 INFO L462 AbstractCegarLoop]: Abstraction has 132604 states and 541797 transitions. [2019-12-26 23:44:36,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:36,989 INFO L276 IsEmpty]: Start isEmpty. Operand 132604 states and 541797 transitions. [2019-12-26 23:44:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:44:37,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:37,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:37,004 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:37,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:37,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1997587133, now seen corresponding path program 1 times [2019-12-26 23:44:37,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:37,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724702925] [2019-12-26 23:44:37,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:37,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-26 23:44:37,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724702925] [2019-12-26 23:44:37,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:37,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:44:37,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246894026] [2019-12-26 23:44:37,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:44:37,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:37,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:44:37,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:44:37,101 INFO L87 Difference]: Start difference. First operand 132604 states and 541797 transitions. Second operand 5 states. [2019-12-26 23:44:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:39,556 INFO L93 Difference]: Finished difference Result 182821 states and 731119 transitions. [2019-12-26 23:44:39,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:44:39,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:44:39,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:40,112 INFO L225 Difference]: With dead ends: 182821 [2019-12-26 23:44:40,112 INFO L226 Difference]: Without dead ends: 181141 [2019-12-26 23:44:40,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:44:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181141 states. [2019-12-26 23:44:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181141 to 137168. [2019-12-26 23:44:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137168 states. [2019-12-26 23:44:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137168 states to 137168 states and 559766 transitions. [2019-12-26 23:44:52,006 INFO L78 Accepts]: Start accepts. Automaton has 137168 states and 559766 transitions. Word has length 19 [2019-12-26 23:44:52,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:52,006 INFO L462 AbstractCegarLoop]: Abstraction has 137168 states and 559766 transitions. [2019-12-26 23:44:52,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:44:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 137168 states and 559766 transitions. [2019-12-26 23:44:52,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-26 23:44:52,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:52,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:52,023 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:52,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:52,024 INFO L82 PathProgramCache]: Analyzing trace with hash 826616842, now seen corresponding path program 1 times [2019-12-26 23:44:52,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:52,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512448827] [2019-12-26 23:44:52,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:52,074 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-26 23:44:52,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512448827] [2019-12-26 23:44:52,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:52,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:52,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186568790] [2019-12-26 23:44:52,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:52,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:52,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:52,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:52,076 INFO L87 Difference]: Start difference. First operand 137168 states and 559766 transitions. Second operand 4 states. [2019-12-26 23:44:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:54,069 INFO L93 Difference]: Finished difference Result 208641 states and 859416 transitions. [2019-12-26 23:44:54,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:44:54,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-26 23:44:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:54,373 INFO L225 Difference]: With dead ends: 208641 [2019-12-26 23:44:54,373 INFO L226 Difference]: Without dead ends: 95129 [2019-12-26 23:44:54,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95129 states. [2019-12-26 23:45:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95129 to 88607. [2019-12-26 23:45:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88607 states. [2019-12-26 23:45:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88607 states to 88607 states and 363903 transitions. [2019-12-26 23:45:04,723 INFO L78 Accepts]: Start accepts. Automaton has 88607 states and 363903 transitions. Word has length 20 [2019-12-26 23:45:04,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:04,724 INFO L462 AbstractCegarLoop]: Abstraction has 88607 states and 363903 transitions. [2019-12-26 23:45:04,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 88607 states and 363903 transitions. [2019-12-26 23:45:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-26 23:45:04,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:04,744 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] [2019-12-26 23:45:04,744 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:04,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:04,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1336681809, now seen corresponding path program 1 times [2019-12-26 23:45:04,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:04,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015299787] [2019-12-26 23:45:04,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:04,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-26 23:45:04,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015299787] [2019-12-26 23:45:04,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:04,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:04,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367263831] [2019-12-26 23:45:04,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:04,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:04,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:04,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:04,796 INFO L87 Difference]: Start difference. First operand 88607 states and 363903 transitions. Second operand 3 states. [2019-12-26 23:45:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:05,252 INFO L93 Difference]: Finished difference Result 84552 states and 342415 transitions. [2019-12-26 23:45:05,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:05,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-26 23:45:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:05,478 INFO L225 Difference]: With dead ends: 84552 [2019-12-26 23:45:05,478 INFO L226 Difference]: Without dead ends: 84552 [2019-12-26 23:45:05,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84552 states. [2019-12-26 23:45:13,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84552 to 84552. [2019-12-26 23:45:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84552 states. [2019-12-26 23:45:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84552 states to 84552 states and 342415 transitions. [2019-12-26 23:45:13,650 INFO L78 Accepts]: Start accepts. Automaton has 84552 states and 342415 transitions. Word has length 21 [2019-12-26 23:45:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:13,650 INFO L462 AbstractCegarLoop]: Abstraction has 84552 states and 342415 transitions. [2019-12-26 23:45:13,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 84552 states and 342415 transitions. [2019-12-26 23:45:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:45:13,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:13,666 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-26 23:45:13,666 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:13,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:13,666 INFO L82 PathProgramCache]: Analyzing trace with hash 120078242, now seen corresponding path program 1 times [2019-12-26 23:45:13,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:13,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468358003] [2019-12-26 23:45:13,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:13,732 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-26 23:45:13,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468358003] [2019-12-26 23:45:13,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:13,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:45:13,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958575410] [2019-12-26 23:45:13,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:13,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:13,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:13,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:13,734 INFO L87 Difference]: Start difference. First operand 84552 states and 342415 transitions. Second operand 6 states. [2019-12-26 23:45:15,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:15,490 INFO L93 Difference]: Finished difference Result 128943 states and 503000 transitions. [2019-12-26 23:45:15,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:45:15,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 23:45:15,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:15,820 INFO L225 Difference]: With dead ends: 128943 [2019-12-26 23:45:15,821 INFO L226 Difference]: Without dead ends: 126131 [2019-12-26 23:45:15,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:45:22,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126131 states. [2019-12-26 23:45:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126131 to 99741. [2019-12-26 23:45:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99741 states. [2019-12-26 23:45:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99741 states to 99741 states and 399345 transitions. [2019-12-26 23:45:23,889 INFO L78 Accepts]: Start accepts. Automaton has 99741 states and 399345 transitions. Word has length 22 [2019-12-26 23:45:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:23,890 INFO L462 AbstractCegarLoop]: Abstraction has 99741 states and 399345 transitions. [2019-12-26 23:45:23,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 99741 states and 399345 transitions. [2019-12-26 23:45:23,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:45:23,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:23,905 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-26 23:45:23,905 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:23,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:23,905 INFO L82 PathProgramCache]: Analyzing trace with hash 458918585, now seen corresponding path program 1 times [2019-12-26 23:45:23,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:23,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966453834] [2019-12-26 23:45:23,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:23,979 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-26 23:45:23,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966453834] [2019-12-26 23:45:23,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:23,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:45:23,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554539618] [2019-12-26 23:45:23,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:23,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:23,981 INFO L87 Difference]: Start difference. First operand 99741 states and 399345 transitions. Second operand 6 states. [2019-12-26 23:45:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:25,613 INFO L93 Difference]: Finished difference Result 102103 states and 404946 transitions. [2019-12-26 23:45:25,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:45:25,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 23:45:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:25,903 INFO L225 Difference]: With dead ends: 102103 [2019-12-26 23:45:25,903 INFO L226 Difference]: Without dead ends: 99113 [2019-12-26 23:45:25,903 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-26 23:45:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99113 states. [2019-12-26 23:45:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99113 to 98620. [2019-12-26 23:45:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98620 states. [2019-12-26 23:45:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98620 states to 98620 states and 395258 transitions. [2019-12-26 23:45:34,918 INFO L78 Accepts]: Start accepts. Automaton has 98620 states and 395258 transitions. Word has length 22 [2019-12-26 23:45:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:34,918 INFO L462 AbstractCegarLoop]: Abstraction has 98620 states and 395258 transitions. [2019-12-26 23:45:34,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 98620 states and 395258 transitions. [2019-12-26 23:45:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:45:34,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:34,935 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-26 23:45:34,935 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:34,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:34,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1221135073, now seen corresponding path program 1 times [2019-12-26 23:45:34,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:34,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657053885] [2019-12-26 23:45:34,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:34,996 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-26 23:45:34,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657053885] [2019-12-26 23:45:34,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:34,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:34,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733842329] [2019-12-26 23:45:34,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:34,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:34,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:34,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:34,998 INFO L87 Difference]: Start difference. First operand 98620 states and 395258 transitions. Second operand 4 states. [2019-12-26 23:45:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:35,085 INFO L93 Difference]: Finished difference Result 19582 states and 68234 transitions. [2019-12-26 23:45:35,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:45:35,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-26 23:45:35,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:35,111 INFO L225 Difference]: With dead ends: 19582 [2019-12-26 23:45:35,111 INFO L226 Difference]: Without dead ends: 15386 [2019-12-26 23:45:35,111 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-26 23:45:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15386 states. [2019-12-26 23:45:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15386 to 15386. [2019-12-26 23:45:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15386 states. [2019-12-26 23:45:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15386 states to 15386 states and 51412 transitions. [2019-12-26 23:45:36,035 INFO L78 Accepts]: Start accepts. Automaton has 15386 states and 51412 transitions. Word has length 22 [2019-12-26 23:45:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:36,035 INFO L462 AbstractCegarLoop]: Abstraction has 15386 states and 51412 transitions. [2019-12-26 23:45:36,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 15386 states and 51412 transitions. [2019-12-26 23:45:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 23:45:36,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:36,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:36,044 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:36,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash -966417507, now seen corresponding path program 1 times [2019-12-26 23:45:36,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:36,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658874331] [2019-12-26 23:45:36,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:36,133 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-26 23:45:36,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658874331] [2019-12-26 23:45:36,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:36,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:45:36,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471990506] [2019-12-26 23:45:36,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:36,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:36,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:36,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:36,136 INFO L87 Difference]: Start difference. First operand 15386 states and 51412 transitions. Second operand 5 states. [2019-12-26 23:45:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:36,205 INFO L93 Difference]: Finished difference Result 6122 states and 19010 transitions. [2019-12-26 23:45:36,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:45:36,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-26 23:45:36,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:36,217 INFO L225 Difference]: With dead ends: 6122 [2019-12-26 23:45:36,217 INFO L226 Difference]: Without dead ends: 5211 [2019-12-26 23:45:36,217 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-26 23:45:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5211 states. [2019-12-26 23:45:36,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5211 to 5211. [2019-12-26 23:45:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5211 states. [2019-12-26 23:45:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5211 states to 5211 states and 15988 transitions. [2019-12-26 23:45:36,311 INFO L78 Accepts]: Start accepts. Automaton has 5211 states and 15988 transitions. Word has length 31 [2019-12-26 23:45:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:36,311 INFO L462 AbstractCegarLoop]: Abstraction has 5211 states and 15988 transitions. [2019-12-26 23:45:36,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 5211 states and 15988 transitions. [2019-12-26 23:45:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:45:36,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:36,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:36,319 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:36,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:36,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1415290960, now seen corresponding path program 1 times [2019-12-26 23:45:36,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:36,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888020516] [2019-12-26 23:45:36,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:36,407 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-26 23:45:36,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888020516] [2019-12-26 23:45:36,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:36,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:45:36,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829190326] [2019-12-26 23:45:36,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:36,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:36,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:36,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:36,410 INFO L87 Difference]: Start difference. First operand 5211 states and 15988 transitions. Second operand 6 states. [2019-12-26 23:45:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:36,489 INFO L93 Difference]: Finished difference Result 4419 states and 14011 transitions. [2019-12-26 23:45:36,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:45:36,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 23:45:36,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:36,497 INFO L225 Difference]: With dead ends: 4419 [2019-12-26 23:45:36,497 INFO L226 Difference]: Without dead ends: 3928 [2019-12-26 23:45:36,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:45:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states. [2019-12-26 23:45:36,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 3928. [2019-12-26 23:45:36,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2019-12-26 23:45:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 12986 transitions. [2019-12-26 23:45:36,557 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 12986 transitions. Word has length 40 [2019-12-26 23:45:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:36,557 INFO L462 AbstractCegarLoop]: Abstraction has 3928 states and 12986 transitions. [2019-12-26 23:45:36,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 12986 transitions. [2019-12-26 23:45:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:45:36,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:36,562 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] [2019-12-26 23:45:36,562 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash -50307014, now seen corresponding path program 1 times [2019-12-26 23:45:36,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:36,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833222097] [2019-12-26 23:45:36,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:36,609 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-26 23:45:36,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833222097] [2019-12-26 23:45:36,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:36,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:36,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263503374] [2019-12-26 23:45:36,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:36,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:36,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:36,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:36,611 INFO L87 Difference]: Start difference. First operand 3928 states and 12986 transitions. Second operand 3 states. [2019-12-26 23:45:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:36,665 INFO L93 Difference]: Finished difference Result 5525 states and 17741 transitions. [2019-12-26 23:45:36,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:36,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 23:45:36,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:36,679 INFO L225 Difference]: With dead ends: 5525 [2019-12-26 23:45:36,679 INFO L226 Difference]: Without dead ends: 5525 [2019-12-26 23:45:36,680 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-26 23:45:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5525 states. [2019-12-26 23:45:36,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 4786. [2019-12-26 23:45:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4786 states. [2019-12-26 23:45:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4786 states to 4786 states and 15560 transitions. [2019-12-26 23:45:36,792 INFO L78 Accepts]: Start accepts. Automaton has 4786 states and 15560 transitions. Word has length 55 [2019-12-26 23:45:36,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:36,792 INFO L462 AbstractCegarLoop]: Abstraction has 4786 states and 15560 transitions. [2019-12-26 23:45:36,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4786 states and 15560 transitions. [2019-12-26 23:45:36,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:45:36,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:36,800 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] [2019-12-26 23:45:36,800 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:36,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:36,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2065982534, now seen corresponding path program 1 times [2019-12-26 23:45:36,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:36,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821502477] [2019-12-26 23:45:36,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:36,913 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-26 23:45:36,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821502477] [2019-12-26 23:45:36,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:36,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:45:36,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178722408] [2019-12-26 23:45:36,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:45:36,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:36,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:45:36,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:45:36,918 INFO L87 Difference]: Start difference. First operand 4786 states and 15560 transitions. Second operand 7 states. [2019-12-26 23:45:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:37,132 INFO L93 Difference]: Finished difference Result 9078 states and 28967 transitions. [2019-12-26 23:45:37,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:45:37,133 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-26 23:45:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:37,145 INFO L225 Difference]: With dead ends: 9078 [2019-12-26 23:45:37,145 INFO L226 Difference]: Without dead ends: 6572 [2019-12-26 23:45:37,145 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-26 23:45:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6572 states. [2019-12-26 23:45:37,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6572 to 5928. [2019-12-26 23:45:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5928 states. [2019-12-26 23:45:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5928 states to 5928 states and 19177 transitions. [2019-12-26 23:45:37,237 INFO L78 Accepts]: Start accepts. Automaton has 5928 states and 19177 transitions. Word has length 55 [2019-12-26 23:45:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:37,238 INFO L462 AbstractCegarLoop]: Abstraction has 5928 states and 19177 transitions. [2019-12-26 23:45:37,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:45:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 5928 states and 19177 transitions. [2019-12-26 23:45:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:45:37,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:37,245 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] [2019-12-26 23:45:37,245 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:37,245 INFO L82 PathProgramCache]: Analyzing trace with hash 499320198, now seen corresponding path program 2 times [2019-12-26 23:45:37,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:37,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653096974] [2019-12-26 23:45:37,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:37,348 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-26 23:45:37,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653096974] [2019-12-26 23:45:37,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:37,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:45:37,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834425345] [2019-12-26 23:45:37,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:45:37,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:37,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:45:37,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:45:37,352 INFO L87 Difference]: Start difference. First operand 5928 states and 19177 transitions. Second operand 7 states. [2019-12-26 23:45:37,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:37,592 INFO L93 Difference]: Finished difference Result 11030 states and 34860 transitions. [2019-12-26 23:45:37,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:45:37,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-26 23:45:37,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:37,610 INFO L225 Difference]: With dead ends: 11030 [2019-12-26 23:45:37,610 INFO L226 Difference]: Without dead ends: 8062 [2019-12-26 23:45:37,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-26 23:45:37,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2019-12-26 23:45:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 7236. [2019-12-26 23:45:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7236 states. [2019-12-26 23:45:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7236 states to 7236 states and 23166 transitions. [2019-12-26 23:45:37,747 INFO L78 Accepts]: Start accepts. Automaton has 7236 states and 23166 transitions. Word has length 55 [2019-12-26 23:45:37,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:37,747 INFO L462 AbstractCegarLoop]: Abstraction has 7236 states and 23166 transitions. [2019-12-26 23:45:37,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:45:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 7236 states and 23166 transitions. [2019-12-26 23:45:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:45:37,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:37,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:37,755 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:37,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:37,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1644123802, now seen corresponding path program 3 times [2019-12-26 23:45:37,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:37,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985529733] [2019-12-26 23:45:37,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:37,848 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-26 23:45:37,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985529733] [2019-12-26 23:45:37,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:37,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:45:37,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231261351] [2019-12-26 23:45:37,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:45:37,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:37,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:45:37,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:45:37,850 INFO L87 Difference]: Start difference. First operand 7236 states and 23166 transitions. Second operand 8 states. [2019-12-26 23:45:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:38,527 INFO L93 Difference]: Finished difference Result 13967 states and 42866 transitions. [2019-12-26 23:45:38,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:45:38,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-26 23:45:38,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:38,544 INFO L225 Difference]: With dead ends: 13967 [2019-12-26 23:45:38,545 INFO L226 Difference]: Without dead ends: 11953 [2019-12-26 23:45:38,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:45:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11953 states. [2019-12-26 23:45:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11953 to 7256. [2019-12-26 23:45:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7256 states. [2019-12-26 23:45:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7256 states to 7256 states and 23173 transitions. [2019-12-26 23:45:38,683 INFO L78 Accepts]: Start accepts. Automaton has 7256 states and 23173 transitions. Word has length 55 [2019-12-26 23:45:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:38,684 INFO L462 AbstractCegarLoop]: Abstraction has 7256 states and 23173 transitions. [2019-12-26 23:45:38,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:45:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 7256 states and 23173 transitions. [2019-12-26 23:45:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:45:38,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:38,692 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] [2019-12-26 23:45:38,692 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:38,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash -779597912, now seen corresponding path program 4 times [2019-12-26 23:45:38,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:38,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952733404] [2019-12-26 23:45:38,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:39,244 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-26 23:45:39,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952733404] [2019-12-26 23:45:39,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:39,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:45:39,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480754031] [2019-12-26 23:45:39,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:45:39,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:39,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:45:39,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:45:39,246 INFO L87 Difference]: Start difference. First operand 7256 states and 23173 transitions. Second operand 9 states. [2019-12-26 23:45:40,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:40,237 INFO L93 Difference]: Finished difference Result 19586 states and 60159 transitions. [2019-12-26 23:45:40,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 23:45:40,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-26 23:45:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:40,265 INFO L225 Difference]: With dead ends: 19586 [2019-12-26 23:45:40,265 INFO L226 Difference]: Without dead ends: 17572 [2019-12-26 23:45:40,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-26 23:45:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17572 states. [2019-12-26 23:45:40,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17572 to 7116. [2019-12-26 23:45:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7116 states. [2019-12-26 23:45:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7116 states to 7116 states and 22744 transitions. [2019-12-26 23:45:40,442 INFO L78 Accepts]: Start accepts. Automaton has 7116 states and 22744 transitions. Word has length 55 [2019-12-26 23:45:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:40,442 INFO L462 AbstractCegarLoop]: Abstraction has 7116 states and 22744 transitions. [2019-12-26 23:45:40,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:45:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 7116 states and 22744 transitions. [2019-12-26 23:45:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:45:40,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:40,451 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] [2019-12-26 23:45:40,451 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:40,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:40,451 INFO L82 PathProgramCache]: Analyzing trace with hash 500729536, now seen corresponding path program 5 times [2019-12-26 23:45:40,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:40,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918546941] [2019-12-26 23:45:40,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:40,561 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-26 23:45:40,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918546941] [2019-12-26 23:45:40,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:40,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:45:40,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489351658] [2019-12-26 23:45:40,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:45:40,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:40,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:45:40,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:45:40,563 INFO L87 Difference]: Start difference. First operand 7116 states and 22744 transitions. Second operand 9 states. [2019-12-26 23:45:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:41,703 INFO L93 Difference]: Finished difference Result 26842 states and 82465 transitions. [2019-12-26 23:45:41,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-26 23:45:41,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-26 23:45:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:41,737 INFO L225 Difference]: With dead ends: 26842 [2019-12-26 23:45:41,737 INFO L226 Difference]: Without dead ends: 21492 [2019-12-26 23:45:41,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-26 23:45:41,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21492 states. [2019-12-26 23:45:41,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21492 to 9032. [2019-12-26 23:45:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9032 states. [2019-12-26 23:45:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9032 states to 9032 states and 28966 transitions. [2019-12-26 23:45:41,971 INFO L78 Accepts]: Start accepts. Automaton has 9032 states and 28966 transitions. Word has length 55 [2019-12-26 23:45:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:41,971 INFO L462 AbstractCegarLoop]: Abstraction has 9032 states and 28966 transitions. [2019-12-26 23:45:41,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:45:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 9032 states and 28966 transitions. [2019-12-26 23:45:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:45:41,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:41,986 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] [2019-12-26 23:45:41,986 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:41,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:41,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2073987088, now seen corresponding path program 6 times [2019-12-26 23:45:41,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:41,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989039361] [2019-12-26 23:45:41,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:42,044 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-26 23:45:42,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989039361] [2019-12-26 23:45:42,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:42,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:42,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469213134] [2019-12-26 23:45:42,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:42,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:42,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:42,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:42,046 INFO L87 Difference]: Start difference. First operand 9032 states and 28966 transitions. Second operand 3 states. [2019-12-26 23:45:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:42,075 INFO L93 Difference]: Finished difference Result 7554 states and 23664 transitions. [2019-12-26 23:45:42,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:42,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 23:45:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:42,086 INFO L225 Difference]: With dead ends: 7554 [2019-12-26 23:45:42,087 INFO L226 Difference]: Without dead ends: 7554 [2019-12-26 23:45:42,087 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-26 23:45:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7554 states. [2019-12-26 23:45:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7554 to 7534. [2019-12-26 23:45:42,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7534 states. [2019-12-26 23:45:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7534 states to 7534 states and 23613 transitions. [2019-12-26 23:45:42,199 INFO L78 Accepts]: Start accepts. Automaton has 7534 states and 23613 transitions. Word has length 55 [2019-12-26 23:45:42,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:42,199 INFO L462 AbstractCegarLoop]: Abstraction has 7534 states and 23613 transitions. [2019-12-26 23:45:42,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand 7534 states and 23613 transitions. [2019-12-26 23:45:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:45:42,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:42,207 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] [2019-12-26 23:45:42,208 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:42,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:42,208 INFO L82 PathProgramCache]: Analyzing trace with hash -261820410, now seen corresponding path program 1 times [2019-12-26 23:45:42,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:42,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046932880] [2019-12-26 23:45:42,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:42,377 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-26 23:45:42,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046932880] [2019-12-26 23:45:42,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:42,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:45:42,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361982364] [2019-12-26 23:45:42,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:45:42,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:42,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:45:42,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:45:42,380 INFO L87 Difference]: Start difference. First operand 7534 states and 23613 transitions. Second operand 11 states. [2019-12-26 23:45:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:43,201 INFO L93 Difference]: Finished difference Result 12134 states and 37431 transitions. [2019-12-26 23:45:43,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 23:45:43,202 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-26 23:45:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:43,217 INFO L225 Difference]: With dead ends: 12134 [2019-12-26 23:45:43,217 INFO L226 Difference]: Without dead ends: 8472 [2019-12-26 23:45:43,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-26 23:45:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8472 states. [2019-12-26 23:45:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8472 to 7718. [2019-12-26 23:45:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7718 states. [2019-12-26 23:45:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7718 states to 7718 states and 23792 transitions. [2019-12-26 23:45:43,347 INFO L78 Accepts]: Start accepts. Automaton has 7718 states and 23792 transitions. Word has length 56 [2019-12-26 23:45:43,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:43,348 INFO L462 AbstractCegarLoop]: Abstraction has 7718 states and 23792 transitions. [2019-12-26 23:45:43,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:45:43,348 INFO L276 IsEmpty]: Start isEmpty. Operand 7718 states and 23792 transitions. [2019-12-26 23:45:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:45:43,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:43,361 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] [2019-12-26 23:45:43,361 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:43,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:43,362 INFO L82 PathProgramCache]: Analyzing trace with hash -899860532, now seen corresponding path program 2 times [2019-12-26 23:45:43,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:43,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648224092] [2019-12-26 23:45:43,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:43,680 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-26 23:45:43,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648224092] [2019-12-26 23:45:43,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:43,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:45:43,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906125442] [2019-12-26 23:45:43,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:45:43,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:43,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:45:43,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:45:43,682 INFO L87 Difference]: Start difference. First operand 7718 states and 23792 transitions. Second operand 14 states. [2019-12-26 23:45:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:46,284 INFO L93 Difference]: Finished difference Result 10315 states and 30677 transitions. [2019-12-26 23:45:46,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-26 23:45:46,284 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-26 23:45:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:46,301 INFO L225 Difference]: With dead ends: 10315 [2019-12-26 23:45:46,301 INFO L226 Difference]: Without dead ends: 9911 [2019-12-26 23:45:46,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=975, Unknown=0, NotChecked=0, Total=1190 [2019-12-26 23:45:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9911 states. [2019-12-26 23:45:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9911 to 8483. [2019-12-26 23:45:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8483 states. [2019-12-26 23:45:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8483 states to 8483 states and 25929 transitions. [2019-12-26 23:45:46,433 INFO L78 Accepts]: Start accepts. Automaton has 8483 states and 25929 transitions. Word has length 56 [2019-12-26 23:45:46,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:46,433 INFO L462 AbstractCegarLoop]: Abstraction has 8483 states and 25929 transitions. [2019-12-26 23:45:46,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:45:46,433 INFO L276 IsEmpty]: Start isEmpty. Operand 8483 states and 25929 transitions. [2019-12-26 23:45:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:45:46,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:46,442 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] [2019-12-26 23:45:46,442 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:46,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:46,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1879577232, now seen corresponding path program 3 times [2019-12-26 23:45:46,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:46,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21331842] [2019-12-26 23:45:46,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:46,544 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-26 23:45:46,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21331842] [2019-12-26 23:45:46,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:46,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:45:46,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649008123] [2019-12-26 23:45:46,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:45:46,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:46,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:45:46,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:45:46,546 INFO L87 Difference]: Start difference. First operand 8483 states and 25929 transitions. Second operand 9 states. [2019-12-26 23:45:47,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:47,197 INFO L93 Difference]: Finished difference Result 9591 states and 28720 transitions. [2019-12-26 23:45:47,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:45:47,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-26 23:45:47,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:47,214 INFO L225 Difference]: With dead ends: 9591 [2019-12-26 23:45:47,214 INFO L226 Difference]: Without dead ends: 9249 [2019-12-26 23:45:47,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:45:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9249 states. [2019-12-26 23:45:47,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9249 to 8287. [2019-12-26 23:45:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8287 states. [2019-12-26 23:45:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8287 states to 8287 states and 25373 transitions. [2019-12-26 23:45:47,407 INFO L78 Accepts]: Start accepts. Automaton has 8287 states and 25373 transitions. Word has length 56 [2019-12-26 23:45:47,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:47,407 INFO L462 AbstractCegarLoop]: Abstraction has 8287 states and 25373 transitions. [2019-12-26 23:45:47,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:45:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 8287 states and 25373 transitions. [2019-12-26 23:45:47,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:45:47,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:47,415 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] [2019-12-26 23:45:47,416 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:47,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:47,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1827744688, now seen corresponding path program 4 times [2019-12-26 23:45:47,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:47,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042073677] [2019-12-26 23:45:47,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:45:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:45:47,518 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:45:47,518 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:45:47,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~x$r_buff1_thd1~0_405 0) (= v_~z~0_42 0) (= v_~y~0_203 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2055~0.base_25|)) (= 0 v_~x$w_buff1~0_314) (= 0 v_~x$r_buff0_thd3~0_141) (= v_~x$flush_delayed~0_58 0) (= v_~__unbuffered_p0_EBX~0_60 0) (= v_~x$mem_tmp~0_35 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2055~0.base_25| 1)) (= 0 v_~__unbuffered_p2_EAX~0_39) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$w_buff0_used~0_913) (= v_~x$r_buff0_thd0~0_157 0) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1_used~0_606) (= 0 v_~weak$$choice0~0_33) (= 0 v_~x$r_buff0_thd2~0_302) (= 0 v_~x$r_buff1_thd2~0_251) (= 0 |v_ULTIMATE.start_main_~#t2055~0.offset_19|) (= v_~x$r_buff1_thd0~0_275 0) (= 0 v_~x$w_buff0~0_388) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2055~0.base_25| 4)) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2055~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2055~0.base_25|) |v_ULTIMATE.start_main_~#t2055~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff1_thd3~0_254) (= v_~main$tmp_guard0~0_48 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2055~0.base_25|) (= 0 v_~x~0_230) (= v_~weak$$choice2~0_176 0) (= v_~x$r_buff0_thd1~0_365 0) (= 0 v_~__unbuffered_p0_EAX~0_54))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_405, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_141, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_251, ULTIMATE.start_main_~#t2056~0.base=|v_ULTIMATE.start_main_~#t2056~0.base_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_33, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t2057~0.base=|v_ULTIMATE.start_main_~#t2057~0.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_365, ULTIMATE.start_main_~#t2055~0.base=|v_ULTIMATE.start_main_~#t2055~0.base_25|, ULTIMATE.start_main_~#t2055~0.offset=|v_ULTIMATE.start_main_~#t2055~0.offset_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_71|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_35, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_59|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_203, ULTIMATE.start_main_~#t2057~0.offset=|v_ULTIMATE.start_main_~#t2057~0.offset_14|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_275, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2056~0.offset=|v_ULTIMATE.start_main_~#t2056~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2056~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2057~0.base, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2055~0.base, ULTIMATE.start_main_~#t2055~0.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2057~0.offset, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2056~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:45:47,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2056~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2056~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2056~0.base_10|)) (= |v_ULTIMATE.start_main_~#t2056~0.offset_9| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2056~0.base_10|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2056~0.base_10| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2056~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2056~0.base_10|) |v_ULTIMATE.start_main_~#t2056~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2056~0.offset=|v_ULTIMATE.start_main_~#t2056~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2056~0.base=|v_ULTIMATE.start_main_~#t2056~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2056~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2056~0.base] because there is no mapped edge [2019-12-26 23:45:47,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2057~0.base_11| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2057~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2057~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2057~0.base_11|) |v_ULTIMATE.start_main_~#t2057~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2057~0.base_11| 0)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2057~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t2057~0.offset_10| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2057~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2057~0.offset=|v_ULTIMATE.start_main_~#t2057~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2057~0.base=|v_ULTIMATE.start_main_~#t2057~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2057~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2057~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 23:45:47,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff1_used~0_56 v_~x$w_buff0_used~0_106) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_7|) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_7|) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_15) (= 1 v_~x$w_buff0_used~0_105) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= 0 (mod v_~x$w_buff1_used~0_56 256)) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 23:45:47,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2009394970 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-2009394970 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-2009394970| ~x$w_buff1~0_In-2009394970)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out-2009394970| ~x~0_In-2009394970) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2009394970, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2009394970, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2009394970, ~x~0=~x~0_In-2009394970} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-2009394970|, ~x$w_buff1~0=~x$w_buff1~0_In-2009394970, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2009394970, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2009394970, ~x~0=~x~0_In-2009394970} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:45:47,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-26 23:45:47,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In516088963 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In516088963 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out516088963| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out516088963| ~x$w_buff0_used~0_In516088963)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In516088963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In516088963} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out516088963|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In516088963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In516088963} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:45:47,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1151514905 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1151514905 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1151514905|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1151514905 |P1Thread1of1ForFork0_#t~ite28_Out1151514905|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1151514905, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1151514905} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1151514905, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1151514905|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1151514905} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 23:45:47,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1539696805 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1539696805 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1539696805 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1539696805 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1539696805 |P1Thread1of1ForFork0_#t~ite29_Out-1539696805|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1539696805|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1539696805, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1539696805, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1539696805, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1539696805} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1539696805, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1539696805, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1539696805, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1539696805|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1539696805} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 23:45:47,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In761604274 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out761604274| ~x$w_buff0~0_In761604274) (= |P0Thread1of1ForFork2_#t~ite8_In761604274| |P0Thread1of1ForFork2_#t~ite8_Out761604274|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out761604274| |P0Thread1of1ForFork2_#t~ite8_Out761604274|) .cse0 (= |P0Thread1of1ForFork2_#t~ite8_Out761604274| ~x$w_buff0~0_In761604274) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In761604274 256)))) (or (= (mod ~x$w_buff0_used~0_In761604274 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In761604274 256) 0)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In761604274 256) 0))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In761604274, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In761604274, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In761604274|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In761604274, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In761604274, ~weak$$choice2~0=~weak$$choice2~0_In761604274, ~x$w_buff0_used~0=~x$w_buff0_used~0_In761604274} OutVars{~x$w_buff0~0=~x$w_buff0~0_In761604274, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In761604274, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out761604274|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In761604274, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out761604274|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In761604274, ~weak$$choice2~0=~weak$$choice2~0_In761604274, ~x$w_buff0_used~0=~x$w_buff0_used~0_In761604274} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 23:45:47,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1314515235 256)))) (or (and (= ~x$w_buff0_used~0_In1314515235 |P0Thread1of1ForFork2_#t~ite15_Out1314515235|) (= |P0Thread1of1ForFork2_#t~ite14_In1314515235| |P0Thread1of1ForFork2_#t~ite14_Out1314515235|) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out1314515235| |P0Thread1of1ForFork2_#t~ite15_Out1314515235|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1314515235 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1314515235 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1314515235 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1314515235 256))))) (= ~x$w_buff0_used~0_In1314515235 |P0Thread1of1ForFork2_#t~ite14_Out1314515235|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1314515235, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1314515235, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1314515235, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1314515235|, ~weak$$choice2~0=~weak$$choice2~0_In1314515235, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1314515235} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1314515235, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1314515235, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1314515235|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1314515235, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1314515235|, ~weak$$choice2~0=~weak$$choice2~0_In1314515235, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1314515235} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 23:45:47,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-218516035 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite18_Out-218516035| ~x$w_buff1_used~0_In-218516035) (= |P0Thread1of1ForFork2_#t~ite17_In-218516035| |P0Thread1of1ForFork2_#t~ite17_Out-218516035|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-218516035 256)))) (or (= (mod ~x$w_buff0_used~0_In-218516035 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-218516035 256))) (and (= (mod ~x$w_buff1_used~0_In-218516035 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite17_Out-218516035| ~x$w_buff1_used~0_In-218516035) (= |P0Thread1of1ForFork2_#t~ite17_Out-218516035| |P0Thread1of1ForFork2_#t~ite18_Out-218516035|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-218516035, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-218516035|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-218516035, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-218516035, ~weak$$choice2~0=~weak$$choice2~0_In-218516035, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-218516035} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-218516035, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-218516035|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-218516035|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-218516035, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-218516035, ~weak$$choice2~0=~weak$$choice2~0_In-218516035, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-218516035} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:45:47,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_112 v_~x$r_buff0_thd1~0_111) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_17|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 23:45:47,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-824405881 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-824405881 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-824405881 256) 0) (and (= (mod ~x$w_buff1_used~0_In-824405881 256) 0) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In-824405881 256) 0) .cse0))) (= |P0Thread1of1ForFork2_#t~ite23_Out-824405881| |P0Thread1of1ForFork2_#t~ite24_Out-824405881|) (= ~x$r_buff1_thd1~0_In-824405881 |P0Thread1of1ForFork2_#t~ite23_Out-824405881|) .cse1) (and (not .cse1) (= ~x$r_buff1_thd1~0_In-824405881 |P0Thread1of1ForFork2_#t~ite24_Out-824405881|) (= |P0Thread1of1ForFork2_#t~ite23_In-824405881| |P0Thread1of1ForFork2_#t~ite23_Out-824405881|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-824405881, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-824405881, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-824405881, ~weak$$choice2~0=~weak$$choice2~0_In-824405881, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-824405881|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-824405881} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-824405881, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-824405881, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-824405881, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-824405881|, ~weak$$choice2~0=~weak$$choice2~0_In-824405881, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-824405881|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-824405881} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-26 23:45:47,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-1783832037 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1783832037 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1783832037 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1783832037 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1783832037|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1783832037 |P2Thread1of1ForFork1_#t~ite35_Out-1783832037|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1783832037, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1783832037, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1783832037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1783832037} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1783832037|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1783832037, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1783832037, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1783832037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1783832037} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:45:47,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-126124850 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-126124850 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-126124850 |P2Thread1of1ForFork1_#t~ite36_Out-126124850|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-126124850|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-126124850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-126124850} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-126124850|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-126124850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-126124850} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:45:47,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1823366170 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1823366170 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1823366170 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1823366170 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1823366170| ~x$r_buff1_thd3~0_In1823366170) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1823366170|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1823366170, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1823366170, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1823366170, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1823366170} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1823366170|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1823366170, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1823366170, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1823366170, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1823366170} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:45:47,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_52 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_53 1) v_~__unbuffered_cnt~0_52)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 23:45:47,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In61684512 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In61684512 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out61684512)) (and (= ~x$r_buff0_thd2~0_In61684512 ~x$r_buff0_thd2~0_Out61684512) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In61684512, ~x$w_buff0_used~0=~x$w_buff0_used~0_In61684512} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out61684512|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out61684512, ~x$w_buff0_used~0=~x$w_buff0_used~0_In61684512} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:45:47,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1844925922 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1844925922 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-1844925922 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1844925922 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1844925922| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-1844925922| ~x$r_buff1_thd2~0_In-1844925922)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1844925922, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1844925922, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1844925922, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1844925922} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1844925922|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1844925922, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1844925922, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1844925922, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1844925922} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 23:45:47,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 23:45:47,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-26 23:45:47,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_27 256) 0) (= (mod v_~x$w_buff0_used~0_180 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:45:47,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In2125545035 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2125545035 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out2125545035| ~x~0_In2125545035)) (and (not .cse1) (= ~x$w_buff1~0_In2125545035 |ULTIMATE.start_main_#t~ite41_Out2125545035|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2125545035, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2125545035, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2125545035, ~x~0=~x~0_In2125545035} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2125545035|, ~x$w_buff1~0=~x$w_buff1~0_In2125545035, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2125545035, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2125545035, ~x~0=~x~0_In2125545035} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 23:45:47,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_26 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-26 23:45:47,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In586582176 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In586582176 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out586582176|)) (and (= |ULTIMATE.start_main_#t~ite43_Out586582176| ~x$w_buff0_used~0_In586582176) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In586582176, ~x$w_buff0_used~0=~x$w_buff0_used~0_In586582176} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In586582176, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out586582176|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In586582176} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:45:47,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1035942494 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1035942494 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1035942494 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1035942494 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1035942494| ~x$w_buff1_used~0_In-1035942494) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite44_Out-1035942494| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1035942494, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1035942494, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1035942494, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1035942494} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1035942494, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1035942494, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1035942494, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1035942494|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1035942494} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:45:47,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In570647192 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In570647192 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In570647192 |ULTIMATE.start_main_#t~ite45_Out570647192|)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out570647192|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In570647192, ~x$w_buff0_used~0=~x$w_buff0_used~0_In570647192} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In570647192, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out570647192|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In570647192} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:45:47,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-438995591 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-438995591 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-438995591 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-438995591 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-438995591|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In-438995591 |ULTIMATE.start_main_#t~ite46_Out-438995591|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-438995591, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-438995591, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-438995591, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-438995591} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-438995591, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-438995591|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-438995591, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-438995591, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-438995591} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 23:45:47,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p0_EBX~0_48 0) (= 1 v_~__unbuffered_p2_EAX~0_27) (= v_~x$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite46_48|) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 1 v_~__unbuffered_p0_EAX~0_42) (= v_~main$tmp_guard1~0_23 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:45:47,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:45:47 BasicIcfg [2019-12-26 23:45:47,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:45:47,640 INFO L168 Benchmark]: Toolchain (without parser) took 169829.71 ms. Allocated memory was 138.4 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 101.4 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-26 23:45:47,641 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 23:45:47,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.30 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.2 MB in the beginning and 154.8 MB in the end (delta: -53.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:45:47,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.53 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:45:47,644 INFO L168 Benchmark]: Boogie Preprocessor took 40.08 ms. Allocated memory is still 202.9 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:45:47,648 INFO L168 Benchmark]: RCFGBuilder took 799.10 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 103.1 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:45:47,648 INFO L168 Benchmark]: TraceAbstraction took 168096.61 ms. Allocated memory was 202.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 102.4 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-26 23:45:47,660 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 824.30 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.2 MB in the beginning and 154.8 MB in the end (delta: -53.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.53 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.08 ms. Allocated memory is still 202.9 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 799.10 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 103.1 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 168096.61 ms. Allocated memory was 202.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 102.4 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 164 ProgramPointsBefore, 81 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 27 ChoiceCompositions, 6883 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 110 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 64821 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L732] 1 __unbuffered_p0_EAX = z [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 167.7s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 39.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3711 SDtfs, 6659 SDslu, 10978 SDs, 0 SdLazy, 6657 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137168occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 109.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 179715 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 888 NumberOfCodeBlocks, 888 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 808 ConstructedInterpolants, 0 QuantifiedInterpolants, 116347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...